Skip to Main content Skip to Navigation
Conference papers

Querying Inconsistent Description Logic Knowledge Bases under Preferred Repair Semantics

Abstract : Recently several inconsistency-tolerant semantics have been introduced for querying inconsistent description logic knowledge bases. Most of these semantics rely on the notion of a repair, defined as an inclusion-maximal subset of the facts (ABox) which is consistent with the ontology (TBox). In this paper, we study variants of two popular inconsistency-tolerant semantics obtained by replacing classical repairs by various types of preferred repair. We analyze the complexity of query answering under the resulting semantics, focusing on the lightweight logic DL-Lite_R. Unsurprisingly, query answering is intractable in all cases, but we nonetheless identify one notion of preferred repair, based upon priority levels, whose data complexity is 'only' coNP-complete. This leads us to propose an approach combining incomplete tractable methods with calls to a SAT solver. An experimental evaluation of the approach shows good scalability on realistic cases.
Complete list of metadatas

https://hal.inria.fr/hal-01007557
Contributor : François Goasdoué <>
Submitted on : Monday, June 16, 2014 - 6:27:17 PM
Last modification on : Thursday, January 7, 2021 - 4:19:11 PM

Identifiers

  • HAL Id : hal-01007557, version 1

Citation

Meghyn Bienvenu, Camille Bourgaux, François Goasdoué. Querying Inconsistent Description Logic Knowledge Bases under Preferred Repair Semantics. AAAI Conference on Artificial Intelligence (AAAI), Jul 2014, Quebec city, Canada. ⟨hal-01007557⟩

Share

Metrics

Record views

472