On the complexity of propositional knowledge base revision, updates, and counterfactuals
Artificial Intelligence
NP trees and Carnap's modal logic
Journal of the ACM (JACM)
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
Conjunctive query answering for the description logic SHIQ
Journal of Artificial Intelligence Research
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
Inconsistency-tolerant semantics for description logics
RR'10 Proceedings of the Fourth international conference on Web reasoning and rule systems
Consistent query answering: five easy pieces
ICDT'07 Proceedings of the 11th international conference on Database Theory
Inconsistency-Tolerant query rewriting for linear datalog+/-
Datalog 2.0'12 Proceedings of the Second international conference on Datalog in Academia and Industry
On The Potential Integration of an Ontology-Based Data Access Approach in NoSQL Stores
International Journal of Distributed Systems and Technologies
Aggregating semantic annotators
Proceedings of the VLDB Endowment
ROSeAnn: reconciling opinions of semantic annotators
Proceedings of the VLDB Endowment
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
Hi-index | 0.00 |
We study the problem of dealing with inconsistency in Description Logic (DL) ontologies. We consider inconsistency-tolerant semantics recently proposed in the literature, called AR-semantics and CAR-semantics, which are based on repairing (i.e., modifying) in a minimal way the extensional knowledge (ABox) while keeping the intensional knowledge (TBox) untouched. We study instance checking and conjunctive query entailment under the above inconsistency-tolerant semantics for a wide spectrum of DLs, ranging from tractable ones (EL) to very expressive ones (SHIQ), showing that reasoning under the above semantics is inherently intractable, even for very simple DLs. To the aim of overcoming such a high computational complexity of reasoning, we study sound approximations of the above semantics. Surprisingly, our computational analysis shows that reasoning under the approximated semantics is intractable even for tractable DLs. Finally, we identify suitable language restrictions of such DLs allowing for tractable reasoning under inconsistency-tolerant semantics.