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
Prototypical Reasoning with Low Complexity Description Logics: Preliminary Results
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
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
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 non-monotonic Description Logic for reasoning about typicality
Artificial Intelligence
| Hi-index | 0.00 |
We propose a nonmonotonic extension of low complexity Description Logics EL⊥ and DL-Litecore for reasoning about typicality and defeasible properties. The resulting logics are called EL⊥Tmin and DL-LitecTmin. Concerning DL-LitecTmin, we prove that entailment is in Π2p. With regard to EL⊥Tmin, we first show that entailment remains EXPTIME-hard. Next we consider the known fragment of Left Local EL⊥Tmin and we prove that the complexity of entailment drops to Π2p.