[Back]

T. Eiter, T. Lukasiewicz, L. Predoiu:
"Generalized Consistent Query Answering under Existential Rules";
Talk: 15th International Conference on Principles of Knowledge Representation and Reasoning (KR 2016), Kapstadt; 2016-04-25 - 2016-04-29; in: "Proceedings, Fifteenth International Conference on Principles of Knowledge Representation and Reasoning (KR 2016)", J. Delgrande, F. Wolter (ed.); (2016), ISBN: 978-1-57735-755-1; 359 - 368.

Previous work has proposed consistent query answering as
a way to resolve inconsistencies in ontologies. In these ap-
proaches to consistent query answering, however, only incon-
sistencies due to errors in the underlying database are consid-
ered. 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 inconsis-
tencies. This problem is especially well-suited in debugging
mappings between distributed ontologies. We define two dif-
ferent 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 consis-
tent query answering under existential rules.

Ontologies, inconsistencies, semantics, distributed ontologies

http://publik.tuwien.ac.at/files/publik_256543.pdf