Proceedings

Reasoning about Typicality in Low Complexity DLs: The Logics EL⊥Tmin and DL-Litec Tmin

Download BibTeX Cite

Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence. Pages 894-898.

https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-155

Abstract

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 Πp2. 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 Πp2

Laura Giordano, Valentina Gliozzi, Nicola Olivetti, and Gian Luca Pozzato. 2011. Reasoning about Typicality in Low Complexity DLs: The Logics EL⊥Tmin and DL-Litec Tmin. In Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, IJCAI-11. IJCAI, 894–898. https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-155
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards