On the complexity of EL with defeasible inclusions

Authors:
Piero A. Bonatti;Marco Faella;Luigi Sauro
Affiliations:
Dep. of Physics, University of Naples "Federico II";Dep. of Physics, University of Naples "Federico II";Dep. of Physics, University of Naples "Federico II"
Venue:
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Year:
2011

Citing 16
Cited 2

Closed world reasoning in Hybrid systems

Methodologies for intelligent systems, 5
Description logics of minimal knowledge and negation as failure

ACM Transactions on Computational Logic (TOCL)
A Policy Language for a Pervasive Computing Environment

POLICY '03 Proceedings of the 4th IEEE International Workshop on Policies for Distributed Systems and Networks
The description logic handbook: theory, implementation, and applications

The description logic handbook: theory, implementation, and applications
KAoS Policy Management for Semantic Web Services

IEEE Intelligent Systems
Using OWL to model biological knowledge

International Journal of Human-Computer Studies
Prototypical Reasoning with Low Complexity Description Logics: Preliminary Results

LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
DL-Lite: tractable description logics for ontologies

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Default inheritance reasoning in hybrid KL-ONE-style logics

IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Autoepistemic description logics

IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
The logic of inheritance in frame systems

IJCAI'87 Proceedings of the 10th international joint conference on Artificial intelligence - Volume 1
The complexity of circumscription in description logic

Journal of Artificial Intelligence Research
Pushing the EL envelope

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Defeasible inclusions in low-complexity DLs: preliminary notes

IJCAI'09 Proceedings of the 21st international jont conference on Artifical 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 non-monotonic Description Logic for reasoning about typicality

Artificial Intelligence
Defeasible inheritance-based description logics

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We analyze the complexity of reasoning in EL with defeasible inclusions and extensions thereof. The results by Bonatti et al., 2009a are extended by proving tight lower complexity bounds and by relaxing the syntactic restrictions adopted there. We further extend the old framework by supporting arbitrary priority relations.