, M. Gabrielli 1 and G. Levi 2 MC. Meo 3 Departimento di Informatica, Universita di Pisa, Corso Italia 40, 56125, Pisa, Italy , 1Email: firstname.lastname@example.org and 2Email: email@example.com 3Dipartimento di Matematica Pura ed Applicata, Universita di L'Aquila, Via Vetoio, Localita coppito, 67010 L'Aquila, Italy. Email: firstname.lastname@example.org
In this paper we study some first-order formulas, called resultants, which can be used to describe in a concise way most of the relevant information associated to SLD-derivations. We first extend to resultants some classical results of logic programming theory. Then we define a fixpoint semantics for Prolog computed resultants, i.e. those formulas which are obtained by considering the leftmost selection rule. Suitable abstractions of such a semantics are then used to model call patterns and partial answers. Finally we show how these results can be generalized to a larger class of selection rules.
: Resultants, partial answers, call patterns, fixpoint semantics.
Part of the OUP Journal of Logic and Computation WWW service
Click here to register with OUP.
This page is maintained by OUP admin
Last updated 09 Sep 96
Part of the OUP Journals World Wide Web service.
Copyright Oxford University Press, 1996