Book ChapterDOI
Inconsistency-tolerant semantics for description logics
Domenico Lembo,Maurizio Lenzerini,Riccardo Rosati,Marco Ruzzi,Domenico Fabio Savo +4 more
- pp 103-117
Reads0
Chats0
TLDR
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.Abstract:
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 trying to obtain only consistent information during query answering, by relying on the notion of database repair. We show that, if we use the notion of repair studied in databases, inconsistency-tolerant query answering is intractable, even for the simplest form of queries. Therefore, we study different variants of the repair-based semantics, with the goal of reaching a good compromise between expressive power of the semantics and computational complexity of inconsistency-tolerant query answering.read more
Citations
More filters
Incosistency-Tolerant Forgetting in DL-lite.
Peng Xiao,Kewen Wang,Zhe Wang +2 more
TL;DR: In ontology engineering, it is essential to develop techniques for module extraction, ontology reuse and ontology comparison, and the problem of establishing a framework for inconsistent ontologies has not been investigated yet.
Proceedings Article
Using Kernel Consolidation for Query Answering in Inconsistent OBDA
TL;DR: This paper investigates the definition of belief revision operators that correspond to the inconsistency tolerant semantics in the Ontology Based Data Access (OBDA) setting to achieve a new semantic for inconsistent tolerant ontology query.
Posted Content
Querying and Repairing Inconsistent Prioritized Knowledge Bases: Complexity Analysis and Links with Abstract Argumentation.
Meghyn Bienvenu,Camille Bourgaux +1 more
TL;DR: In this paper, the authors study the data complexity of query entailment under inconsistency-tolerant semantics based upon optimal repairs, existence of a unique optimal repair, and enumeration of all optimal repairs.
Proceedings Article
On Dealing with Conflicting, Uncertain and Partially Ordered Ontologies.
Sihem Belabbes,Salem Benferhat +1 more
TL;DR: This work proposes to represent the uncertain ABox as a symbolic weighted base, where a strict partial order is applied on the weights, and provides a strategy for computing a single repair for the ABox, called the partial possibilistic repair.
Book ChapterDOI
Multi-Criteria Decision Making with Existential Rules using Repair Techniques
Nikos Karanikolas,Madalina Croitoru,Pierre Bisquert,Christos Kaklamanis,Rallou Thomopoulos,Bruno Yun +5 more
TL;DR: How to benefit from the reasoning capabilities of existential rules for modelling an MCDM problem as an inconsistent knowledge base and the repairs of this knowledge base represent the maximally consistent point of views and inference strategies can be used for decision making is explained.
References
More filters
BookDOI
The Description Logic Handbook: Theory, Implementation and Applications
TL;DR: The Description Logic Handbook as mentioned in this paper provides a thorough account of the subject, covering all aspects of research in this field, namely: theory, implementation, and applications, and can also be used for self-study or as a reference for knowledge representation and artificial intelligence courses.
Journal ArticleDOI
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family
TL;DR: 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.
Book ChapterDOI
Linking data to ontologies
Antonella Poggi,Domenico Lembo,Diego Calvanese,Giuseppe De Giacomo,Maurizio Lenzerini,Riccardo Rosati +5 more
TL;DR: 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.
Book
The Semantic Web - ISWC 2005: 4th International Semantic Web Conference, ISWC 2005, Galway, Ireland, November 6 - 10, 2005, Proceedings (Lecture Notes in Computer Science)
TL;DR: Semantic Acceleration Helping Realize the Semantic Web Vision or "The Practical Web", research/Academic track.
BookDOI
The Semantic Web – ISWC 2005
TL;DR: In this paper, the authors present an approach for using the Semantic Web for e-Science: Inspiration, Incubation, Irritation, and Semantic Acceleration Helping Realize the semantic Web Vision or "The Practical Web".