| Michel Berg`ere, G'erard Ferrand and Jean-Hugues R'ety. Independence of the Computation Rule for SLD-Resolution with Delay. Technical Report INRIA RR-LIFO-93-9, 1993. |
....Clearly the query p(a) has a derivation in the program p(X) q(X) while its more general version p(X) has no derivation. Since dynamic rules allow the call to run more efficiently, most of modern Prolog style languages provide such a flexible scheduling. It is worth noting that, as shown in [5], when considering SLD derivation with delay R computed resultants whose bodies contain only delayed atoms are independent from the selection rule R. The previous lemma says that the computed resultants of a query Gfl can be obtained from the computed resultants of its more general version G, and ....
Michel Berg`ere, G'erard Ferrand and Jean-Hugues R'ety. Independence of the Computation Rule for SLD-Resolution with Delay. Technical Report INRIA RR-LIFO-93-9, 1993.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC