- 1、本文档共16页,可阅读全部内容。
- 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
- 5、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
- 6、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们。
- 7、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
- 8、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
combining owl with strongfstrong-logic rules and defaults
Combining OWL with F-Logic Rules and
Defaults
Heiko Kattenstroth, Wolfgang May, and Franz Schenk
Institut f¨ur Informatik, Universit¨at G¨ottingen,
{hkattens|may|schenk}@informatik.uni-goettingen.de
Abstract. We describe the combination of OWL and F-Logic for the
architecture of Semantic Web application nodes. The approach has been
implemented by combining an existing Jena-based architecture with an
external Florid instance. The approach provides a tight language cou-
pling, i.e., the same notions can be defined both by OWL definitions
and by F-Logic rules. F-Logic rules are used for e.g., role-value-maps,
closed-world-reasoning, (stratified) negation, aggregation, and definition
of answer views; additionally the default inheritance of F-Logic can be
exploited.
1 Introduction
Description Logics [BCM+03] provide the underlying base for the dominat-
ing data model and languages for the Semantic Web, RDF, RDFS, and OWL
[OWL04]. It is based on the notion of classes, auch as Person, Country, City, and
properties, auch as hasName, hasChild, livesIn, hasCapital. This corresponds to
unary and binary relations in First-Order-Logic and relational databases, such
as Person(john), hasName(john,“John”), and livesIn(john,berlin). Description Log-
ics additionally allow for further specifications of classes (and properties) that
have no direct equivalent in relational databases, e.g. that a parent is a person
who has at least one child: Parent ≡ Person ∃hasChild. or the assertion that
children are persons, Parent ∀hasChild.Person. Such things can be expressed
by rules in FOL, but are not inherent concepts of FOL semantics.
Thus, the “built-ins” are more advanced than in FOL, but on the other
hand, DL formulas a
您可能关注的文档
- beyond behaviorism on the automaticity of higher mental.pdf
- beyond usage measuring library outcomes and value - carl.pdf
- bhavani sridharan hepu deng kinshuk - iier.pdf
- beyond models forecasting complex network strongprocessesstrong directly.pdf
- bibliography of works on the biblical covenants - the master's.pdf
- bibliometric analysis of nursing strongarticlesstrong focused on health.pdf
- bilateral brain strongprocessesstrong for comprehending natural language.pdf
- bioaerosol mass spectrometry for rapid detection of individual.pdf
- bilingualism and the latin language - assets.pdf
- biochemical evidence for a novel low molecular weight 2-5a.pdf
- coloring stronghstrong-free hypergraphs - homepages.math.uic.edu.pdf
- combined analysis of different logs in quantification of.pdf
- color spaces for computer graphics - ljll - upmc.pdf
- comment on punishment to serve both victim.pdf
- comment on ‘‘heat capacity, time constant, and sensitivity of.pdf
- command and control and the pathology of natural resource.pdf
- comment on neil h. buchananâ s social security and government.pdf
- coming together after the crisis global convergence of.pdf
- comments on “calibrated surface temperature forecasts from the.pdf
- communicating asset risk how name recognition and the format.pdf
文档评论(0)