An Introduction to Prolog III

Communications of the ACM

Volumn 33, Issue 7, 1990, Pages 69-90

  Colmerauer, Alain ^a  

^a AIX MARSEILLE UNIVERSITY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY - APPLICATIONS; COMPUTER METATHEORY - BOOLEAN ALGEBRA; COMPUTER PROGRAMMING - LOGIC PROGRAMMING; MATHEMATICAL PROGRAMMING - APPLICATIONS; MATHEMATICAL TECHNIQUES - TREES;

CONSTRAINT LOGIC PROGRAMMING (CLP); PROLOG III; UNIFICATION ALGORITHM;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0025451308     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/79204.79210     Document Type: Article

References (24)

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 F. and Boi, J-M. 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.
3. Bland R.G. New finite pivoting for the simplex method. Math Oper. Res. 2, (May 1977), 103-107.
4. Boole G. The Laws of Thought. Dover Publication Inc., New York. 1958.
5. Brown M. Problem proposed in: Am. Math. Monthly 90, 8 (1983), 569.
6. Büttner W. and Simonis, H. Embedding Boolean expressions into logic programming. Symbolic Comput. 4, (October 1987), 191-205.
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. Colmerauer A. Prolog in 10 figures. Commun. ACM 28, 12 (December 1985), 1296-1310.
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 III, Esprit I project P1106. 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, ser. B 25, (1978), 240-243.
15. Gardner M. Wheels, Life and Other Mathematical Amusements. W.H. Freeman and Co., 1983.
16. Genesereth M.R. and Ginsberg, M.L. Logic programming. Commun. ACM 28, (September 1985), 933-941.
17. Jaffar J. and Lassez, J-L. Constraint logic programming. Fourteenth ACM Symposium on the Principle of Programming Languages, (1987). pp. 111-119.
18. Jaffar J. 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.
19. Kowalski R. and Kuehner, D. Resolution with Selection Function. Artif. Intell. 3, (1970), 227-260.
20. Oxusoff L. and Rauzy, A. Evaluation sémantique en calcul propositionnel. Thèses de doctorat. GIA, Faculté des Sciences de Luminy, Université Aix-Marseille II. January 1989.
21. Robinson A. A machine-oriented logic based on the resolution principle. J. ACM 12, (December 1965).
22. 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.
23. Siegel P. Représentation et utilisation de la connaissance en calcul propositionnel, Thèse de doctorat d'dtat, GIA, Faculté des Sciences de Luminy, Université Aix-Marseille II, July 1987.
24. Sprague R. Über die Zerlegung von Rechtecken in lauter verschiedene Quadrate. J. für die reine und angewandte Mathematik 182, (1940).