Negation and quantifiers in NU-Prolog

21Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

Naish, L. (1986). Negation and quantifiers in NU-Prolog. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 225 LNCS, pp. 624–634). Springer Verlag. https://doi.org/10.1007/3-540-16492-8_111

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free