Nonmonotonic reasoning, preferential models and cumulative logics
Artificial Intelligence
Description logics of minimal knowledge and negation as failure
ACM Transactions on Computational Logic (TOCL)
General Preferential Entailments as Circumscriptions
ECSQARU '01 Proceedings of the 6th European Conference on Symbolic and Quantitative Approaches to Reasoning with 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
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
Preferential description logics
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Prototypical Reasoning with Low Complexity Description Logics: Preliminary Results
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Modelling Object Typicality in Description Logics
AI '09 Proceedings of the 22nd Australasian Joint Conference on Advances in Artificial Intelligence
AI*IA '09: Proceedings of the XIth International Conference of the Italian Association for Artificial Intelligence Reggio Emilia on Emergent Perspectives in Artificial Intelligence
Preferential vs Rational Description Logics: which one for Reasoning About Typicality?
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Rational closure for defeasible description logics
JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
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 tableau calculus for a nonmonotonic extension of EL⊥
TABLEAUX'11 Proceedings of the 20th international conference on Automated reasoning with analytic tableaux and related methods
A tableau calculus for a nonmonotonic extension of the description logic DL-litecore
AI*IA'11 Proceedings of the 12th international conference on Artificial intelligence around man and beyond
A Tableau Calculus for Minimal Modal Model Generation
Electronic Notes in Theoretical Computer Science (ENTCS)
Representing and reasoning on typicality in formal ontologies
Proceedings of the 7th International Conference on Semantic Systems
Datalog for security, privacy and trust
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
Defeasible inclusions in low-complexity DLs
Journal of Artificial Intelligence Research
Reasoning about typicality in low complexity DLs: the logics EL⊥Tmin and DL-LitecTmin
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
ALC + T: a Preferential Extension of Description Logics
Fundamenta Informaticae - Advances in Computational Logic (CIL C08)
Preferential Semantics for Plausible Subsumption in Possibility Theory
Minds and Machines
| Hi-index | 0.00 |
In this paper we propose a nonmonotonic extension of the Description Logic $\mathcal{ALC}$ for reasoning about prototypical properties and inheritance with exception. The logic is built upon a previously introduced (monotonic) logic , that is obtained by adding a typicality operator Tto $\mathcal{ALC}$. The operator Tis intended to select the "most normal" or "most typical" instances of a concept, so that knowledge bases may contain subsumption relations of the form"T(C) is subsumed by P", expressing that typical C-members have the property P. In order to perform nonmonotonic inferences, we define a "minimal model" semantics for . The intuition is that preferred, or minimal models are those that maximise typical instances of concepts. By means of we are able to infer defeasible properties of (explicit or implicit) individuals. We also present a tableau calculus for deciding entailment.