OLD Resolution with Tabulation
暂无分享,去创建一个
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.
[1] Richard S. Bird,et al. Tabulation Techniques for Recursive Programs , 1980, CSUR.
[2] Krzysztof R. Apt,et al. Contributions to the Theory of Logic Programming , 1982, JACM.
[3] J. Lloyd. Foundations of Logic Programming , 1984, Symbolic Computation.
[4] Adrian Walker,et al. Some Practical Properties of Logic Programming Interpreters , 1984, FGCS.
[5] Robert A. Kowalski,et al. The Semantics of Predicate Logic as a Programming Language , 1976, JACM.