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
Journal Article
A Datalog Translation for Reasoning on DL-Lite_R with Defeasibility.
TL;DR: A definition for DL-LiteR knowledge bases with defeasible axioms is provided and a simpler encoding into datalog (under answer set semantics) with direct rules for reasoning on negative information is formulated.
Journal ArticleDOI
Querying of several DL-Lite knowledge bases from various information sources-based polynomial response unification approach
TL;DR: The main contribution of this work consists of studying several response strategies to queries from various data sources using a recurrent function to calculate the rank of coherence which will allow us to manage inconsistencies in the set of responses.
Partially Preordered Inconsistent Lightweight Ontologies in Possibility Theory.
Sihem Belabbes,Salem Benferhat +1 more
TL;DR: A tractable method for computing a single repair for a partially preordered weighted ABox is introduced using the notion of π-accepted assertions, which ensures that the possibilistic repair is computed in polynomial time.
Proceedings Article
Reasoning on \textitDL-Lite_ℛ with Defeasibility in ASP.
TL;DR: The justified exception approach to knowledge bases in \(\textit{DL-Lite}_\mathcal{R}\), i.e. the language underlying OWL QL, is applied and the limited form of axioms allows us to formulate a simpler encoding into ASP programs, where reasoning on negative information is managed by direct rules.
A novel approach to Controlled Query Evaluation in DL-Lite (DISCUSSION PAPER).
TL;DR: This paper considers CQE over Description Logic ontologies and study query answering over all optimal censors and establishes data complexity of the problem for ontologies specified in DL-LiteR and for variants of the censor language.
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".