Consistent answers from a relational database that violates a given set of integrity constraints are characterized [Arenas et al. 1999] as ordinary answers that can be obtained from every repaired version of the database. In this paper we address the problem of specifying the repairs of a database as the minimal models of a theory written in Annotated Predicate Logic [Kifer et al. 1992a]. The specification is then transformed into a disjunctive logic program with annotation arguments and a stable model semantics. From the program, consistent answers to first order queries are obtained
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.