Abstract
Consistent answers from a relational database that violates a given set of integrity constraints (ICs) are characterized as ordinary answers that can be obtained from every minimally repaired version of the database (a repair). Repairs can be specified and interpreted as the stable models of a simple disjunctive normal logic program with database predicates extended with appropriate annotation arguments. In consequence, consistent query answers can be obtained by running a query program in combination with the repair program under the cautious or skeptical stable model semantics. In this paper we show how to write repair programs for universal and referential ICs; we establish their correctness and show how to run them on top of the DLV system.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Abiteboul, S.; Hull, R. and Vianu, V. “Foundations of Databases”. Addison-Wesley, 1995.
Arenas, M.; Bertossi, L. and Chomicki, J. “Consistent Query Answers in Inconsistent Databases”. In Proc. ACM Symposium on Principles of Database Systems (ACM PODS’99), 1999, pp. 68–79.
Arenas, M.; Bertossi, L. and Kifer, M. “Applications of Annotated Predicate Calculus to Querying Inconsistent Databases”. In ‘Computational Logic-CL2000’ Stream: 6th International Conference on Rules and Objects in Databases (DOOD’2000). Springer Lecture Notes in Artificial Intelligence 1861, 2000, pp. 926–941.
Arenas, M.; Bertossi, L. and Chomicki, J. “Specifying and Querying Database Repairs using Logic Programs with Exceptions”. In Flexible Query AnsweringSystems. Recent Developments, H.L. Larsen, J. Kacprzyk, S. Zadrozny, H. Christiansen (eds.), Springer, 2000, pp. 27–41.
Arenas, M.; Bertossi, L. and Chomicki, J. Scalar Aggregation in FD-Inconsistent Databases. In Database Theory-ICDT 2001, Springer, LNCS 1973, 2001, pp. 39–53.
Arenas, M.; Bertossi, L. and Chomicki, J. Answer Sets for Consistent Query Answers. Submitted in 2001. (CoRR paper cs.DB/0207094)
Baral, Ch. Knowledge Representation, Reasoning and Declarative Problem Solving with Answer Sets. Cambridge University Press. To appear.
Barcelo, P. and Bertossi, L. Repairing Databases with Annotated Predicate Logic. In Proc. Nineth International Workshop on Non-Monotonic Reasoning (NMR’2002), Special session: Changing and Integrating Information: From Theory to Practice, S. Benferhat and E. Giunchiglia (eds.), 2002, pp. 160–170.
Ben-Eliyahu, R. and Dechter, R. “Propositional Semantics for Disjunctive Logic Programs”. Annals of Mathematics in Artificial Intelligence, 1994, 12:53–87.
Bertossi, L., Chomicki, J., Cortes, A. and Gutierrez, C. “Consistent Answers from Integrated Data Sources”. In ‘Flexible Query Answering Systems’, Proc. of the 5th International Conference, FQAS 2002. T. Andreasen, A. Motro, H. Christiansen, H. L. Larsen (eds.). Springer LNAI 2522, 2002, pp. 71–85.
Blair, H.A. and Subrahmanian, V.S. “Paraconsistent Logic Programming”. Theoretical Computer Science, 1989, 68:135–154.
Buccafurri, F.; Leone, N. and Rullo, P. “Enhancing Disjunctive Datalog by Constraints”. IEEE Transactions on Knowledge and Data Engineering, 2000, 12(5):845–860.
Celle, A. and Bertossi, L. “Querying Inconsistent Databases: Algorithms and Implementation”. In ‘Computational Logic-CL 2000’, J. Lloyd et al. (eds.). Stream: 6th International Conference on Rules and Objects in Databases (DOOD’2000). Springer Lecture Notes in Artificial Intelligence 1861, 2000, pp. 942–956.
Chomicki, J. and Marcinkowski, J. “On the Computational Complexity of Consistent Query Answers”. Submitted in 2002 (CoRR paper cs.DB/0204010).
Chou, T. and Winslett, M. A Model-Based Belief Revision System. Journal of Automated Reasoning, 1994, 12:157–208.
Damasio, C. V. and Pereira, L.M. “A Survey on Paraconsistent Semantics for Extended Logic Programas”. In Handbook of Defeasible Reasoningand Uncertainty Management Systems, Vol. 2, D.M. Gabbay and Ph. Smets (eds.), Kluwer Academic Publishers, 1998, pp. 241–320.
Eiter, T. and Gottlob, G. Propositional Circumscription and Extended Closed World Assumption are IIp 2-complete. Theoretical Computer Science, 1993, 114, pp. 231–245.
Eiter, T., Leone, N., Mateis, C., Pfeifer, G. and Scarcello, F. “A Deductive System for Non-Monotonic Reasoning”. Proc. LPNMR’97, Springer LNAI 1265, 1997, pp. 364–375.
Eiter, T.; Faber, W.; Leone, N. and Pfeifer, G. “Declarative Problem-Solvingin DLV”. In Logic-Based Artificial Intelligence, J. Minker (ed.), Kluwer, 2000, pp. 79–103.
Gelfond, M. and Lifschitz, V. “The Stable Model Semantics for Logic Programming”. In Logic Programming, Proceedings of the Fifth International Conference and Symposium, R. A. Kowalski and K. A. Bowen (eds.), MIT Press, 1988, pp. 1070–1080.
Gelfond, M. and Lifschitz, V. “Classical Negation in Logic Programs and Disjunctive Databases”. New Generation Computing, 1991, 9:365–385.
Giannotti, F.; Greco, S.; Sacca, D. and Zaniolo, C. Programming with Nondeterminism in Deductive Databases. Annals of Mathematics and Artificial Intelligence, 1997, 19(3–4).
Greco, G.; Greco, S. and Zumpano, E. “A Logic Programming Approach to the Integration, Repairingand Queryingof Inconsistent Databases”. In Proc. 17th International Conference on Logic Programming, ICLP’01, Ph. Codognet (ed.), LNCS 2237, Springer, 2001, pp. 348–364.
Kifer, M. and Lozinskii, E.L. “A Logic for Reasoning with Inconsistency”. Journal of Automated reasoning, 1992, 9(2):179–215.
Kifer, M. and Subrahmanian, V.S. “Theory of Generalized Annotated Logic Programming and its Applications”. Journal of Logic Programming, 1992, 12(4):335–368.
Leone, N.; Rullo, P. and Scarcello, F. Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics, and Computation. Information and Computation, 1997, 135(2):69–112.
Lloyd, J.W. “Foundations of Logic Programming”. Springer Verlag, 1987.
Marek, V.W. and Truszczynski, M. “Revision Programming”. Theoretical Computer Science, 1998, 190(2):241–277.
Sagonas, K.F.; Swift, T. and Warren, D.S. XSB as an Efficient Deductive Database Engine. In Proc. of the 1994 ACM SIGMOD International Conference on Management of Data, ACM Press, 1994, pp. 442–453.
Winslett, M. Reasoningab out Action usinga Possible Models Approach. In Proc. Seventh National Conference on Artificial Intelligence (AAAI’88), 1988, pp. 89–93.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barceló, P., Bertossi, L. (2003). Logic Programs for Querying Inconsistent Databases. In: Dahl, V., Wadler, P. (eds) Practical Aspects of Declarative Languages. PADL 2003. Lecture Notes in Computer Science, vol 2562. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36388-2_15
Download citation
DOI: https://doi.org/10.1007/3-540-36388-2_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00389-2
Online ISBN: 978-3-540-36388-0
eBook Packages: Springer Book Archive