An introduction to Prolog III

ABSTRACT

The Prolog III programming language extends Prolog by redefining the fundamental process at its heart: unification. This article presents the specifications of this new language and illustrates its capabilities.

REFERENCES

• 1: Balinski, M.L. and Gomory, R.E. 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.
• 2: Benhamou E and Boi, J-M. Le traitement des contraintes Bool&nnes dans Prolog III. Theses de doctorat, GiA, Facult6 des Sciences de Luminy, Universit6 Aix-Marseille {I. Novembre 1988.
• 3: Bland R.G. New finite pivoting for the simplex method. Math Oper. Res. 2, (May 1977), 103-107.
• 4: George Boole, An Investigation of the Laws of Thought, Dover Publications, Incorporated, 1958
• 5: Brown M. Problem proposed in: Am. Math. Month_ly 90, 8 (1983), 569.
• 6: Wolfram Büttner , Helmut Simonis, Embedding Boolean expressions into logic programming, Journal of Symbolic Computation, v.4 n.2, p.191-205, Oct. 1987 [doi>10.1016/S0747-7171(87)80065-2]
• 7: Carroll L. Symbolic Logic and the Game of Logic. Dover, New York. 1958.
• 8: Colmerauer A. Equations and inequations on finite and infinite trees. Invited lecture. In Proceedings of the International Conference on Fifth Generation Computer Systems, (Tokyo, November 1984), pp. 85-99.
• 9: Alain Colmerauer, Prolog in 10 figures, Communications of the ACM, v.28 n.12, p.1296-1310, Dec. 1985 [doi>10.1145/214956.214958]
• 10: Colmerauer A. Theoretical model of Prolog II. In Logic Programming and its Application, M. Van Caneghem and D. Warren, Eds. Ablex Publishing Corp., Norwood, N.J., 1986, 3-31.
• 11: Colmerauer A. Final specifications for Prolog lII, Esprit I project Pl106. February, 1988.
• 12: Dantzig G.B. Linear Programming and Extensions. Princeton University Press, Princeton, N.J., 1963.
• 13: Dincbas M. et al. The constraint logic programming CHIP. In Proceedings of the International Conference on Fifth Generation Computer Systems, (Japan, December 1988), FGCS '88, pp. 693-702.
• 14: Duijvestijn A.J.W. Simple perfect squared square of lowest order. Comb. Theory. set B 25, (1978), 240-243.
• 15: Gardner M. Wheels, Life andOtherMathematicalAmusements. W.H. Freeman and Co., I983.
• 16: Michael R. Genesereth , Matthew L. Ginsberg, Logic programming, Communications of the ACM, v.28 n.9, p.933-941, Sept. 1985 [doi>10.1145/4284.4287]
• 17: Imbert J-L. About redundant inequalities generated by Fourier's algorithm. AIMSA'90, Fourth International Conference on Artificial Intelligence.' Methodology, Systems, Applications. Albena-Varna, Bulgaria. (September 1990), To be published.
• 18: J. Jaffar , J.-L. Lassez, Constraint logic programming, Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.111-119, January 21-23, 1987, Munich, West Germany [doi>10.1145/41625.41635]
• 19: JaffarJ. and Michaylov, S. Methodology and Implementation of a Constraint Logic Programming System. In Proceedings of the Fourteenth International Conference on Logic Programming (Melbourne). MIT Press, Cambridge, Mass. 1987, pp. 196-218.
• 20: Kowalski R. and Kuehner, D. Resolution with Selection Function. Artif Intell. 3, (1970), 227-260.
• 21: Oxusoff L. and Rauzy, A. Evaluation s6mantique en calcul propositionnel. Theses de doctorat. GIA, Facultfi des Sciences de Luminy, Universit~ Aix- Marseille II. January 1989.
• 22: J. A. Robinson, A Machine-Oriented Logic Based on the Resolution Principle, Journal of the ACM (JACM), v.12 n.1, p.23-41, Jan. 1965 [doi>10.1145/321250.321253]
• 23: Touraivane. La r~cup~ration de m~moire dans les machines non dtSterministes. Th?:se de doctorat, Facult(~ des Sciences de Luminy, Universit~ Aix- Marseille II, November 1988.
• 24: Siegel R Representation et utilisation de la connaissance en calcul propositionnel, Thase de doctorat d'Etat, GIA, Facult6 des Sciences de Luminy, Universit(~ Aix-Marseille II, July 1987.
• 25: Sprague R. Uber die Zerlegung von Rechtecken in lauter verschiedene Quadrate. J. fiir die reine und angewandte Mathematik 182, (1940).

INDEX TERMS

Primary Classification:
  F. Theory of Computation
  F.4 MATHEMATICAL LOGIC AND FORMAL LANGUAGES
      F.4.1 Mathematical Logic

          Nouns: Prolog

Additional Classification:
  D. Software
  D.3 PROGRAMMING LANGUAGES
      D.3.4 Processors
          Subjects: Interpreters

  F. Theory of Computation
  F.4 MATHEMATICAL LOGIC AND FORMAL LANGUAGES
      F.4.1 Mathematical Logic

          Nouns: Prolog III

  I. Computing Methodologies
  I.1 SYMBOLIC AND ALGEBRAIC MANIPULATION
      I.1.3 Languages and Systems
          Subjects: Nonprocedural languages**
  I.2 ARTIFICIAL INTELLIGENCE
      I.2.3 Deduction and Theorem Proving
          Subjects: Logic programming

General Terms:
Algorithms, Design, Languages