A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
A successful SLD-derivation from a logic program has as result a positive assertion which is a logical implication of the program regarded as a theory of first-order logic. A finite and failed SLD-tree has as result a negation which is a logical implication of a certain theory which is a strengthened version of the program. In this paper we are concerned with a more general notion of result, one that is applicable to all SLD-derivations, independently of whether they continue on to success, todoi:10.1016/0743-1066(85)90005-6 fatcat:wvzr4jj3ungbbnaz7ze2esqd6q