The consistency extractor system: Answer set programs for consistent query answering in databases

We describe the Consistency Extractor System (Cons Ex) that computes consistent answers to Datalog queries with negation posed to relational databases that may be inconsistent with respect to certain integrity constraints. In order to solve this task, Cons Ex uses answers set programming. More precisely, Cons Ex uses disjunctive logic programs with stable models semantics to specify and reason with the repairs, i.e. with the consistent virtual instances that minimally depart from the original database. The consistent information is invariant under all repairs. Cons Ex achieves efficient query evaluation by implementing magic sets techniques. We describe the general methodology, its optimizations for query answering, and the architecture of the system. We also present encouraging experimental results.

[1]  Leopoldo E. Bertossi,et al.  Querying Inconsistent Databases: Algorithms and Implementation , 2000, Computational Logic.

[2]  Bernhard Thalheim,et al.  Semantics in Databases , 2001, Semantics in Databases.

[3]  Ronald Fagin,et al.  Data exchange: semantics and query answering , 2005, Theor. Comput. Sci..

[4]  Thomas Eiter,et al.  Efficient Evaluation of Logic Programs for Querying Data Integration Systems , 2003, ICLP.

[5]  Sergio Greco,et al.  Active Integrity Constraints for Database Consistency Maintenance , 2009, IEEE Transactions on Knowledge and Data Engineering.

[6]  Sergio Greco,et al.  Binding Propagation Techniques for the Optimization of Bound Disjunctive Queries , 2003, IEEE Trans. Knowl. Data Eng..

[7]  Jan Chomicki,et al.  Consistent query answers in the presence of universal constraints , 2008, Inf. Syst..

[8]  Jan Chomicki,et al.  Answer sets for consistent query answering in inconsistent databases , 2002, Theory and Practice of Logic Programming.

[9]  J. W. Lloyd,et al.  Foundations of logic programming; (2nd extended ed.) , 1987 .

[10]  Jan Chomicki,et al.  Consistent Query Answering: Five Easy Pieces , 2007, ICDT.

[11]  Michael Gelfond,et al.  Classical negation in logic programs and disjunctive databases , 1991, New Generation Computing.

[12]  Raymond Reiter,et al.  Towards a Logical Reconstruction of Relational Database Theory , 1982, On Conceptual Modelling.

[13]  Jan Chomicki,et al.  Minimal-change integrity maintenance using tuple deletions , 2002, Inf. Comput..

[14]  Wolfgang Faber,et al.  Magic Sets and their application to data integration , 2005, J. Comput. Syst. Sci..

[15]  Jan Chomicki,et al.  Consistent query answers in inconsistent databases , 1999, PODS '99.

[16]  Phokion G. Kolaitis,et al.  Repair checking in inconsistent databases: algorithms and complexity , 2009, ICDT '09.

[17]  Jan Chomicki,et al.  Prioritized repairing and consistent query answering in relational databases , 2012, Annals of Mathematics and Artificial Intelligence.

[18]  Michael Gelfond,et al.  Logic programming and knowledge representation—The A-Prolog perspective , 2002 .

[19]  Serge Abiteboul,et al.  Complexity of answering queries using materialized views , 1998, PODS.

[20]  Matthias Jarke,et al.  Logic Programming and Databases , 1984, Expert Database Workshop.

[21]  Leopoldo E. Bertossi,et al.  Consistent query answering under inclusion dependencies , 2004, CASCON.

[22]  Gerhard Brewka.  Preferences in Answer Set Programming , 2005, CAEPIA.

[23]  Helmut Veith,et al.  Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning , 2010, ICLP 2010.

[24]  Leopoldo E. Bertossi,et al.  Complexity and Approximation of Fixing Numerical Attributes in Databases Under Integrity Constraints , 2005, DBPL.

[25]  Loreto Bravo,et al.  Handling inconsistency in databases and data integration systems , 2007 .

[26]  Georg Gottlob,et al.  Disjunctive datalog , 1997, TODS.

[27]  Teodor C. Przymusinski.  On the Declarative Semantics of Deductive Databases and Logic Programs , 1988, Foundations of Deductive Databases and Logic Programming..

[28]  Leopoldo E. Bertossi,et al.  The Consistency Extractor System: Querying Inconsistent Databases Using Answer Set Programs , 2007, SUM.

[29]  Georg Gottlob,et al.  On the computational cost of disjunctive logic programming: Propositional case , 1995, Annals of Mathematics and Artificial Intelligence.

[30]  Riccardo Rosati,et al.  On the First-Order Reducibility of Unions of Conjunctive Queries over Inconsistent Databases , 2006, EDBT Workshops.

[31]  Wolfgang Faber,et al.  Computing preferred answer sets by meta-interpretation in answer set programming , 2003, Theory Pract. Log. Program..

[32]  Georg Gottlob,et al.  Complexity and expressive power of logic programming , 2001, CSUR.

[33]  Renée J. Miller,et al.  ConQuer: efficient management of inconsistent databases , 2005, SIGMOD '05.

[34]  Monica Caniupan,et al.  Optimizing and implementing repair programs for consistent query answering in databases , 2007 .

[35]  Teodor C. Przymusinski.  Stable semantics for disjunctive programs , 1991, New Generation Computing.

[36]  Adrian Walker,et al.  Towards a Theory of Declarative Knowledge , 1988, Foundations of Deductive Databases and Logic Programming..

[37]  Leopoldo E. Bertossi,et al.  Complexity of Consistent Query Answering in Databases Under Cardinality-Based and Incremental Repair Semantics , 2006, ICDT.

[38]  Alberto Bugarín,et al.  Current Topics in Artificial Intelligence, 11th Conference of the Spanish Association for Artificial Intelligence, CAEPIA 2005, Santiago de Compostela, Spain, November 16-18, 2005, Revised Selected Papers , 2006, CAEPIA.

[39]  Andrea Calì,et al.  A general datalog-based framework for tractable query answering over ontologies , 2009, SEBD.

[40]  Kenneth A. Ross,et al.  Modular stratification and magic sets for Datalog programs with negation , 1994, JACM.

[41]  Leopoldo E. Bertossi,et al.  Consistent query answering in databases , 2006, SGMD.

[42]  Leopoldo E. Bertossi,et al.  Semantically Correct Query Answers in the Presence of Null Values , 2006, EDBT Workshops.

[43]  Jef Wijsen,et al.  On the consistent rewriting of conjunctive queries under primary key constraints , 2007, Inf. Syst..

[44]  Gunter Saake,et al.  Logics for Emerging Applications of Databases , 2003, Springer Berlin Heidelberg.

[45]  Sergio Greco,et al.  A Logical Framework for Querying and Repairing Inconsistent Databases , 2003, IEEE Trans. Knowl. Data Eng..

[46]  Rajeev Rastogi,et al.  A cost-based model and effective heuristic for repairing constraints by value modification , 2005, SIGMOD '05.

[47]  David Maier,et al.  Magic sets and other strange ways to implement logic programs (extended abstract) , 1985, PODS '86.

[48]  Catriel Beeri,et al.  On the power of magic , 1987, J. Log. Program..

[49]  Enrico Pontelli,et al.  Proceedings of the 24th International Conference on Logic Programming , 2008 .

[50]  Leopoldo E. Bertossi,et al.  Consistent Query Answering in Data Warehouses , 2009, AMW.

[51]  Renée J. Miller,et al.  First-order query rewriting for inconsistent databases , 2005, J. Comput. Syst. Sci..

[52]  Michael L. Brodie,et al.  On Conceptual Modelling , 1984, Topics in Information Systems.

[53]  Wolfgang Faber,et al.  Enhancing the Magic-Set Method for Disjunctive Datalog Programs , 2004, ICLP.

[54]  Vladimir Lifschitz,et al.  Splitting a Logic Program , 1994, ICLP.

[55]  Laks V. S. Lakshmanan,et al.  On approximating optimum repairs for functional dependency violations , 2009, ICDT '09.

[56]  Wolfgang Faber,et al.  The DLV system for knowledge representation and reasoning , 2002, TOCL.

[57]  Jan Chomicki,et al.  Disjunctive databases for representing repairs , 2008, Annals of Mathematics and Artificial Intelligence.

[58]  Jef Wijsen,et al.  Database repairing using updates , 2005, TODS.

[59]  Andrea Calì,et al.  On the decidability and complexity of query answering over inconsistent and incomplete databases , 2003, PODS.

[60]  Francesco Scarcello,et al.  Census Data Repair: a Challenging Application of Disjunctive Logic Programming , 2001, LPAR.

[61]  Jef Wijsen,et al.  Condensed Representation of Database Repairs for Consistent Query Answering , 2003, ICDT.

[62]  Sergio Greco,et al.  Optimization of bound disjunctive queries with constraints , 2004, Theory and Practice of Logic Programming.

[63]  Hector J. Levesque,et al.  Knowledge Representation and Reasoning , 2004 .

[64]  Leopoldo E. Bertossi,et al.  The complexity and approximation of fixing numerical attributes in databases under integrity constraints , 2008, Inf. Syst..

[65]  Leopoldo E. Bertossi,et al.  Characterizing and Computing Semantically Correct Answers from Databases with Annotated Logic and Answer Sets , 2001, Semantics in Databases.

[66]  Leopoldo E. Bertossi,et al.  Logic Programs for Querying Inconsistent Databases , 2003, PADL.

[67]  J. Lloyd.  Foundations of Logic Programming , 1984, Symbolic Computation.

[68]  Gerhard Weikum,et al.  ACM Transactions on Database Systems , 2005 .

[69]  Leopoldo E. Bertossi,et al.  Optimizing repair programs for consistent query answering , 2005, XXV International Conference of the Chilean Computer Science Society (SCCC'05).