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. © Springer-Verlag 2009.
CITATION STYLE
Giordano, L., Gliozzi, V., Olivetti, N., & Pozzato, G. L. (2009). Reasoning about typicality with low complexity description logics: The logic EL+⊥T. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5883 LNAI, pp. 62–71). https://doi.org/10.1007/978-3-642-10291-2_7
Mendeley helps you to discover research relevant for your work.