# Inconsistency-Tolerant Semantics for Description Logics

@inproceedings{Lembo2010InconsistencyTolerantSF,
title={Inconsistency-Tolerant Semantics for Description Logics},
author={Domenico Lembo and Maurizio Lenzerini and Riccardo Rosati and Marco Ruzzi and Domenico Fabio Savo},
booktitle={RR},
year={2010}
}
We address the problem of dealing with inconsistencies in Description Logic (DL) knowledge bases. Our general goal is both to study DL semantical frameworks which are inconsistency-tolerant, and to devise techniques for answering unions of conjunctive queries posed to DL knowledge bases 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… Expand
217 Citations

#### Figures and Topics from this paper

Inconsistency-Tolerant Semantics for Description Logic Ontologies (Extended Abstract)
• Computer Science
• SEBD
• 2011
It is shown that, if the notion of repair studied in databases is used, inconsistency-tolerant query answering is intractable, even for the simplest form of queries. Expand
Querying Inconsistent Description Logic Knowledge Bases under Preferred Repair Semantics
• Computer Science
• Description Logics
• 2014
This paper studies variants of two popular inconsistency-tolerant semantics obtained by replacing classical repairs by various types of preferred repair, and proposes an approach combining incomplete tractable methods with calls to a SAT solver. Expand
Query Rewriting for Inconsistent DL-Lite Ontologies
• Computer Science
• RR
• 2011
It is shown that in such settings inconsistency-tolerant query answering has the same computational complexity of standard query answering and that it can rely on well-established relational database technology, as under standard DL semantics. Expand
On the Complexity of Dealing with Inconsistency in Description Logic Ontologies
Surprisingly, the computational analysis shows that reasoning under the approximated semantics is intractable even for tractable DLs, and identifies suitable language restrictions of such DLs allowing for tractables reasoning under inconsistency-tolerant semantics. Expand
Complexity of Inconsistency-Tolerant Query Answering in Datalog+/-
• Computer Science
• Description Logics
• 2013
This work considers three inconsistency-tolerant semantics recently proposed in the literature, namely: consistent query answering, the intersection (also called IAR) semantics, and the intersection of closed repairs (ICR) semantics. Expand
Inconsistency Handling in Datalog+/- Ontologies
• Computer Science
• ECAI
• 2012
This paper develops a general framework for inconsistency management in Datalog+/- ontologies based on incision functions from belief revision, in which several query answering semantics are characterized as special cases. Expand
Explaining Inconsistency-Tolerant Query Answering over Description Logic Knowledge Bases
• Computer Science
• AAAI
• 2016
This paper defines explanations for positive and negative answers under the brave, AR and IAR semantics, and analyzes the data complexity of recognizing (preferred) explanations and deciding if a given assertion is relevant or necessary. Expand
Inconsistency-Tolerant Querying of Description Logic Knowledge Bases
• Computer Science
• Reasoning Web
• 2016
This chapter presents and compares several alternative inconsistency-tolerant semantics, which can be applied to any DL (or ontology language) and summarizes what is known about the computational properties of these semantics. Expand
From Classical to Consistent Query Answering under Existential Rules
• Computer Science
• AMW
• 2015
This work performs an in-depth analysis of the complexity of consistent query answering under the main decidable classes of existential rules enriched with negative constraints, and focuses on one of the most prominent inconsistency-tolerant semantics, namely, the AR semantics. Expand
Inconsistency-tolerant query answering in ontology-based data access
• Computer Science
• J. Web Semant.
• 2015
This work proposes a different repair-based semantics, and shows 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. Expand

#### References

SHOWING 1-10 OF 20 REFERENCES
Consistent Query Answering over Description Logic Ontologies
• Computer Science
• Description Logics
• 2007
This paper provides inconsistency tolerant semantics for DLs, and studies the computational complexity of consistent query answering over ontologies specified in DL-Lite, a family of DLs specifically tailored to deal with large amounts of data. Expand
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family
• Computer Science
• Journal of Automated Reasoning
• 2007
It is shown that, for the DLs of the DL-Lite family, the usual DL reasoning tasks are polynomial in the size of the TBox, and query answering is LogSpace in thesize of the ABox, which is the first result ofPolynomial-time data complexity for query answering over DL knowledge bases. Expand
Conjunctive Query Answering for the Description Logic SHIQ
• Mathematics, Computer Science
• IJCAI
• 2007
This paper considers conjunctive queries over knowledge bases formulated in the popular DL SHIQ and allows transitive roles in both the query and the knowledge base and shows that query answering is decidable and establishes the following complexity bounds: regarding combined complexity, a deterministic algorithm for query answering that needs time single exponential and double exponential in the size of the query. Expand
On the decidability and complexity of query answering over inconsistent and incomplete databases
• Mathematics, Computer Science
• PODS '03
• 2003
This paper identifies the maximal class of inclusion dependencies under which query answering is decidable in the presence of key dependencies and establishes decidability and complexity results for query answering under different assumptions on data. Expand
Model-based Revision Operators for Terminologies in Description Logics
• Mathematics, Computer Science
• IJCAI
• 2009
This paper proposes three model-based revision operators to revise terminologies in Description Logics and shows that one of them is more rational than others by comparing their logical properties. Expand
Paraconsistent Reasoning for OWL 2
• Computer Science
• RR
• 2009
How to extend the four-valued semantics to the more expressive description logic $\mathcal{SROIQ}$ which underlies the forthcoming revision of the Web Ontology Language, OWL 2, is studied and how it fares when adapted to tractable description logics is investigated. Expand
A Framework for Handling Inconsistency in Changing Ontologies
• Computer Science
• International Semantic Web Conference
• 2005
This paper surveys four different approaches to handling inconsistency in DL-based ontologies: consistent ontology evolution, repairing inconsistencies, reasoning in the presence of inconsistencies and multi-version reasoning. Expand
• Computer Science
• J. Data Semant.
• 2008
This paper presents a new ontology language, based on Description Logics, that is particularly suited to reason with large amounts of instances and a novel mapping language that is able to deal with the so-called impedance mismatch problem. Expand
The Description Logic Handbook: Theory, Implementation, and Applications
• Computer Science
• Description Logic Handbook
• 2003
This new edition of The Description Logic Handbook provides a thorough account of the subject, covering all aspects of research in this field, namely: theory, implementation, and applications. Expand
Exact XML Type Checking in Polynomial Time
• Computer Science, Mathematics
• ICDT
• 2007
This work presents a new adaptive type checking algorithm based on forward type inference through exact characterizations of output languages that correctly type-checks all call-by-value smtts. Expand