Negation and Quantifiers in NU-Prolog

We briefly discuss the shortcomings of negation in conventional Prolog systems. The design and implementation of the negation constructs in NU-Prolog are then presented. The major difference is the presence of explicit quantifiers. However, several other innovations are used to extract the maximum flexibility from current implementation techniques. These result in improved treatment of “if”, existential quantifiers, inequality and non-logical primitives. We also discuss how the negation primitives of NU-Prolog can be added to conventional systems, and how they can improve the implementation of higher level constructs.

[1]  Richard A. O'Keefe,et al.  On the Treatment of Cuts in Prolog Source-Level Tools , 1985, SLP.

[2]  Kazunori Ueda,et al.  Guarded Horn Clauses , 1986, LP.

[3]  Lee Naish All Solutions Predicates in Prolog , 1985, SLP.

[4]  Lee Naish,et al.  Negation and Control in Prolog , 1986, Lecture Notes in Computer Science.

[5]  Kenneth A. Bowen,et al.  A Meta-Level Extension of Prolog , 1985, SLP.

[6]  J. W. LLOYD,et al.  Making Prolog more Expressive , 1984, J. Log. Program..