A framework to specify database update views for Prolog

  • Egon Boerger
  • Bart Demoen
Session: Semantics
Part of the Lecture Notes in Computer Science book series (LNCS, volume 528)


A formal specification of a set of reasonable database update views is presented. Each reasonable database update view is a superset of the minimal view and a subset of the maximal view. Both the logical view and the immediate update view are special cases. It is then argued that the only view attractive for implementing as well as for explaining to users of a Prolog system, is the minimal view.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

8 References

  1. [Boerger a]
    E. Boerger “A Logical Operational Semantics of full Prolog. Part I:Selection Core and Control” in: CSL'89. 3d Workshop on Computer Science Logic, Springer LNCS 440, 36–64.Google Scholar
  2. [Boerger b]
    E. Boerger “A Logical Operational Semantics of full Prolog. Part II: Built-in Predicates for Database Manipulations” in: MFCS'90. Mathematical Foundations of Computer Science (B.Rovan,Ed.), Springer LNCS 452, 1–14.Google Scholar
  3. [Boerger c]
    E. Boerger “A Logical Operational Semantics of full Prolog. Part III: Built-in Predicates for Files, Terms, In-Output and Arithmetic” in: Proc. Workshop Logic from Computer Science (Ed.Y.Moschovakis), MSRI Proceedings,Springer (to appear 1991)Google Scholar
  4. [Boerger d]
    E. Boerger, D. Rosenzweig “An analysis of Prolog database views and their uniform implementation.” CSE-TR-89-91, Computer Science and Engineering Division, University of Michigan, Ann Arbor, pp.44, April 1991.Google Scholar
  5. [Demoen]
    B. Demoen, “From a specification to an implementation of a database update view for Prolog: a correctness proof” CW-report 121, K.U.LeuvenGoogle Scholar
  6. [Scowen]
    in N64 “Prolog, Draft for Working Draft 4.0”, R.S. Scowen; NPL Teddington, EnglandGoogle Scholar
  7. [Gurevich]
    Y. Gurevich “Logic and The Challenge of Computer Science.” in: E. Boerger (Ed.): Trends in theoretical Computer Science, Computer Science Press, pp. 1–57, 1988; see also by the same author “Evolving Algebras, A tutorial Introduction”, in EATCS Bulletin 43, 1991, 264–284Google Scholar
  8. [Lindholm]
    T. Lindholm, R.A. O'Keefe, “Efficient Implementation of a Defensible Semantics for Dynamic PROLOG Code” ICLP 87 21–39, Melbourne 1987Google Scholar
  9. [Moss]
    C. Moss “Cut and Paste — Defining the impure primitives of Prolog” ICLP 86 686–694, 1986 LondonGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Egon Boerger
    • 1
  • Bart Demoen
    • 2
  1. 1.Dip. di Informatica Universita di Pisa Cso Italia 40PISA
  2. 2.Dept. Computer Science Celestijnenlaan 200A B-3001 Leuven BelgiumEverberg Belgium

Personalised recommendations