TY - GEN
T1 - A tableau calculus for a nonmonotonic extension of the description logic DL-Litecore
AU - Giordano, Laura
AU - Gliozzi, Valentina
AU - Olivetti, Nicola
AU - Pozzato, Gian Luca
PY - 2011
Y1 - 2011
N2 - In this paper we introduce a tableau calculus for a nonmonotonic extension of the low complexity Description Logic of the DL-Lite family. The extension, called DL-LitecTmin, can be used to reason about typicality and defeasible properties. The calculus performs a two-phase computation to check whether a query is minimally entailed from the initial knowledge base. It is sound, complete and terminating. Furthermore, it is a decision procedure for DL-LitecTmin knowledge bases, whose complexity matches the known results for the logic, namely that entailment is in π2p.
AB - In this paper we introduce a tableau calculus for a nonmonotonic extension of the low complexity Description Logic of the DL-Lite family. The extension, called DL-LitecTmin, can be used to reason about typicality and defeasible properties. The calculus performs a two-phase computation to check whether a query is minimally entailed from the initial knowledge base. It is sound, complete and terminating. Furthermore, it is a decision procedure for DL-LitecTmin knowledge bases, whose complexity matches the known results for the logic, namely that entailment is in π2p.
UR - http://www.scopus.com/inward/record.url?scp=80053013821&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-23954-0_17
DO - 10.1007/978-3-642-23954-0_17
M3 - Conference contribution
AN - SCOPUS:80053013821
SN - 9783642239533
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 164
EP - 176
BT - AI*IA 2011
T2 - 12th International Conference of the Italian Association for Artificial Intelligence, AI*IA 2011
Y2 - 15 September 2011 through 17 September 2011
ER -