AAAI Publications, Twenty-Second International Joint Conference on Artificial Intelligence

Font Size: 
Reasoning About Typicality in Low Complexity DLs: the Logics EL⊥Tmin and DL-LitecTmin
Laura Giordano, Valentina Gliozzi, Nicola Olivetti, GianLuca Pozzato

Last modified: 2011-06-28


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 \Pi^p_2. 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 \Pi^p_2.

Full Text: PDF