Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
SpringerLink
Log in

Logic Programs for Querying Inconsistent Databases

  • Conference paper
  • First Online:
Practical Aspects of Declarative Languages (PADL 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2562))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Abiteboul, S.; Hull, R. and Vianu, V. “Foundations of Databases”. Addison-Wesley, 1995.

    Google Scholar 

  2. 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.

    Google Scholar 

  3. 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.

    Google Scholar 

  4. 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.

    Google Scholar 

  5. 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.

    Chapter  Google Scholar 

  6. Arenas, M.; Bertossi, L. and Chomicki, J. Answer Sets for Consistent Query Answers. Submitted in 2001. (CoRR paper cs.DB/0207094)

    Google Scholar 

  7. Baral, Ch. Knowledge Representation, Reasoning and Declarative Problem Solving with Answer Sets. Cambridge University Press. To appear.

    Google Scholar 

  8. 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.

    Google Scholar 

  9. Ben-Eliyahu, R. and Dechter, R. “Propositional Semantics for Disjunctive Logic Programs”. Annals of Mathematics in Artificial Intelligence, 1994, 12:53–87.

    Article  MATH  MathSciNet  Google Scholar 

  10. 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.

    Google Scholar 

  11. Blair, H.A. and Subrahmanian, V.S. “Paraconsistent Logic Programming”. Theoretical Computer Science, 1989, 68:135–154.

    Article  MATH  MathSciNet  Google Scholar 

  12. Buccafurri, F.; Leone, N. and Rullo, P. “Enhancing Disjunctive Datalog by Constraints”. IEEE Transactions on Knowledge and Data Engineering, 2000, 12(5):845–860.

    Article  Google Scholar 

  13. 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.

    Google Scholar 

  14. Chomicki, J. and Marcinkowski, J. “On the Computational Complexity of Consistent Query Answers”. Submitted in 2002 (CoRR paper cs.DB/0204010).

    Google Scholar 

  15. Chou, T. and Winslett, M. A Model-Based Belief Revision System. Journal of Automated Reasoning, 1994, 12:157–208.

    Article  MathSciNet  Google Scholar 

  16. 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.

    Google Scholar 

  17. Eiter, T. and Gottlob, G. Propositional Circumscription and Extended Closed World Assumption are IIp 2-complete. Theoretical Computer Science, 1993, 114, pp. 231–245.

    MATH  MathSciNet  Google Scholar 

  18. 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.

    Google Scholar 

  19. 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.

    Google Scholar 

  20. 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.

    Google Scholar 

  21. Gelfond, M. and Lifschitz, V. “Classical Negation in Logic Programs and Disjunctive Databases”. New Generation Computing, 1991, 9:365–385.

    Article  Google Scholar 

  22. 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).

    Google Scholar 

  23. 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.

    Google Scholar 

  24. Kifer, M. and Lozinskii, E.L. “A Logic for Reasoning with Inconsistency”. Journal of Automated reasoning, 1992, 9(2):179–215.

    Article  MATH  MathSciNet  Google Scholar 

  25. Kifer, M. and Subrahmanian, V.S. “Theory of Generalized Annotated Logic Programming and its Applications”. Journal of Logic Programming, 1992, 12(4):335–368.

    Article  MathSciNet  Google Scholar 

  26. Leone, N.; Rullo, P. and Scarcello, F. Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics, and Computation. Information and Computation, 1997, 135(2):69–112.

    Article  MATH  MathSciNet  Google Scholar 

  27. Lloyd, J.W. “Foundations of Logic Programming”. Springer Verlag, 1987.

    Google Scholar 

  28. Marek, V.W. and Truszczynski, M. “Revision Programming”. Theoretical Computer Science, 1998, 190(2):241–277.

    Article  MATH  MathSciNet  Google Scholar 

  29. 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.

    Google Scholar 

  30. Winslett, M. Reasoningab out Action usinga Possible Models Approach. In Proc. Seventh National Conference on Artificial Intelligence (AAAI’88), 1988, pp. 89–93.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Toronto, Toronto, Canada

    Pablo Barceló

  2. School of Computer Science, Carleton University, Ottawa, Canada

    Leopoldo Bertossi

Authors
  1. Pablo Barceló
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Leopoldo Bertossi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Department Logic and Functional Programming Group, Simon Fraser University, 8888 University Drive, V5A 1S6, Burnaby B.C., Canada

    Veronica Dahl

  2. Avaya Labs, 233 Mount Airy Road, Basking Ridge, 07920, NJ, USA

    Philip Wadler

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation