Get our free extension to see links to code for papers anywhere online!Free add-on: code for papers everywhere!Free add-on: See code for papers anywhere!
Add to Chrome
Add to Firefox
Add to EdgeSecond-Order Specifications and Quantifier Elimination for Consistent Query Answering in Databases
Paper and Code
Aug 20, 2021
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.
* In this version, a couple of minor mistakes corrected. This is a
slightly extended and updated version of a paper published in the Proc. of
the Alberto Mendelzon International Workshop of Foundations of Data
Management which will also serve as extended version for a forthcoming
extended abstract based on the former
View paper on