Advertisement

Semantics for Prolog via term rewrite systems

  • J. C. M. Baeten
  • W. P. Weijland
Part 1 Research Articles
Part of the Lecture Notes in Computer Science book series (LNCS, volume 308)

Abstract

We present semantics for logic programs using term rewrite systems. Reading program lines from left to right (so reversing the arrows), considering the result as a rewrite system, immediately gives the usual declarative semantics (the least Herbrand model). Then, we add a priority ordering on the rewrite rules, and obtain a procedural semantics for Prolog with depth-first search rule. This gives us different semantics in the same setting.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    K.R. Apt & M.H. van Emden, Contributions to the Theory of Logic Programming, J. ACM 29 (3), pp. 841–862, 1982.CrossRefGoogle Scholar
  2. [2]
    J.C.M. Baeten, J.A. Bergstra & J.W. Klop, Priority rewrite systems, report CS-R8407, Centre for Math. & Comp. Sci., Amsterdam 1984.Google Scholar
  3. [3]
    J.C.M. Baeten, J.A. Bergstra & J.W. Klop, Term rewrite systems with priorities, in: Proc. 2nd Conf. on Rewriting Techniques and Applications, Bordeaux 1987, Springer LNCS 256, pp. 83–94, 1987.Google Scholar
  4. [4]
    M. Fitting, A Kripke semantics for logic programs, Journal of Logic Programming 4, pp. 295–312, 1985.Google Scholar
  5. [5]
    J.W.Lloyd, Foundations of logic programming, Springer 1984.Google Scholar
  6. [6]
    T.C. Przymusinski, On the declarative and procedural semantics of stratified deductive databases, Dept. of Math. Sci., Univ. of Texas, E1 Paso.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • J. C. M. Baeten
    • 1
  • W. P. Weijland
    • 2
  1. 1.Programming Research GroupUniversity of AmsterdamAmsterdamThe Netherlands
  2. 2.Dept. of Software TechnologyCentre for Math. and Comp. Sci.AmsterdamThe Netherlands

Personalised recommendations