Alain Colmerauer
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.
- 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.Google Scholar
- 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.Google Scholar
- 3 Bland R.G. New finite pivoting for the simplex method. Math Oper. Res. 2, (May 1977), 103-107.Google ScholarDigital Library
- 4 Boole G. The Laws of Thought. Dover Publication Inc., New York. 1958. Google ScholarDigital Library
- 5 Brown M. Problem proposed in: Am. Math. Month_ly 90, 8 (1983), 569.Google Scholar
- 6 Bfittner W. and Simonis, H. Embedding Boolean expressions into logic programming. Symbolic Comput. 4, (October 1987), 191-205. Google ScholarDigital Library
- 7 Carroll L. Symbolic Logic and the Game of Logic. Dover, New York. 1958.Google Scholar
- 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.Google Scholar
- 9 Colmerauer A. Prolog in 10 figures. Commun. ACM28, 12 (December 1985), 1296-1310. Google ScholarDigital Library
- 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.Google Scholar
- 11 Colmerauer A. Final specifications for Prolog lII, Esprit I project Pl106. February, 1988.Google Scholar
- 12 Dantzig G.B. Linear Programming and Extensions. Princeton University Press, Princeton, N.J., 1963.Google Scholar
- 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.Google Scholar
- 14 Duijvestijn A.J.W. Simple perfect squared square of lowest order. Comb. Theory. set B 25, (1978), 240-243.Google Scholar
- 15 Gardner M. Wheels, Life andOtherMathematicalAmusements. W.H. Freeman and Co., I983.Google Scholar
- 16 Genesereth M.R. and Ginsberg, M.L. Logic programming. Commun. ACM 28, (September 1985), 933-941. Google ScholarDigital Library
- 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.Google ScholarCross Ref
- 18 JaffarJ. and Lassez, J-L. Constraint logic programming. FourteenthACM Symposium on the Principle of Programming Languages, (1987). pp. 111-119. Google ScholarDigital Library
- 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.Google Scholar
- 20 Kowalski R. and Kuehner, D. Resolution with Selection Function. Artif Intell. 3, (1970), 227-260.Google Scholar
- 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.Google Scholar
- 22 Robinson A. A machine-oriented logic based on the resolution principle. J. ACM 12, (December 1965). Google ScholarDigital Library
- 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.Google Scholar
- 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.Google Scholar
- 25 Sprague R. Uber die Zerlegung von Rechtecken in lauter verschiedene Quadrate. J. fiir die reine und angewandte Mathematik 182, (1940).Google Scholar
Index Terms
- An introduction to Prolog III
Recommendations
Prolog - the language and its implementation compared with Lisp
Proceedings of the 1977 symposium on Artificial intelligence and programming languagesProlog is a simple but powerful programming language founded on symbolic logic. The basic computational mechanism is a pattern matching process (“unification”) operating on general record structures (“terms” of logic). We briefly review the language and ...
Representing calendrical algorithms and data in Prolog and Prolog III languages
The paper reports on a study to develop solutions for a chosen problem in two related, but different languages. Moreover, the languages reflect two related, but different programming paradigms: logic programming, and constraint, logic programming, ...
Towards a jitting VM for prolog execution
PPDP '10: Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programmingMost Prolog implementations are implemented in low-level languages such as C and are based on a variation of the WAM instruction set, which enhances their performance but makes them hard to write. In addition, many of the more dynamic features of Prolog ...
Reviews
Jan Grabowski
Prolog III is a constraint logic programming language developed by the author starting in the mid-1980s. This overview introduces the language in a self-contained way. The features of Prolog III are treated in the following order: the domain of interpretation (labeled trees) constraint expressions and their meanings the meaning of a Prolog III program execution of a program treatment of various types of constraint problems (for real numbers, Booleans, trees, and integers) practical realization (remarks only) The presentation keeps an optimal balance between precision and comprehensiveness and between theoretical background and practical demonstration. The paper has to be studied carefully in order to get a clear understanding of th is difficult subject. With some background in formal structures and algorithms, however, this paper is a delightful and not too time-consuming lesson. Most of the information is conveyed by well-chosen and well-commented examples. They illustrate the computational power of Prolog III and outline possible applications. The practical section gives some performance data for typical problems; these results were achieved with the Macintosh-based interpreter developed at Colmerauers laboratory. This section mentions the specific constraint solving algorithms incorporated in that interpreter. Prolog III is not compared with Prolog II, standard logic programming, other constraint logic programming approaches, or predicate calculus. Thus it is difficult to compare Prolog III with preceding and concurrent approaches.
Access critical reviews of Computing literature here
Become a reviewer for Computing Reviews.
Comments