一种用于描述逻辑程序的新的充分支持语义
A New Well-Supported Semantics for Description Logic Programs
浏览论文内容
中文总结 AI 辅助
研究描述逻辑程序的新语义，指出当前充分支持语义的局限，新语义更严格评估本体原子，保持一致性问题NP完全，确定等价语法类，用特定算子和变换表征，是当前语义严格子集且与逻辑程序相似。
中文摘要 AI 辅助
描述逻辑程序是将规则与本体相结合的强大形式主义。描述逻辑程序的充分支持语义确保没有答案集依赖循环依赖。大多数流行的逻辑程序语义都具有这种充分支持的属性。我们认识到当前DL程序的充分支持语义的两个局限性：其一致性问题的计算复杂性增加，以及缺乏归约变换特征。在这项工作中，我们提出了一种新的语义，它比当前语义更严格地评估本体原子。这使得其一致性问题的复杂性保持为NP完全，而不是增加到多项式层次结构的第二层。此外，我们确定了一类描述逻辑程序的语法类，对于这类程序，我们的新语义与当前语义等价。我们使用不动点算子和基于归约的变换来表征我们的语义。我们的新语义是当前充分支持语义的严格子集，因此它保持了先前的充分支持概念，同时引入了自己更严格的概念。由于它与逻辑程序的相似性，我们更喜欢我们新的充分支持概念。
英文摘要
Description logic programs are a powerful formalism for combining rules with ontologies. The well-supported semantics for description logic programs ensures that no answer sets rely on cyclic dependencies. Most popular semantics for logic programming have this property of well-supportedness. We recognize two limitations of the current well-supported semantics for DL programs: its increased computational complexity for the consistency problem and its lack of a reduct transformation characterization. In this work, we present a new semantics which evaluates ontological atoms more strictly than the current semantics. This keeps the complexity of its consistency problem NP-complete, rather than increasing it to the second level of the polynomial hierarchy. Additionally, we identify a syntactic class of description logic programs for which our new semantics is equivalent to the current semantics. We characterize our semantics using a fixpoint operator and a reduct-based transformation. Our new semantics is a strict subset of the current well-supported semantics, so it maintains the prior notion of well-supportedness while inducing its own stricter notion. We prefer our new notion of well-supportedness due to its similarities with logic programming.
