Using Kernel Consolidation for Query Answering in Inconsistent OBDA

This paper investigates the definition of belief revision operators that correspond to the inconsistency tolerant semantics in the Ontology Based Data Access (OBDA) setting. By doing this, we aim at providing a more general characterisation, as well as the construction, of the above mentioned semantics. In fact, the main result of this paper is the idea of using kernel consolidation in Datalog to achieve a new semantic for inconsistent tolerant ontology query