@techreport{R-93-01, TITLE = {The Underlying Search for Magic Templates and Tabulation. 1993}, AUTHOR = {Roland Bol and Lars Degerstedt}, YEAR = {1993}, NUMBER = {R-93-01}, INSTITUTION = ida, ADDRESS = idaaddr, ABSTRACTURL = {/publications/cgi-bin/tr-fetch.pl?r-93-01+abstr}, ABSTRACT = {The main aim of this paper is to present a framework for tabulated SLD-resolution that allows a strict separation between search space and search. We introduce the notion of a search forest to model the search space, and we define what we understand by a search strategy for it.We present some basic search strategies and discuss how a particular tabulation technique, OLDT-resolution, and a particular transformation technique, Magic Templates, relate to our approach. This comparison also reveals an inherent difference between the tabulation and the transformation approach.}, IDANR = {LiTH-IDA-R-93-01}, NOTE = {Has been accepted at the International Conference on Logic Programming, Budapest, June 1993}