Consistent answers to a query from a possibly inconsistent database are answers that are simultaneously retrieved from every possible repair of the database. Repairs are consistent instances that minimally differ from the original inconsistent instance. It has been shown before that database repairs can be specified as the stable models of a disjunctive logic program. In this paper we show how to use the repair programs to transform the problem of consistent query answering into a problem of reasoning w.r.t. a theory written in second-order predicate logic. It also investigated how a first-order theory can be obtained instead by applying second-order quantifier elimination techniques.

翻译：对来自一个可能不一致的数据库的查询的一致答复,是从数据库的每一次可能的修理中同时检索到的答案。修理是同原先的不一致情况相比,差别最小的一致事例。以前已经显示过,数据库的修理可以指定为分离逻辑程序的稳定模型。在本文中,我们展示了如何利用修复程序将一致查询回答问题转化为推理问题(w.r.t.),这是以二阶前置逻辑书写的理论。它还调查了如何通过应用二阶限定词消除技术获得第一阶理论。