Abstract Consistent Query Answers in Inconsistent Databases

In this paper we consider the problem of the logical char-acterization 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 an-swers 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 sev-eral classes of constraints is proved as well.