Negation and quantifiers in NU-Prolog

  • Lee Naish
Session 6b: Theory And Negation

DOI: 10.1007/3-540-16492-8_111

Part of the Lecture Notes in Computer Science book series (LNCS, volume 225)
Cite this paper as:
Naish L. (1986) Negation and quantifiers in NU-Prolog. In: Shapiro E. (eds) Third International Conference on Logic Programming. ICLP 1986. Lecture Notes in Computer Science, vol 225. Springer, Berlin, Heidelberg

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.

Download to read the full conference paper text

Copyright information

© Springer-Verlag 1986

Authors and Affiliations

  • Lee Naish
    • 1
  1. 1.Machine Intelligence Project Department of Computer ScienceUniversity of MelbourneParkvilleAustralia

Personalised recommendations