∃-ASP for computing repairs with existential ontologies

Abstract

Repair-based techniques are a standard way of dealing with inconsistency in the context of ontology-based data access where several inconsistency-tolerant semantics have been mainly proposed for lightweight description logics. In this paper we present a generic transformation from knowledge bases expressed within existential rules formalism into an ASP program. We propose different strategies for this transformation, and highlight the ones for which answer sets of the generated program correspond to various kinds of repairs used in inconsistency-tolerant inferences.