The complexity of circumscription in description logic

Authors:
Piero A. Bonatti;Carsten Lutz;Frank Wolter
Affiliations:
Section of Computer Science, Department of Physics, University of Naples Federico II, Italy;Department of Mathematics and Computer Science, University of Bremen, Germany;Department of Computer Science, University of Liverpool, UK
Venue:
Journal of Artificial Intelligence Research
Year:
2009

Citing 32
Cited 14

Semantical considerations on nonmonotonic logic

Artificial Intelligence
Applications of circumscription to formalizing common-sense knowledge

Artificial Intelligence
Eliminating the fixed predicates from a circumscription

Artificial Intelligence
Closed world reasoning in Hybrid systems

Methodologies for intelligent systems, 5
Some direct theories of nonmonotonic inheritance

Handbook of logic in artificial intelligence and logic programming (vol. 3)
Circumscription

Handbook of logic in artificial intelligence and logic programming (vol. 3)
Nested abnormality theories

Artificial Intelligence
On the relative expressiveness of description logics and predicate logics

Artificial Intelligence
Querying disjunctive databases through nonmonotonic logics

Theoretical Computer Science
Disjunctive datalog

ACM Transactions on Database Systems (TODS)
An epistemic operator for description logics

Artificial Intelligence
Complexity Results for First-Order Two-Variable Logic with Counting

SIAM Journal on Computing
Modal logic

Modal logic
Description logics of minimal knowledge and negation as failure

ACM Transactions on Computational Logic (TOCL)
On the intertranslatability of non-monotonic logics

Annals of Mathematics and Artificial Intelligence
Adding Priorities and Specificity to Default Logic

JELIA '94 Proceedings of the European Workshop on Logics in Artificial Intelligence
Tableau Algorithms for Description Logics

TABLEAUX '00 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Two-variable logic with counting is decidable

LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
A Default Extension to Description Logics for Use in an Intelligent Search Engine

HICSS '98 Proceedings of the Thirty-First Annual Hawaii International Conference on System Sciences-Volume 5 - Volume 5
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
Mathematical modal logic: a view of its evolution

Journal of Applied Logic
KAoS Policy Management for Semantic Web Services

IEEE Intelligent Systems
Complexity of the Two-Variable Fragment with Counting Quantifiers

Journal of Logic, Language and Information
Using OWL to model biological knowledge

International Journal of Human-Computer Studies
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family

Journal of Automated Reasoning
Semantic Modularity and Module Extraction in Description Logics

Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
The complexity of reasoning with cardinality restrictions and nominals in expressive description logics

Journal of Artificial Intelligence Research
Autoepistemic description logics

IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
A faithful integration of description logics with logic programming

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
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

Reconciling description logics and rules

Journal of the ACM (JACM)
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
Local closed world semantics: grounded circumscription for description logics

RR'11 Proceedings of the 5th international conference on Web reasoning and rule systems
A Tableau Calculus for Minimal Modal Model Generation

Electronic Notes in Theoretical Computer Science (ENTCS)
Local closed world semantics: grounded circumscription for OWL

ISWC'11 Proceedings of the 10th international conference on The semantic web - Volume Part I
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
Defeasible inheritance-based description logics

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
RDL: enhancing description logic with rules

AI'12 Proceedings of the 25th Australasian joint conference on Advances in Artificial Intelligence
Model-theoretic inseparability and modularity of description logic ontologies

Artificial Intelligence
Defeasible inheritance-based description logics

Journal of Artificial Intelligence Research
Reasoning about explanations for negative query answers in DL-lite

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

As fragments of first-order logic, Description logics (DLs) do not provide nonmonotonic features such as defeasible inheritance and default rules. Since many applications would benefit from the availability of such features, several families of nonmonotonic DLs have been developed that are mostly based on default logic and autoepistemic logic. In this paper, we consider circumscription as an interesting alternative approach to nonmonotonic DLs that, in particular, supports defeasible inheritance in a natural way. We study DLs extended with circumscription under different language restrictions and under different constraints on the sets of minimized, fixed, and varying predicates, and pinpoint the exact computational complexity of reasoning for DLs ranging from ALC to ALCIO and ALCQO. When the minimized and fixed predicates include only concept names but no role names, then reasoning is complete for NEXPNP. It becomes complete for NPNEXP when the number of minimized and fixed predicates is bounded by a constant. If roles can be minimized or fixed, then complexity ranges from NEXPNP to undecidability.