Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
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.
Clark, K.L. “Predicate logic as a computational formalism”, Imperial College research monograph 79/59 TOC, December 1979.
Apt, K.R. and Van Emden, M.H. “Contributions to the theory of logic programming”, Journal of the ACM 29, No. 3, 1982.
Lloyd, J.W. Foundations of logic programming, Springer-Verlag, 1984.
Brough, D.R. and Walker, A. “Some practical properties of logic programming interpreters”, Proc. International Conference on FGCS 1984, Tokyo, Nov. 1984.
Bird, R.S. “Tabulation techniques for recursive programs”, Computing Surveys 12, No.4, 1980.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tamaki, H., Sato, T. (1986). OLD resolution with tabulation. In: Shapiro, E. (eds) Third International Conference on Logic Programming. ICLP 1986. Lecture Notes in Computer Science, vol 225. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16492-8_66
Download citation
DOI: https://doi.org/10.1007/3-540-16492-8_66
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16492-0
Online ISBN: 978-3-540-39831-8
eBook Packages: Springer Book Archive