.png){kind=icon}
返回
Rational closure for all description logics
.png){kind=icon}
OA
AI
DOI：10.1016/j.artint.2019.04.001.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Rational closure is one of the most extensively studied nonmonotonic extensions of description logics. Nonetheless, so far it has been investigated only for description logics that satisfy the disjoint model union property, or limited fragments that support nominals. In this paper we show that for sufficiently expressive description logics, the traditional correspondence between rational closure and ranked interpretations does not hold. Therefore, in order to extend rational closure to a wider class of description logics it is necessary to change the definition of rational closure, or alternatively abandon its standard semantics. Here we pursue the former approach, and introduce stable rational closure, based on stable rankings. The resulting nonmonotonic logic is a natural extension of the standard rational closure: First, its refined exceptionality criterion yields a closure that satisfies the KLM postulates. Second, when a knowledge base enjoys the disjoint model union property, then stable rational closure equals the old notion. In the other cases, stable rankings may raise the exceptionality level of some concepts. Stable rational closure has a model-theoretic semantics based on upward-closed models, that relax the canonical models adopted in the past, in order to deal with logics that do not satisfy the disjoint union model property. Unfortunately, stable rankings do not always exist, and are not necessarily unique. However, they can be effectively enumerated for all defeasible knowledge bases in SROIQ, using any algorithm for reasoning with ranked models. (C) 2019 Elsevier B.V. All rights reserved.
Keyword:
Rational closure
Stable rankings
Disjoint union model property
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
13.9
论文数:
6.1K
被引数:
1.9W
机构
引用论文
Reasoning in the Defeasible Description Logic εL⊥-computing standard inferences under rational and relevant semantics在理性和相关语义下的可实现描述逻辑 ε l ⊥-计算标准推论中的推理OAAI
.png){kind=icon}
OAAI分享收藏分享收藏分享收藏
查看更多内容