More complicated questions about maxima and minima, and some closures of NP
Theoretical Computer Science
NP trees and Carnap's modal logic
Journal of the ACM (JACM)
Knowledge compilation and theory approximation
Journal of the ACM (JACM)
Consistent query answers in inconsistent databases
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family
Journal of Automated Reasoning
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
The DL-lite family and relations
Journal of Artificial Intelligence Research
Journal on data semantics X
Inconsistency-tolerant semantics for description logics
RR'10 Proceedings of the Fourth international conference on Web reasoning and rule systems
Query rewriting for inconsistent DL-lite ontologies
RR'11 Proceedings of the 5th international conference on Web reasoning and rule systems
On the complexity of dealing with inconsistency in description logic ontologies
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Database Repairing and Consistent Query Answering
Database Repairing and Consistent Query Answering
Towards more expressive ontology languages: The query answering problem
Artificial Intelligence
Inconsistency-Tolerant query rewriting for linear datalog+/-
Datalog 2.0'12 Proceedings of the Second international conference on Datalog in Academia and Industry
Hi-index | 0.00 |
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 example. Unfortunately, query answering under the CQA semantics has been shown to be computationally intractable, even when extremely simple ontology languages are considered. In this paper, we address this problem by proposing two new families of inconsistency-tolerant semantics which approximate the CQA semantics from above and from below and converge to it in the limit. We study the data complexity of conjunctive query answering under these new semantics, and show a general tractability result for all known first-order rewritable ontology languages. We also analyze the combined complexity of query answering for ontology languages of the DL-Lite family.