Defeasible inclusions in low-complexity DLs: preliminary notes

Authors:
P. A. Bonatti;M. Faella;L. Sauro
Affiliations:
Department of Physics, University of Naples "Federico II";Department of Physics, University of Naples "Federico II";Department of Physics, University of Naples "Federico II"
Venue:
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Year:
2009

Citing 10
Cited 12

Closed world reasoning in Hybrid systems

Methodologies for intelligent systems, 5
An epistemic operator for description logics

Artificial Intelligence
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
Logics for Emerging Applications of Databases

Logics for Emerging Applications of Databases
KAoS Policy Management for Semantic Web Services

IEEE Intelligent Systems
Using OWL to model biological knowledge

International Journal of Human-Computer Studies
DL-Lite: tractable description logics for ontologies

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Autoepistemic description logics

IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Pushing the EL envelope

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence

The complexity of circumscription in description logic

Journal of Artificial Intelligence Research
Reasoning about Typicality with Low Complexity Description Logics: The Logic $\mathcal{EL}^{+^\bot}{\bf T}$

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
A tableau calculus for a nonmonotonic extension of the description logic DL-litecore

AI*IA'11 Proceedings of the 12th international conference on Artificial intelligence around man and beyond
Datalog for security, privacy and trust

Datalog'10 Proceedings of the First international conference on Datalog Reloaded
Defeasible inclusions in low-complexity DLs

Journal of Artificial Intelligence Research
On the complexity of EL with defeasible inclusions

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
Preferential Semantics for Plausible Subsumption in Possibility Theory

Minds and Machines

Quantified Score

Hi-index	0.00

Visualization

Abstract

We analyze the complexity of reasoning with circumscribed low-complexity DLs such as DL-lite and the EL family, under suitable restrictions on the use of abnormality predicates. We prove that in circumscribed DL-liteR complexity drops from NExpNP to the second level of the polynomial hierarchy. In EL, reasoning remains ExpTime-hard, in general. However, by restricting the possible occurrences of existential restrictions, we obtain membership in Σ2p and Π2p for an extension of EL.