Proving termination of Prolog programs

  • Nissim Francez
  • Orna Grumberg
  • Shmuel Katz
  • Amir Pnueli
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 193)


The paper presented two kinds of proof rules to prove B-termination, the kind of termination obtained by the combination of backtracking and recursion as displayed by Prolog. The first kind of rule takes into account the context of the whole program and is based on a tree oriented operational semantics. The second kind is more compositional, dealing with separate procedures in a context independent way. It is based on a stream oriented semantics.

We would like to stress that such proof rules may be successfully used for defining other search strategies than the actual one used by prolog. An interesting question is to define in this way a probabilistic backtracking search strategy.


Initial Goal Output Stream Current Goal Proof Rule Prolog Program 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AvE 82]
    K.R. Apt, M.H. Van Emden: "Contributions to the theory of logic programming", JACM 29, 3 (July 1982).Google Scholar
  2. [CM 81]
    W.F. Clockskin, C.S.Mellish: "Programming in Prolog", Springer (1981).Google Scholar
  3. [vEK 76]
    M.H. Van Emden, R.A. Kowalski: "The semantics of predicate logic as a programming language", JACM 23,4 (1976).Google Scholar
  4. [FL 67]
    R.M.Floyd: "Assigning meanings to programs", proc AMS symp. in app. math. 19 Providence, R.I (1967)Google Scholar
  5. [FKP 77]
    N.Francez, B.Klebanski, A.Pnueli: "Backtracking in recursive computations", Acta Informatica 8 (1977).Google Scholar
  6. [GFMR 81]
    O.Grumberg, N.Francez, J.A.Makovsky, Roever: "A proof rule for fair termination of guarded commands", proc. int. symp. on Algorithmic Languages, Amsterdam (1981).Google Scholar
  7. [JM 83]
    N.D. Jones, A.Mycroft: "Stepwise developement of operational and denotational semantics of Prolog", TR. Univ. of Copenhagen, 1983.Google Scholar
  8. [KO 74]
    R.A.Kowalski: "Predicate logic as a programming language", in: Info. Proc. 74 (J.Rosenfeld,ed.), North-Holland (1974).Google Scholar
  9. [LPS 81]
    D.Lehmann, A.Pnueli, J.Stavi: "Impartiality, justice and fairness: the ethics of concurrent termination", proc. 8th ICALP, ACRE, (1981); LNCS 115 (S.Even, O.Kariv-eds.), Springer 1981.Google Scholar
  10. [NGC]
    New Generation Computing, Springer; (the existence of a journal devoted to the subject is taken as evidence for interest in that subject).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • Nissim Francez
    • 1
  • Orna Grumberg
    • 1
  • Shmuel Katz
    • 1
  • Amir Pnueli
    • 2
  1. 1.Computer Science dept., the TechnionHaifaIsrael
  2. 2.Dept. of Applied Mathematics, Weizmann instituteRehovotIsrael

Personalised recommendations