OLD resolution with tabulation

  • Hisao Tamaki
  • Taisuke Sato
Session 1b: Theory And Complexity
Part of the Lecture Notes in Computer Science book series (LNCS, volume 225)


To resolve the search-incompleteness of depth-first logic program interpreters, a new interpretation method based on the tabulation technique is developed and modeled as a refinement to SLD resolution. Its search space completeness is proved, and a complete search strategy consisting of iterated stages of depth-first search is presented. It is also proved that for programs defining finite relations only, the method under an arbitrary search strategy is terminating and complete.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Van Emden, M.H. and Kowalski, R.A. “The semantics of predicate logic as a programming languages”, Journal of the ACM 23, No.4, 1976.Google Scholar
  2. [2]
    Clark, K.L. “Predicate logic as a computational formalism”, Imperial College research monograph 79/59 TOC, December 1979.Google Scholar
  3. [3]
    Apt, K.R. and Van Emden, M.H. “Contributions to the theory of logic programming”, Journal of the ACM 29, No. 3, 1982.Google Scholar
  4. [4]
    Lloyd, J.W. Foundations of logic programming, Springer-Verlag, 1984.Google Scholar
  5. [5]
    Brough, D.R. and Walker, A. “Some practical properties of logic programming interpreters”, Proc. International Conference on FGCS 1984, Tokyo, Nov. 1984.Google Scholar
  6. [6]
    Bird, R.S. “Tabulation techniques for recursive programs”, Computing Surveys 12, No.4, 1980.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Hisao Tamaki
    • 1
  • Taisuke Sato
    • 2
  1. 1.Ibaraki UniversityHitachiJapan
  2. 2.Electrotechnical LaboratorySakuramuraJapan

Personalised recommendations