Updating logical databases
On the complexity of propositional knowledge base revision, updates, and counterfactuals
Artificial Intelligence
On the decidability and complexity of query answering over inconsistent and incomplete databases
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
WWW '05 Proceedings of the 14th international conference on World Wide Web
Inconsistency Tolerance (Lecture Notes in Computer Science)
Inconsistency Tolerance (Lecture Notes in Computer Science)
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family
Journal of Automated Reasoning
Conjunctive query answering for the description logic SHIQ
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Reasoning with inconsistent ontologies
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Model-based revision operators for terminologies in description logics
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Paraconsistent Reasoning for OWL 2
RR '09 Proceedings of the 3rd International Conference on Web Reasoning and Rule Systems
Consistent query answering over description logic ontologies
RR'07 Proceedings of the 1st international conference on Web reasoning and rule systems
Journal on data semantics X
A framework for handling inconsistency in changing ontologies
ISWC'05 Proceedings of the 4th international conference on The Semantic Web
Consistent query answering: five easy pieces
ICDT'07 Proceedings of the 11th international conference on Database Theory
Scalable OWL 2 reasoning for linked data
RW'11 Proceedings of the 7th international conference on Reasoning web: semantic technologies for the web of data
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
Inconsistency-Tolerant query rewriting for linear datalog+/-
Datalog 2.0'12 Proceedings of the Second international conference on Datalog in Academia and Industry
Consistent answers in probabilistic datalog+/--- ontologies
RR'12 Proceedings of the 6th international conference on Web Reasoning and Rule Systems
Evaluation of techniques for inconsistency handling in OWL 2 QL ontologies
ISWC'12 Proceedings of the 11th international conference on The Semantic Web - Volume Part II
On The Potential Integration of an Ontology-Based Data Access Approach in NoSQL Stores
International Journal of Distributed Systems and Technologies
Inconsistency management for description logic programs and beyond
RR'13 Proceedings of the 7th international conference on Web Reasoning and Rule Systems
Tractable approximations of consistent query answering for robust ontology-based data access
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Verification of inconsistency-aware knowledge and action bases
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Data repair of inconsistent DL-programs
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Query answering under probabilistic uncertainty in Datalog+ / - ontologies
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.00 |
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.