Design, implementation, and evaluation of the constraint language cc (FD)

Journal of Logic Programming

Volumn 37, Issue 1-3, 1998, Pages 139-164

  Van Hentenryck, Pascal ^a   Saraswat, Vijay ^b   Deville, Yves ^c  

^a BROWN UNIVERSITY   (United States)

^b PALO ALTO RESEARCH CENTER   (United States)

^c UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMBINATORIAL MATHEMATICS; COMPUTATIONAL LINGUISTICS; COMPUTER PROGRAMMING LANGUAGES; CONSTRAINT THEORY; INFERENCE ENGINES; OPTIMIZATION; PROBLEM SOLVING;

CONSTRAINT LOGIC LANGUAGE; CONSTRAINT SOLVERS;

LOGIC PROGRAMMING;

EID: 0032187332     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0743-1066(98)10006-7     Document Type: Article

References (45)

1. A. Aggoun, N. Beldiceanu, Extending CHIP to solve complex scheduling and packing problems, in: Journées Francophones de Programmation Logique, Lille, France, 1992.
2. D. Applegate, W. Cook, A computational study of the job shop scheduling problem, ORSA J. Comput. 3 (2) (1991) 149-156.
3. M. Bartusch, Optimierung von Netzplänen mit Anordnungsbeziehungen bei Knappen Betriebsmitteln, Ph.D. Thesis, Fakultät fuer Mathematik und Informatik, Universität Passau, Germany (1983).
4. W. Buttner, H. Simonis, Embedding boolean expressions into logic programming, J. Symbolic Comput. 4 (1987) 191-205.
5. J. Carlier, Ordonnancement à constraintes disjonctives, RAIRO Oper. Res. 12 (4) (1978) 333-351.
6. J. Carlier, E. Pinson, Une Méthode Arborescente pour Optimiser la Durée d'un JOB-SHOP, Technical Report ISSN 0294-2755, I.M.A, Angers (1986).
7. M. Carlsson, Freeze, Indexing and Other Implemenation Issues on the WAM, in: J.-L. Lassez (Ed.), Proceedings of the Fourth International Conference on Logic Programming, Melbourne, Australia, 1987, pp. 40-58
8. J.W. Chinneck, R.A. Goubran, G.M. Karam, M. Lavoie, A design approach for real-time multiprocessor DSP applications, Report SCE-90-05, Carleton University, Ottawa, Canada (1990).
9. N. Christofides, Graph Theory: An Algorithmic Approach, Academic Press, New York, 1975.
10. A. Colmerauer, An introduction to Prolog III, Commun. ACM 28 (4) (1990) 412-418.
11. Y. Colombani, Constraint programming: An efficient and practical approach to solving the job-shop problem, in: Proceedings of the Second International Conference on Principles and Practice of Constraint Programming (CP'96), Springer, Cambridge, MA, 1996.
12. M.C. Costa, Une etude pratique de découpes de panneaux de bois, RAIRO Rech. Oper. 18 (3) (1984) 211-219.
13. T. Dean, M. Boddy, An analysis of time-dependent planning, in: Proceedings of the Seventh National Conference On Artificial Intelligence, Minneapolis, Minnesota, 1988, pp. 49-54.
14. D. Diaz, P. Codognet, A minimal extension of the wam for clp(fd), in: Proceedings of the Tenth International Conference on Logic Programming (ICLP-93), Budapest, Hungary, 1993, pp. 774-792.
15. M. Dincbas, H. Simonis, P. Van Hentenryck, Solving the car sequencing problem in constraint logic programming, in: Proceedings of the European Conference on Artificial Intelligence (ECAI-88), Munich, W. Germany, 1988.
16. M. Dincbas, H. Simonis, P. Van Hentenryck, Solving large combinatorial problems in logic programming, J. Logic Programming 8 (1/2) (1990) 75-93.
17. M. Dincbas, P. Van Hentenryck, H. Simonis, A. Aggoun, T. Graf, F. Berthier, The constraint logic programming language CHIP, in: Proceedings of the International Conference on Fifth Generation Computer Systems, Tokyo, Japan, 1988
18. T. Fruehwirth, Constraint Handling Rules, in: M. Nivat, A. Podelski (Eds.), Constraints: Basics and Trends, LNAI, vol. 907, Springer, Berlin, 1995.
19. T. Graf, Extending constraint handling in logic programming to rational arithmetic, Internal Report, ECRC, Munich, Germany (1987).
20. T. Graf, P. Van Hentenryck, C. Pradelles, L. Zimmer, Simulation of hybrid circuits in constraint logic programming, in: Proceedings of the International Joint Conference on Artificial Intelligence, Detroit, Michigan, USA, 1989
21. J. Jaffar, J.-L. Lassez, Constraint logic programming, in: Proceedings of the POPL-87, Munich, Germany, 1987.
22. J. Jaffar, S. Michaylov, Methodology and implementation of a CLP system, in: Proceedings of the Fourth International Conference on Logic Programming, Melbourne, Australia, 1987, pp. 196-218.
23. M. Kubale, D. Jackowski, A generalized implicit enumeration algorithm for graph coloring, CACM 28 (4) (1985) 412-418.
24. M. Lavoie, Task assignment in a DSP multiprocessor environment, Master's Thesis, Department of Systems and Computer Engineering, Carleton University, Ottawa, Ontario (1990).
25. T. Le Provost, M. Wallace, Generalized constraint propagation over the CLP scheme, J. Logic Programming 16 (3/4) (1993) 319-359.
26. A.K. Mackworth, Consistency in networks of relations, Artificial Intelligence 8 (1) (1977) 99-118.
27. M.J. Maher, Logic semantics for a class of committed-choice programs, in: Proceedings of the Fourth International Conference on Logic Programming, Melbourne, Australia, 1987, pp. 858-876.
28. R. Mohr, T.C. Henderson, Arc and path consistency revisited, Artificial Intelligence 28 (1986) 225-233.
29. J.F. Muth, G.L. Thompson, Industrial Scheduling, Prentice-Hall, Englewood Cliffs, NJ, 1963.
30. R.G. Parker, R.L. Rardin, Discrete Optimization. Academic Press, London, UK, 1988.
31. B.D. Parrello, CAR WARS: The (almost) birth of an expert system, AI Expert 3 (1) (1988) 60-64.
32. H.M. Salkin, On the merit of the generalized origin and restarts in implicit enumeration, Oper. Res. 18 (1970) 549-554.
33. V.A. Saraswat, Concurrent constraint programming languages, Ph.D. Thesis, Carnegie-Mellon University (1989).
34. V.A. Saraswat, M. Rinard, Concurrent constraint programming, in: Proceedings of the 17th ACM Symposium on Principles of Programming Languages, San Francisco, CA, USA, 1990.
35. V.A. Saraswat, M. Rinard, P. Panangaden, Semantic foundations of concurrent constraint programming, in: Proceedings of Ninth ACM Symposium on Principles of Programming Languages, Orlando, Florida, USA, 1991.
36. P. Van Hentenryck, Constraint Satisfaction in Logic Programming, Logic Programming Series, MIT Press, Cambridge, MA, 1989.
37. P. Van Hentenryck, Scheduling and Packing in the Constraint Language cc (FD), in: M. Zweben, M. Fox (Eds.), Intelligent Scheduling, Morgan Kaufmann, Los Altos, CA, 1994.
38. P. Van Hentenryck, Y. Deville, The cardinality operator: A new logical connective and its application to constraint logic programming, in: Proceedings of the Eighth International Conference on Logic Programming (ICLP-91), Paris, France, 1991.
39. P. Van Hentenryck, Y. Deville, M.L. Chen, C.M. Teng, New results in consistency of networks, Technical Report, CS Department, Brown University (Forthcoming).
40. P. Van Hentenryck, Y. Deville, C.M. Teng, A generic arc consistency algorithm and its specializations, Artificial Intelligence 57 (2/3) (1992) 291-321.
41. P. Van Hentenryck, T. Graf, Standard forms for rational linear arithmetics in constraint logic programming, Ann. Math. Artificial Intelligence 5 (2-4) (1992) 303-320.
42. P. Van Hentenryck, L. Michel, F. Benhamou, Newton: Constraint programming over nonlinear constraints, Sci. Comput. Programming 30 (1998) 83-118.
43. P. Van Hentenryck, L. Michel, Y. Deville, Numerica: A Modeling Language For Global Optimization, MIT Press, Cambridge, MA, 1997.
44. D.H.D Warren, An abstract Prolog instruction set, Technical Report 309, SRI, Menlo Park, CA (1983).
45. J. Zhou, A constraint program for solving the job-shop problem, in: Proceedings of the Second International Conference on Principles and Practice of Constraint Programming (CP'96), Springer, Cambridge, MA, 1996.