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

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.

DOI: 10.5591/978-1-57735-516-8/IJCAI11-155

Extracted Key Phrases

Cite this paper

@inproceedings{Giordano2011ReasoningAT, title={Reasoning about Typicality in Low Complexity DLs: The Logics EL⊥Tmin and DL-Litec Tmin}, author={Laura Giordano and Valentina Gliozzi and Nicola Olivetti and Gian Luca Pozzato}, booktitle={IJCAI}, year={2011} }