Generalized Consistent Query Answering under Existential Rules
From International Center for Computational Logic
Generalized Consistent Query Answering under Existential Rules
Talk by Thomas Lukasiewicz
- Location: APB 3027
- Start: 30. November 2017 at 9:20 am
- End: 30. November 2017 at 10:50 am
- Research group: Automata Theory
- Event series: KBS Seminar
- iCal
In the talk, I give an overview of recent results on generalised consistent query answering under existential rules. 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 recent works, 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.
