TY - GEN
T1 - Reasoning about typicality with low complexity description logics
T2 - 11th International Conference of the Italian Association for Artificial Intelligence: Emergent Perspectives in Artificial Intelligence, AI IA 2009
AU - Giordano, Laura
AU - Gliozzi, Valentina
AU - Olivetti, Nicola
AU - Pozzato, Gian Luca
PY - 2009
Y1 - 2009
N2 - We present an extension of the low complexity Description Logic EL +⊥ for reasoning about prototypical properties and inheritance with exceptions. We add to EL+⊥ a typicality operator T, which is intended to select the "most normal" instances of a concept. In the resulting logic, called EL+⊥T, the knowledge base may contain subsumption relations of the form "T(C) is subsumed by P", expressing that typical. C-members have the property P. We show that the problem of entailment in EL+⊥T is in co-NP by proving a small model result.
AB - We present an extension of the low complexity Description Logic EL +⊥ for reasoning about prototypical properties and inheritance with exceptions. We add to EL+⊥ a typicality operator T, which is intended to select the "most normal" instances of a concept. In the resulting logic, called EL+⊥T, the knowledge base may contain subsumption relations of the form "T(C) is subsumed by P", expressing that typical. C-members have the property P. We show that the problem of entailment in EL+⊥T is in co-NP by proving a small model result.
UR - http://www.scopus.com/inward/record.url?scp=78650708749&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-10291-2_7
DO - 10.1007/978-3-642-10291-2_7
M3 - Conference contribution
AN - SCOPUS:78650708749
SN - 3642102905
SN - 9783642102905
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 62
EP - 71
BT - AI*IA 2009
Y2 - 9 December 2009 through 12 December 2009
ER -