TY - GEN
T1 - Consistent query answers in inconsistent databases
AU - Arenas, Marcelo
AU - Bertossi, Leopoldo
AU - Chomicki, Jan
PY - 1999
Y1 - 1999
N2 - 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 method 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.
AB - 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 method 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.
UR - https://www.scopus.com/pages/publications/0032640897
U2 - 10.1145/303976.303983
DO - 10.1145/303976.303983
M3 - Conference contribution
AN - SCOPUS:0032640897
SN - 1581130627
T3 - Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems
SP - 68
EP - 79
BT - Proceedings of the 18th ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, PODS 1999
PB - ACM
T2 - 18th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 1999
Y2 - 31 May 1999 through 3 June 1999
ER -