Skip to main content
SpringerLink
Log in

Analytic Tableaux and Database Repairs: Foundations

  • Conference paper
  • First Online:
Foundations of Information and Knowledge Systems (FoIKS 2002)

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

Abstract

In this article, we characterize in terms of analytic tableaux the repairs of inconsistent relational databases, that is databases that do not satisfy a given set of integrity constraints. For this purpose we provide closing and opening criteria for branches in tableaux that are built for database instances and their integrity constraints. We use the tableaux based characterization as a basis for consistent query answering, that is for retrieving from the database answers to queries that are consistent wrt the integrity constraints.

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

Access this chapter

Log in via an institution
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.

References

  1. M. Arenas, L. Bertossi and J. Chomicki. Consistent Query Answers in Inconsistent Databases. Proc. ACM Symposium on Principles of Database Systems (ACM PODS’99), 1999, pp. 68–79.

    Google Scholar 

  2. M. Arenas, L. Bertossi and J. Chomicki. Scalar Aggregation in FD-Inconsistent Databases. In Database Theory-ICDT 2001 (Proc. International Conference on Database Theory, ICDT’2001). Springer LNCS 1973, 2001, pp. 39–53.

    Chapter  Google Scholar 

  3. L. Bertossi and C. Schwind. An Analytic Tableaux based Characterization of Database Repairs for Consistent Query Answering (preliminary report). In Working Notes of the IJCAI’01 Workshop on Inconsistency in Data and Knowledge, AAAI Press, 2001, pp. 95–106.

    Google Scholar 

  4. E. W. Beth. The Foundations of Mathematics. North Holland, 1959.

    Google Scholar 

  5. F. Bry. Query Answering in Information Systems with Integrity Constraints. In Proc. IFIP WG 11.5 Working Conference on Integrity and Control in Information Systems, Chapman & Hall, 1997.

    Google Scholar 

  6. A. Celle and L. Bertossi. 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). Lecture Notes in Artificial Intelligence 1861, Springer 2000, pp. 942–956.

    Google Scholar 

  7. L. Cholvy. A General Framework for Reasoning about Contradictory Information and some of its Applications. In Proceedings of ECAI Workshop “Conflicts among Agents”, Brighton, England, August 1998.

    Google Scholar 

  8. M. Fitting. First Order Modal Tableaux. Journal of Automated Reasoning, 4(2), 191–213, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  9. M. Fitting. First Order Logic and Automated Theorem Proving. Texts and Monographs in Computer Science. Springer Verlag, 1990.

    Google Scholar 

  10. G. Gottlob. Complexity results for nonmonotonic logics. Journal of Logic and Computation, 2(3), 1992.

    Google Scholar 

  11. E. Lafon and C. B. Schwind. A Theorem Prover for Action Performance. In Y. Kodratoff, editor, Proceedings of the 8th European Conference on Artificial Intelligence, pages 541–546. Pitman Publishing, 1988.

    Google Scholar 

  12. R. Reiter. Towards a Logical Reconstruction of Relational Database Theory. In ‘On Conceptual Modeling’, Brodie, M. L. and Mylopoulos, J. and Schmidt, J. W. (eds.), Springer-Verlag, 1984, pp. 191–233.

    Google Scholar 

  13. R. Reiter. A Sound and Sometimes Complete Query Evaluation Algorithm for Relational Databases with Null Values. Journal of the ACM, 33(2): 349–370, 1986.

    Article  MathSciNet  Google Scholar 

  14. C. B. Schwind. A Tableau-based Theorem Prover for a Decidable Subset of Default Logic. In M. E. Stickel, editor, Proceedings of the 10th International Conference on Automated Deduction, number 449 in Lecture Notes in Artificial Intelligence, pages 541–546. Springer Verlag, July 1990.

    Google Scholar 

  15. C. B. Schwind and V. Risch. Tableau-based Characterisation and Theorem Proving for Default Logic. Journal of Automated Reasoning, 13(4):223–242, 1994.

    MATH  MathSciNet  Google Scholar 

  16. R. M. Smullyan. First Order Logic. Springer, 1968.

    Google Scholar 

  17. M. Winslett. Reasoning about Action with a Possible Models Approach. In Proceedings of the 8th National Conference on Artificial Intelligence, pages 89–93, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, Carleton University, K1S 5B6, Ottawa, Canada

    Leopoldo Bertossi

  2. LIM, Faculté des Sciences de Luminy, 163, Avenue de Luminy, Case 901, 13288, Marseille, Cedex 9, France

    Camilla Schwind

Authors
  1. Leopoldo Bertossi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Camilla Schwind
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Information Systems (E814), Technical University of Vienna, Karlsplatz 13, 1040, Wien, Austria

    Thomas Eiter

  2. Department of Information Systems, Massey University, Private Bag 11 222, Palmerston North, New Zealand

    Klaus-Dieter Schewe

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bertossi, L., Schwind, C. (2002). Analytic Tableaux and Database Repairs: Foundations. In: Eiter, T., Schewe, KD. (eds) Foundations of Information and Knowledge Systems. FoIKS 2002. Lecture Notes in Computer Science, vol 2284. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45758-5_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-45758-5_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43220-3

  • Online ISBN: 978-3-540-45758-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation