Nonmonotonic reasoning, preferential models and cumulative logics
Artificial Intelligence
Description logics of minimal knowledge and negation as failure
ACM Transactions on Computational Logic (TOCL)
Reasoning about Typicality in Preferential Description Logics
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
Default inheritance reasoning in hybrid KL-ONE-style logics
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Preferential description logics
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
AI*IA '09: Proceedings of the XIth International Conference of the Italian Association for Artificial Intelligence Reggio Emilia on Emergent Perspectives in Artificial Intelligence
Rational closure for defeasible description logics
JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
EL with default attributes and overriding
ISWC'10 Proceedings of the 9th international semantic web conference on The semantic web - Volume Part I
A tableau calculus for a nonmonotonic extension of EL⊥
TABLEAUX'11 Proceedings of the 20th international conference on Automated reasoning with analytic tableaux and related methods
On the complexity of EL with defeasible inclusions
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Defeasible inheritance-based description logics
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Reasoning about typicality in low complexity DLs: the logics EL⊥Tmin and DL-LitecTmin
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
A non-monotonic Description Logic for reasoning about typicality
Artificial Intelligence
| Hi-index | 0.00 |
We present an extension $\mathcal{EL}^{+^\bot}{\bf {\rm T}}$ of the description logic $\mathcal{EL}^{+^\bot}$ for reasoning about prototypical properties and inheritance with exceptions. $\mathcal{EL}^{+^\bot}{\bf {\rm T}}$ is obtained by adding to $\mathcal{EL}^{+^\bot}$ a typicality operator T, which is intended to select the "typical" instances of a concept. In $\mathcal{EL}^{+^\bot}{\bf {\rm T}}$ knowledge bases may contain inclusions 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 $\mathcal{EL}^{+^\bot}{\bf {\rm T}}$ is in co-NP .