The Complexity of Circumscription in DLs

01/15/2014
by   Piero A. Bonatti, et al.
0

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 NExpTime^NP. It becomes complete for NP^NExpTime when the number of minimized and fixed predicates is bounded by a constant. If roles can be minimized or fixed, then complexity ranges from NExpTime^NP to undecidability.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/27/2011

Complexity of Prioritized Default Logics

In default reasoning, usually not all possible ways of resolving conflic...
research
10/04/2011

On the Parameterized Complexity of Default Logic and Autoepistemic Logic

We investigate the application of Courcelle's Theorem and the logspace v...
research
10/07/2021

On the Complexity of Inductively Learning Guarded Rules

We investigate the computational complexity of mining guarded clauses fr...
research
06/01/2011

The Complexity of Reasoning with Cardinality Restrictions and Nominals in Expressive Description Logics

We study the complexity of the combination of the Description Logics ALC...
research
11/04/2002

The DLV System for Knowledge Representation and Reasoning

This paper presents the DLV system, which is widely considered the state...
research
09/21/2011

Outlier detection in default logics: the tractability/intractability frontier

In default theories, outliers denote sets of literals featuring unexpect...
research
02/24/2000

Genetic Algorithms for Extension Search in Default Logic

A default theory can be characterized by its sets of plausible conclusio...

Please sign up or login with your details

Forgot password? Click here to reset