The underlying search for Magic Templates and tabulation
Roland A. Bol, Lars Degerstedt · TU/e Research Portal · 1993
The main aim of this paper is to present a framework for tabulated SLDresolution 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. 1 Introduction Resolution is the main technique used by query answering systems for logic programs. It can be applied in two different ways, usually called "bottomup " and "top-down". The top-down methods are perhaps the most intuitive ones, because their starting point is the query: they are goal-oriented . As a result they will not compute irrelevant facts, but intermediate results that are needed several times ca...