TY - GEN
T1 - Reasoning about typicality in low complexity DLs
T2 - 22nd International Joint Conference on Artificial Intelligence, IJCAI 2011
AU - Giordano, Laura
AU - Gliozzi, Valentina
AU - Olivetti, Nicola
AU - Pozzato, Gian Luca
PY - 2011
Y1 - 2011
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84881047730&partnerID=8YFLogxK
U2 - 10.5591/978-1-57735-516-8/IJCAI11-155
DO - 10.5591/978-1-57735-516-8/IJCAI11-155
M3 - Conference contribution
AN - SCOPUS:84881047730
SN - 9781577355120
T3 - IJCAI International Joint Conference on Artificial Intelligence
SP - 894
EP - 899
BT - IJCAI 2011 - 22nd International Joint Conference on Artificial Intelligence
Y2 - 16 July 2011 through 22 July 2011
ER -