通过理性闭包实现可废止的RDFS
Defeasible RDFS via Rational Closure
AI总结：
本文将理性闭包集成到RDFS中，通过扩展$ρdf$为$ρdf_\ot$并引入新谓词符号，提出保持三元组语法且可在多项式时间内判定的可废止$ρdf_\ot$。
摘要：
在非单调逻辑领域，Rational Closure（RC，理性闭包）的概念被公认为一种突出的方法。近年来，RC 在描述逻辑（Description Logics，DLs）的背景下变得更加流行，描述逻辑是支撑语义网标准本体语言 OWL 2 的逻辑，其主要成分是类（classes）和角色（roles）。在这项工作中，我们展示了如何将 RC 集成到三元组语言 RDFS 中，RDFS 与 OWL 2 是两种主要的语义网标准本体语言。为此，我们从 $ρdf$ 出发，它是 RDFS 背后的逻辑，然后将其扩展为 $ρdf_\ot$，从而能够声明两个实体是不相容的。最终，我们通过典型的 RC 构造提出了可废止的 $ρdf_\ot$。我们方法的主要特点是：（i）与大多数在单调 RDFS 之上添加额外非单调规则层的方法不同，可废止的 $ρdf_\ot$ 在语法上仍然是一种三元组语言，并且是通过引入一些具有特定语义的新谓词符号而对 $ρdf_\ot$ 进行的简单扩展。特别是，如果任何 RDFS 推理器/存储不想考虑新谓词符号的额外语义，它可以将其作为普通术语处理；（ii）可废止的 $ρdf_\ot$ 蕴涵判定过程建立在 $ρdf_\ot$ 蕴涵判定过程之上，而后者又是对 $ρdf$ 判定过程的扩展，通过一些额外的推理规则有利于潜在的实现；（iii）可废止的 $ρdf_\ot$ 蕴涵可以在多项式时间内判定。
英文摘要：
In the field of non-monotonic logics, the notion of Rational Closure (RC) is acknowledged as a prominent approach. In recent years, RC has gained even more popularity in the context of Description Logics (DLs), the logic underpinning the semantic web standard ontology language OWL 2, whose main ingredients are classes and roles. In this work, we show how to integrate RC within the triple language RDFS, which together with OWL2 are the two major standard semantic web ontology languages. To do so, we start from $ρdf$, which is the logic behind RDFS, and then extend it to $ρdf_\bot$, allowing to state that two entities are incompatible. Eventually, we propose defeasible $ρdf_\bot$ via a typical RC construction. The main features of our approach are: (i) unlike most other approaches that add an extra non-monotone rule layer on top of monotone RDFS, defeasible $ρdf_\bot$ remains syntactically a triple language and is a simple extension of $ρdf_\bot$ by introducing some new predicate symbols with specific semantics. In particular, any RDFS reasoner/store may handle them as ordinary terms if it does not want to take account for the extra semantics of the new predicate symbols; (ii) the defeasible $ρdf_\bot$ entailment decision procedure is build on top of the $ρdf_\bot$ entailment decision procedure, which in turn is an extension of the one for $ρdf$ via some additional inference rules favouring an potential implementation; and (iii) defeasible $ρdf_\bot$ entailment can be decided in polynomial time.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
