Generalized consistent query answering under existential rules

Conference item

Previous work has proposed consistent query answering as a way to resolve inconsistencies in ontologies. In these approaches to consistent query answering, however, only inconsistencies due to errors in the underlying database are considered. In this paper, we additionally assume that ontological axioms may be erroneous, and that some database atoms and ontological axioms may not be removed to resolve inconsistencies. This problem is especially well suited in debugging mappings between distributed ontologies. We define two different semantics, one where ontological axioms as a whole are ignored to resolve an inconsistency, and one where only some of their instances are ignored. We then give a precise picture of the complexity of consistent query answering under these two semantics when ontological axioms are encoded as different classes of existential rules. In the course of this, we also close two open complexity problems in standard consistent query answering under existential rules.

Authors: Eiter, T; Lukasiewicz, T; Predoiu, L

• Publication status: Published
• Peer review status: Peer reviewed
• Publisher: AAAI Press
• Host title: KR'16: Proceedings of the Fifteenth International Conference on Principles of Knowledge Representation and Reasoning
• Pages: 359-368
• Publication date: 2016-03-30
• Acceptance date: 2016-01-21
• Event title: 15th International Conference on Principles of Knowledge Representation and Reasoning
• Event location: Cape Town‚ South Africa
• Event website: http://kr2016.cs.uct.ac.za
• Event start date: 2016-04-25
• Event end date: 2016-04-29
• Language: English