Skip to main content

A uniform approach to constraint satisfaction and constraint satisfiability in deductive databases

  • Data Types And Data Semantics
  • Conference paper
  • First Online:
Advances in Database Technology—EDBT '88 (EDBT 1988)

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

Included in the following conference series:

Abstract

Integrity maintenance methods have been defined for preventing updates from violating integrity constraints. Depending on the update, the full check for constraint satisfaction is reduced to checking certain instances of some relevant constraints only. In the first part of the paper new ideas are proposed for enhancing the efficiency of such a method. The second part is devoted to checking constraint satisfiability, i.e., whether a database exists in which all constraints are simultaneously satisfied. A satisfiability checking method is presented that employs integrity maintenance techniques. Simple Prolog programs are given that serve both as specifications as well as a basis for an efficient implementation.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

8. References

  1. Apt, K.R., Blair, H. and Walker, A. Towards a theory of declarative knowledge. In Minker, J. (editor), Proc. Workshop on Deductive Databases and Logic Programming. Aug., 1987.

    Google Scholar 

  2. Blaustein, B.T. Enforcing database assertions: Techniques and applications. PhD thesis, Harvard Univ., 1981.

    Google Scholar 

  3. Bocca, J. On the evaluation strategy of EDUCE. In Proc. ACM-SIGMOD Conf. on Management of Data. May, 1986.

    Google Scholar 

  4. Bry, F. and Manthey, R. Checking consistency of database constraints: A logical basis. In Proc. 12th VLDB Conf. Aug., 1986.

    Google Scholar 

  5. Bry, F. Maintaining integrity of deductive databases. Int. Rep. KB-45, ECRC, July, 1987.

    Google Scholar 

  6. Decker, H. Integrity enforcement on deductive databases. In Proc. 1st Int. Conf. on Expert Database Systems. Apr., 1986.

    Google Scholar 

  7. Kowalski, R., Sadri, F. and Soper, P. Integrity checking in deductive databases. In Proc. 13th VLDB Conf. Sept., 1987.

    Google Scholar 

  8. Kuhns, J.L. Answering questions by computers — A logical study. Rand Memo RM 5428 PR, Rand Corp., Santa Monica, Calif., 1967.

    Google Scholar 

  9. Kung, C.H. A temporal framework for information systems specification and verification. PhD thesis, Univ. of Trondheim, Norway, 1984.

    Google Scholar 

  10. Lassez, C., McAloon, K. and Port, G. Stratification and Knowledge Base Management. In Proc. 4th Int. Conf. on Logic Programming. May, 1987.

    Google Scholar 

  11. Ling, T. Integrity constraint checking in deductive databases using the Prolog not-predicate. Data & Knowledge Engineering 2, 1987.

    Google Scholar 

  12. Lloyd, J.W. and Topor, R.W. Integrity constraint checking in stratified databases. Technical Report 86/5, Univ. of Melbourne, May, 1986.

    Google Scholar 

  13. Manthey, R. and Bry, F. A hyperresolution-based proof procedure and its implementation in PROLOG. In Morik, K. (editor), Proc. GWAI-87 (German Workshop on Artificial Intelligence). Sept., 1987. Springer Verlag IFB 152.

    Google Scholar 

  14. Manthey, R. and Bry, F. SATCHMO: a theorem prover implemented in Prolog. Technical Report KB-21, ECRC, Nov., 1987. (submitted to CADE 88).

    Google Scholar 

  15. Nicolas, J.-M. Logic for improving integrity checking in relational databases. Technical Report, ONERA-CERT, Toulouse, France, Feb., 1979. Also in Acta Informatica 18, 3, Dec. 1982.

    Google Scholar 

  16. Smullyan, R.M. First-order logic. Springer Verlag, 1968.

    Google Scholar 

  17. Vieille, L. A database-complete proof procedure based on SLD-resolution. In Proc. 4th Int. Conf. on Logic Programming. May, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

J. W. Schmidt S. Ceri M. Missikoff

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bry, F., Decker, H., Manthey, R. (1988). A uniform approach to constraint satisfaction and constraint satisfiability in deductive databases. In: Schmidt, J.W., Ceri, S., Missikoff, M. (eds) Advances in Database Technology—EDBT '88. EDBT 1988. Lecture Notes in Computer Science, vol 303. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19074-0_69

Download citation

  • DOI: https://doi.org/10.1007/3-540-19074-0_69

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-19074-5

  • Online ISBN: 978-3-540-39095-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics