Negation and quantifiers in NU-Prolog

  • Lee Naish
Session 6b: Theory And Negation
Part of the Lecture Notes in Computer Science book series (LNCS, volume 225)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

9. References

  1. [Bowen 82]
    D. L. Bowen, L. Byrd, F. C. N. Pereira, L. M. Pereira and D. H. D. Warren, Decsystem-10 Prolog User's Manual, Occasional Paper 27, DAI, University of Edinburgh, 1982.Google Scholar
  2. [Bowen 85]
    K. A. Bowen and T. Weinberg, A Meta-Level Extension of Prolog, Proceedings of the 2nd IEEE International Symposium on Logic Programming, Boston, July, 1985.Google Scholar
  3. [Carlsson 83]
    M. Carlsson and K. M. Kahn, LM-Prolog User Manual, UPMAIL Technical Report 24, Computer Science Department, Uppsala University, Sweden, 1983.Google Scholar
  4. [Lloyd 84]
    J. W. Lloyd and R. W. Topor, Making Prolog More Expressive, Journal of Logic Programming 4, (1984).Google Scholar
  5. [Naish 85a]
    L. Naish, The MU-Prolog 3.2 Reference Manual, Technical Report 85/11, Department of Computer Science, University of Melbourne, November 1985.Google Scholar
  6. [Naish 85b]
    L. Naish, All Solutions Predicates in Prolog, Proceedings of IEEE Symposium on Logic Programming, Boston, July, 1985.Google Scholar
  7. [Naish 85c]
    L. Naish, Negation and Control in PROLOG, Technical Report 85/12, Ph.D. Thesis, Department of Computer Science, University of Melbourne, 1985.Google Scholar
  8. [O'Keefe 85]
    R. A. O'Keefe, On the Treatment of Cuts in Prolog Source-Level Tools, Proceedings of the 2nd IEEE International Symposium on Logic Programming, Boston, July, 1985.Google Scholar
  9. [Schultz 84]
    J. W. Schultz, The Use Of First-order Predicate Calculus As A Logic Programming System, M.Sc Thesis, Department Of Computer Science, University Of Melbourne, 1984.Google Scholar
  10. [Ueda 85]
    K. Ueda, Guarded Horn Clauses, Technical Report TR-103, ICOT, 1985.Google Scholar
  11. [Warren 83]
    D. H. D. Warren, An Abstract Prolog Instruction Set, Technical Report 309, Artificial Intelligence Center, SRI International, 1983.Google Scholar

Copyright information

© Springer-Verlag 1986

Authors and Affiliations

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

Personalised recommendations