On the Decidability of Consistent Query Answering

Abstract. Consistent query answering (CQA) is about formally characterizing and computing semantically correct answers to queries posed to a database that may fail to satisfy certain integrity constraints. In this paper, we revisit the decidability status of consistent query answering by considering different parameters of the problem as input to the decision problem. More specifically, we obtain some new results about the undecidability and combined complexity of CQA.

• Type: Conference
• Year: 2010
• Where: AMW
• Authors: Marcelo Arenas, Leopoldo E. Bertossi
• Keywords: AMW 2010, Certain Integrity Constraints, Consistent Query Answering, Decidability Status, Knowledge Management