Skip to main content
SpringerLink
Log in

Merging relational database technology with constraint technology

  • Conference paper
  • First Online:
Perspectives of System Informatics (PSI 1996)

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

Abstract

We describe how the relational database technology can be unified with the constraint satisfaction technology. Relational databases provide efficient massive, set-at-a-time computations, while constraints contribute with intelligent constraint solving mechanism. The merge of the two paradigms makes it possible to efficiently handle large amount of data. We present a case study of relational resolution. In addition, we mention such applications as deductive databases, constraint satisfaction, verification of finite-state systems and program synthesis.

Supported by a TFR grant

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Abiteboul, R. Hull, and V. Vianu. Foundation of Databases. Addison-Wesley Publishing Co., 1995.

    Google Scholar 

  2. E. Dantsin. Two propositional proof systems based on the splitting method. Journal of Soviet Mathematics, 22(3):1293–1305, 1983.

    Google Scholar 

  3. P. Graf. Substitution tree indexing. In J. Hsiang, editor, Rewriting Techniques and Applications, volume 914 of Lecture Notes in Computer Science, pages 117–131, 1995.

    Google Scholar 

  4. P. Graf. Term Indexing, volume 1053 of Lecture Notes in Computer Science. Springer Verlag, 1996.

    Google Scholar 

  5. E.L. Lusk. Controlling redundancy in large search spaces: Argonne-style theorem proving through the years. In A. Voronkov, editor, Logic Programming and Automated Reasoning. International Conference LPAR'92., volume 624 of Lecture Notes in Artificial Intelligence, pages 96–106, St. Petersburg, Russia, July 1992.

    Google Scholar 

  6. G. Mints and E. Tyugu. Justification of the structural synthesis of programs. Science of Computer Programming, 2(3):215–240, 1982.

    Google Scholar 

  7. E. Tyugu. Declarative programming in a type theory. In B. Moeller, editor, Constructing Programs from Specifications, pages 451–472. North Holland, 1991.

    Google Scholar 

  8. J.D. Ullman. Database and Knowledge-Base Systems, volume I. Computer Science Press, 1988.

    Google Scholar 

  9. P. Van Hentenryck. Constraint Satisfaction in Logic Programming. Logic Programming Series. MIT Press, 1989.

    Google Scholar 

  10. L. Vieille. Recursive query processing: the power of logic. Theoretical Computer Science, 69(1):1–53, 1989.

    Google Scholar 

  11. A. Voronkov. The anatomy of Vampire: Implementing bottom-up procedures with code trees. Journal of Automated Reasoning, 15(2):237–265, 1995.

    Google Scholar 

  12. A. Voronkov. Merging relational database technology with the constraint technology. UPMAIL Technical Report, Uppsala University, Computing Science Department, 1996. To appear.

    Google Scholar 

  13. Larry Wos, Ross Overbeek, and Ewing Lusk. Subsumption, a sometimes undervalued procedure. In Jean-Louis Lassez and Gordon Plotkin, editors, Computational Logic. Essays in Honor of Alan Robinson., pages 3–40. The MIT Press, Cambridge, MA, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computing Science Department, Uppsala University, Box 311, S-751 05, Uppsala, Sweden

    Andrei Voronkov

Authors
  1. Andrei Voronkov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Dines Bjørner Manfred Broy Igor V. Pottosin

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Voronkov, A. (1996). Merging relational database technology with constraint technology. In: Bjørner, D., Broy, M., Pottosin, I.V. (eds) Perspectives of System Informatics. PSI 1996. Lecture Notes in Computer Science, vol 1181. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62064-8_34

Download citation

  • DOI: https://doi.org/10.1007/3-540-62064-8_34

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62064-8

  • Online ISBN: 978-3-540-49637-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation