Nonmonotonic reasoning, preferential models and cumulative logics
Artificial Intelligence
What does a conditional knowledge base entail?
Artificial Intelligence
Description logics of minimal knowledge and negation as failure
ACM Transactions on Computational Logic (TOCL)
Reasoning about Typicality in Preferential Description Logics
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
ALC + T: a Preferential Extension of Description Logics
Fundamenta Informaticae - Advances in Computational Logic (CIL C08)
A nonmonotonic extension of KLM preferential logic P
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
A non-monotonic Description Logic for reasoning about typicality
Artificial Intelligence
Preferential Semantics for Plausible Subsumption in Possibility Theory
Minds and Machines
| Hi-index | 0.00 |
Extensions of Description Logics (DLs) to reason about typicality and defeasible inheritance have been largely investigated. In this paper, we consider two such extensions, namely (i) the extension of DLs with a typicality operator T, having the properties of Preferential nonmonotonic entailment P, and (ii) its variant with a typicality operator having the properties of the stronger Rational entailment R. The first one has been proposed in [6]. Here, we investigate the second one and we show, by a representation theorem, that it is equivalent to the approach to preferential subsumption proposed in [3]. We compare the two extensions, preferential and rational, and argue that the first one is more suitable than the second one to reason about typicality, as the latter leads to very unintuitive inferences.