Donald W. Loveland and David W. Reed. A near-Horn Prolog for compliation. In Computational Logic: Essays in Honor of Alan Robinson, Cambridge, Mass., 1991. MIT Press.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....The result f lounder is passed on by all computation rules; it therefore indicates a kind of run time exception which causes the computation to terminate immediately. We should note at this point that there are other approaches to the problem of handling negation. Loveland and Reed, for example [LR91] define a resolution method by which queries against programs with negation can be evaluated in a sound and complete manner. Dahl [Dah80] defines an approach which delays the evaluation of a negated goal until it becomes ground, and an approach which, within a negated goal s computation, blocks ....

Donald W. Loveland and David W. Reed. A near-Horn Prolog for compliation. In Computational Logic: Essays in Honor of Alan Robinson, Cambridge, Mass., 1991. MIT Press.

....some of the knowledge that has been gained. 5.1 Negation In the logic programming community there seems to be a consensus that trying to handle full negation in a sound and complete manner takes one into the realm of theorem proving. Some schemes, such as Loveland s near Horn programming [LR91], provide for a graceful degradation of performance from regular Prolog when the user attempts to work with programs containing a small number of negations; but they are not available with Lambda Prolog. s2lp deals with this issue by providing eval clauses for negation which perform the usual ....

Donald W. Loveland and David W. Reed. A near-Horn Prolog for compliation. In Computational Logic: Essays in Honor of Alan Robinson, Cambridge, Mass., 1991. MIT Press.

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