Consistent Query Answering for Existential Rules with Closed Predicates

Consistent query answering (CQA) is an approach to inconsistency-tolerant reasoning in databases and knowledge bases. This paper studies CQA under the closed-world assumption, where the database predicates are assumed to have complete knowledge, and the only way to repair an inconsistency is through tuple deletions.