Inconsistency-Tolerant Query Answering: Rationality Properties and Computational Complexity Analysis
نویسندگان
چکیده
Generalising the state of the art, an inconsistency-tolerant semantics can be seen as a couple composed of a modifier operator and an inference strategy. In this paper we deepen the analysis of such general setting and focus on two aspects. First, we investigate the rationality properties of such semantics for existential rule knowledge bases. Second, we unfold the broad landscape of complexity results of inconsistent tolerant semantics under a specific (yet expressive) subclass of existential rules.
منابع مشابه
Inconsistency-Tolerant Semantics for Description Logics
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 answe...
متن کاملTractable Approaches to Consistent Query Answering in Ontology-Based-Data Access
In this talk, we address the problem of consistent query answering in ontology-based data access (OBDA). A robust system for ontology-based data access should provide meaningful answers to queries even when the data conflicts with the ontology. This can be accomplished by adopting an inconsistency-tolerant semantics, with the consistent query answering (CQA) semantics being the most prominent e...
متن کاملInconsistency-tolerant query answering in ontology-based data access
Ontology-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....
متن کاملComplexity of Inconsistency-Tolerant Query Answering in Datalog+/-
The study of inconsistency-tolerant semantics for query answering in ontological languages has recently gained much attention. In this work, we consider 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. We study the data complexity o...
متن کاملQuery Rewriting for Inconsistent DL-Lite Ontologies
In this paper we study the problem of obtaining meaningful answers to queries posed over inconsistent DL-Lite ontologies. We consider different variants of inconsistency-tolerant semantics and show that for some of such variants answering unions of conjunctive queries (UCQs) is first-order (FOL) rewritable, i.e., it can be reduced to standard evaluation of a FOL/SQL query over a database. Since...
متن کامل