Consistent query answers in inconsistent databases
Marcelo Arenas, Leopoldo Bertossi, Jan Chomicki · 1999
In this paper we consider the problem of the logical characterization of the notion of consistent answer in a relational database that may violate given integrity constraints.This notion is captured in terms of the possible repaired versions of the database.A rnethod for computing consistent answers is given and its soundness and completeness (for some classes of constraints and queries) proved.The method is based on an iterative procedure whose termination for several classes of constraints is proved as well.Permission to make digital or hard copies of all or part of this work 1'01 personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the fill1 citation on the iirst page.To copy otherwise, to republish, to post on servers or to redistribute to lists.rcquircs prior specific