Skip to main content
SpringerLink
Log in

An Introduction to Prolog III

  • Conference paper
Computational Logic

Part of the book series: ESPRIT Basic Research Series ((ESPRIT BASIC))

Abstract

The Prolog III programming language extends Prolog by redefining the fundamental process at its heart: unification. Into this mechanism, Prolog III integrates refined processing of trees and lists, number processing, and processing of two-valued Boolean algebra. We present the specification of this new language and illustrate its capabilities by means of varied examples. We also present the theoretical foundations of Prolog III, which in fact apply to a whole family of programming languages. The central innovation is to replace the concept of unification by the concept of constraint solving.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. BALINSKI M. L. and R. E. GOMORY, A mutual primal-dual simplex method. In Recent Advances in Mathematical Programming, R.L. Graves and P. Wolfe, Eds. McGraw-Hill, New York, 1963, pp. 17–26.

    Google Scholar 

  2. BENHAMOU F. and J-M. BOI, Le traitement des contraintes Booléennes dans Prolog III, Thèses de Doctorat, GIA, Faculté des Sciences de Luminy, Université Aix-Marseille II, Novembre 1988.

    Google Scholar 

  3. BLAND R. G., New finite pivoting for the simplex method, Mathematics of Operations Research, Vol. 2, No. 2, May 1977.

    Google Scholar 

  4. BOOLE G., The Laws of Thought, Dover Publication Inc., New York, 1958.

    Google Scholar 

  5. BROWN M.,Problem proposed in: The American Mathematical Monthly, vol. 90, no. 8, pp. 569, 1983.

    Google Scholar 

  6. BüTTNER W. and H. SIMONIS, Embedding Boolean Expressions into Logic Programming, Journal of Symbolic Computation, 4, 1987.

    Google Scholar 

  7. CARROLL L., Symbolic Logic and the Game of Logic, New York, Dover, 1958.

    Google Scholar 

  8. COLMERAUER A., Theoretical model of Prolog II, Logic programming and its application, ed. by M. Van Caneghem and D. Warren, Ablex Publishing Corporation, pp. 3–31, 1986.

    Google Scholar 

  9. COLMERAUER A., Prolog in 10 figures, Communications of the ACM, Volume 28, Number 12, pp. 1296–1310, December 1985.

    Article  MathSciNet  Google Scholar 

  10. COLMERAUER A., Equations and Inequations on Finite and Infinite Trees, Invited lecture, Proceedings of the International Conference on Fifth Generation Computer Systems, Tokyo, pp. 85–99, November 1984.

    Google Scholar 

  11. COLMERAUER A., Final Specifications for Prolog III, Esprit P11O6 report: Further development of Prolog and its Validation by KBS in Technical Areas, February, 1988.

    Google Scholar 

  12. DANTZIG G. B., Linear Programming and Extensions, Princeton University Press, 1963.

    MATH  Google Scholar 

  13. DINCBAS M. and Al., The Constraint Logic Programming CHIP, Proceedings of the International Conference on Fifth Generation Computer Systems, ICOT, pp. 693–702, 1988.

    Google Scholar 

  14. DUIJVESTIJN A. J. W., Simple Perfect Squared Square of Lowest Order, Journal of Combinatorial Theory, Series B 25, pp. 240–243, 1978.

    Article  MathSciNet  MATH  Google Scholar 

  15. GARDNER M., Wheels, life and other mathematical amusements, W. H. Freeman and Compagny, 1983.

    MATH  Google Scholar 

  16. GENESERETH M. R. and M. L. GINSBERG, Logic Programming, Communications of the ACM, Volume 28, Number 9, 933–941, September 1985.

    Article  MathSciNet  Google Scholar 

  17. IMBERT J-L., About Redundant Inequalities Generated by Fourier’s Algorithm, AIMSA’90, 4th International Conference on Artificial Intelligence: Methodology, Systems, Applications, Albena-Varna, Bulgaria, September 1990, Proceedings to be published by North-Holland

    Google Scholar 

  18. JAFFAR J. and J-L. LASSEZ, Constraint Logic Programming, 14th ACM Symposium on the Principle of Programming languages, pp. 111–119, 1987.

    Chapter  Google Scholar 

  19. JAFFAR J. and S. MICHAYLOV, Methodology and Implementation of a Constraint Logic Programming System, Proceedings of the Fourth International Conference on Logic Programming, Melbourne, MIT Press, pp. 196–218, 1987.

    Google Scholar 

  20. KOWALSKI R. and D. KUEHNER, Resolution with Selection Function, Artificial Intelligence, Vol. 3, No. 3, pp. 227–260, 1970.

    MathSciNet  Google Scholar 

  21. OXUSOFF L. and A. RAUZY., Evaluation sémantique en calcul propositionnel, Thèses de Doctorat, GIA, Faculté des Sciences de Luminy, Université Aix-Marseille U, January 1989.

    Google Scholar 

  22. ROBINSON A., A machine-oriented logic based on the resolution principle, Journal of the ACM, 12, December 1965.

    Google Scholar 

  23. TOURAIVANE, La récupération de mémoire dans les machines non déterministes, Thèse de Doctorat, Faculté des Sciences de Luminy, Université Aix-Marseille II, November 1988.

    Google Scholar 

  24. SIEGEL P., Représentation et utilisation de la connaissance en calcul propositionnel, Thèse de Doctorat d’Etat, GIA, Faculté des Sciences de Luminy, Université Aix-Marseille II, July 1987.

    Google Scholar 

  25. SPRAGUE R., Über die Zerlegung von Rechtecken in lauter verschiedene Quadrate, Journal für die reine und angewandte Mathematik, 182, 1940.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Groupe Intelligence Artificielle, Faculté des Sciences de Luminy, Case 901, 70 route Léon Lachamp, 13288, Marseille Cedex 9, France

    Alain Colmerauer

Authors
  1. Alain Colmerauer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Bristol, Queen’s Building, University Walk, BS8 1TR, Bristol, UK

    John W. Lloyd

Rights and permissions

Reprints and permissions

Copyright information

© 1990 ECSC — EEC — EAEC, Brussels — Luxembourg

About this paper

Cite this paper

Colmerauer, A. (1990). An Introduction to Prolog III. In: Lloyd, J.W. (eds) Computational Logic. ESPRIT Basic Research Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-76274-1_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-76274-1_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-76276-5

  • Online ISBN: 978-3-642-76274-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation