Understanding the complexity of axiom pinpointing in lightweight description logics

Peñaloza, Rafael; Sertkaya, Barış

doi:10.1016/j.artint.2017.06.002

Cited by 42 publications

(41 citation statements)

References 59 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In fact, minimal inconsistent subsets of the ABox can be seen as explanations, or minimal justifications (at the extensional level) of the inconsistency of the knowledge base. Given this connection, some computational properties of pinpointing (e.g., [40][41][42]) are related to the complexity of reasoning under inconsistency-tolerant semantics, although the two problems are different and are studied under different assumptions. Some works have explicitly focused on the problem of finding justifications for inconsistency.…”

Section: Inconsistency Handling In Ontologiesmentioning

confidence: 99%

“…It is worth noticing that minimal inconsistent sets correspond to justifications (also known as minAs) [39][40][41][42]: in particular, a minimal T -inconsistent sets contained in A corresponds to an explanation (or minimal justification) of the inconsistency of ⟨T , A⟩ at the extensional level. We will further analyze this aspect in Section 9.…”

Section: Definitionmentioning

confidence: 99%

See 1 more Smart Citation

Inconsistency-tolerant query answering in ontology-based data access

Lembo

Lenzerini

Rosati

et al. 2015

Journal of Web Semantics

View full text Add to dashboard Cite

a b s t r a c tOntology-based data access (OBDA) is receiving great attention as a new paradigm for managing information systems through semantic technologies. According to this paradigm, a Description Logic ontology provides an abstract and formal representation of the domain of interest to the information system, and is used as a sophisticated schema for accessing the data and formulating queries over them. In this paper, we address the problem of dealing with inconsistencies in OBDA. Our general goal is both to study DL semantical frameworks that are inconsistency-tolerant, and to devise techniques for answering unions of conjunctive queries under such inconsistency-tolerant semantics. Our work is inspired by the approaches to consistent query answering in databases, which are based on the idea of living with inconsistencies in the database, but trying to obtain only consistent information during query answering, by relying on the notion of database repair. We first adapt the notion of database repair to our context, and show that, according to such a notion, inconsistency-tolerant query answering is intractable, even for very simple DLs. Therefore, we propose a different repair-based semantics, with the goal of reaching a good compromise between the expressive power of the semantics and the computational complexity of inconsistency-tolerant query answering. Indeed, we show that query answering under the new semantics is first-order rewritable in OBDA, even if the ontology is expressed in one of the most expressive members of the DL-Lite family.

show abstract

Section: Inconsistency Handling In Ontologiesmentioning

confidence: 99%

Section: Definitionmentioning

confidence: 99%

Inconsistency-tolerant query answering in ontology-based data access

Lembo

Lenzerini

Rosati

et al. 2015

Journal of Web Semantics

View full text Add to dashboard Cite

show abstract

“…This, of course, requires additional tests, and the complexity may change accordingly. For a study on how the complexity is affected by the preference relation and the ontology language see [43].…”

Section: One Justificationmentioning

confidence: 99%

Explaining Axiom Pinpointing

Peñaloza

2019

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Axiom pinpointing refers to the task of finding the specific axioms in an ontology which are responsible for a consequence to follow. This task has been studied, under different names, in many research areas, leading to a reformulation and reinvention of techniques. In this work, we present a general overview to axiom pinpointing, providing the basic notions, different approaches for solving it, and some variations and applications which have been considered in the literature. This should serve as a starting point for researchers interested in related problems, with an ample bibliography for delving deeper into the details.

show abstract

“…As developing an ontology is difficult and time-consuming, it is important to provide tools to aid ontology engineers in this task. In DL-Lite, the problem is simpler: all justifications of a TBox axiom can be enumerated in polynomial delay [173]. For ELH TBoxes, justifications correspond to minimal models of propositional Horn formulas and can computed using SAT solvers [196].…”

Section: Reasoning Support For Building and Maintaining Omqa Systemsmentioning

confidence: 99%

“…As mentioned earlier, the problem of explanation has already been extensively studied in the DL community for the purposes of ontology debugging [38,107,108,114,155,173,195,196]. As mentioned earlier, the problem of explanation has already been extensively studied in the DL community for the purposes of ontology debugging [38,107,108,114,155,173,195,196].…”

Section: Improving the Usability Of Omqa Systemsmentioning

confidence: 99%