Nonmonotonic reasoning, preferential models and cumulative logics
Artificial Intelligence
Description logics of minimal knowledge and negation as failure
ACM Transactions on Computational Logic (TOCL)
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family
Journal of Automated Reasoning
Reasoning about Typicality in Preferential Description Logics
JELIA '08 Proceedings of the 11th 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
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Defeasible inclusions in low-complexity DLs: preliminary notes
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
ALC + T: a Preferential Extension of Description Logics
Fundamenta Informaticae - Advances in Computational Logic (CIL C08)
Rational closure for defeasible description logics
JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
EL with default attributes and overriding
ISWC'10 Proceedings of the 9th international semantic web conference on The semantic web - Volume Part I
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
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
A non-monotonic Description Logic for reasoning about typicality
Artificial Intelligence
| Hi-index | 0.00 |
In this paper we introduce a tableau calculus for a nonmonotonic extension of the low complexity Description Logic DL-Litecore of the DL-Litecore family. The extension, called DL-LitecTmin, can be used to reason about typicality and defeasible properties. The calculus performs a two-phase computation to check whether a query is minimally entailed from the initial knowledge base. It is sound, complete and terminating. Furthermore, it is a decision procedure for DL-LitecTmin knowledge bases, whose complexity matches the known results for the logic, namely that entailment is in Π2p.