Nonmonotonic reasoning, preferential models and cumulative logics
Artificial Intelligence
What does a conditional knowledge base entail?
Artificial Intelligence
Minimal belief and negation as failure
Artificial Intelligence
An epistemic operator for description logics
Artificial Intelligence
Description logics of minimal knowledge and negation as failure
ACM Transactions on Computational Logic (TOCL)
Adding Priorities and Specificity to Default Logic
JELIA '94 Proceedings of the European Workshop on Logics in Artificial Intelligence
Handling Partially Ordered Defaults in TMS
ECSQAU Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty
P-SHOQ(D): A Probabilistic Extension of SHOQ(D) for Probabilistic Ontologies in the Semantic Web
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
The Description Logic Handbook
The Description Logic Handbook
Combining answer set programming with description logics for the Semantic Web
Artificial Intelligence
Reasoning about Typicality in Preferential Description Logics
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
Analytic tableaux calculi for KLM logics of nonmonotonic reasoning
ACM Transactions on Computational Logic (TOCL)
Decidable reasoning in terminological knowledge representation systems
Journal of Artificial Intelligence Research
Default inheritance reasoning in hybrid KL-ONE-style logics
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Autoepistemic description logics
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Nonmonotonic databases and epistemic queries
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Preferential description logics
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Hi-index | 0.00 |
We extend the Description Logic ALC with a "typicality" operator T that allows us to reason about the prototypical properties and inheritance with exceptions. The resulting logic is called ALC + T. The typicality operator is intended to select the "most normal" or "most typical" instances of a concept. In our framework, knowledge bases may then contain, in addition to ordinary ABoxes and TBoxes, subsumption relations of the form "T(C) is subsumed by P", expressing that typical C-members have the property P. The semantics of a typicality operator is defined by a set of postulates that are strongly related to Kraus-Lehmann-Magidor axioms of preferential logic P. We first show that T enjoys a simple semantics provided by ordinary structures equipped with a preference relation. This allows us to obtain a modal interpretation of the typicality operator. We show that the satisfiability of anALC+Tknowledge base is decidable and it is precisely EXPTIME. We then present a tableau calculus for deciding satisfiability of ALC + T knowledge bases. Our calculus gives a (suboptimal) nondeterministic-exponential time decision procedure for ALC + T. We finally discuss how to extend ALC + T in order to infer defeasible properties of (explicit or implicit) individuals. We propose two alternatives: (i) a nonmonotonic completion of a knowledge base; (ii) a "minimal model" semantics for ALC + T whose intuition is that minimal models are those that maximise typical instances of concepts.