ACM Home Page
Please provide us with feedback. Feedback
Strategic directions in constraint programming
Full text PdfPdf (402 KB)
Source ACM Computing Surveys (CSUR) archive
Volume 28 ,  Issue 4  (December 1996) table of contents
Special ACM 50th-anniversary issue: strategic directions in computing research
Pages: 701 - 726  
Year of Publication: 1996
ISSN:0360-0300
Authors
Pascal Van Hentenryck  Brown Univ., Providence, RI
Vijay Saraswat  AT&T research, Murray Hill, NJ
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 26,   Downloads (12 Months): 125,   Citation Count: 11
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/242223.242279
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
AiT-KACI, H. AND PODELSKI, A. 1993. Towards a meaning of LIFE. J. Logic Program. 16, 3&4, 195-234.
3
 
4
BALBIN, I., KEMP, D. B., MEENAKSHI, K., AND RA- MAMOHANARAO, K. 1989. Propagating constraints in recursive deductive databases. In Proceedings of the North American Conference on Logic Programming.
 
5
BEST, E., DE BOER, F. S., AND PALAMIDESSI, C. 1995. Concurrent constraint programming with information removal. In First Conference on Concurrent Constraint Programming (Venice).
 
6
BISTARELLI, S., MONTANARI, U., AND ROSSI, F. 1995. Constraint solving over semirings. In Proceedings of the International Joint Conference on Artificial Intelligence. Morgan-Kaufman, San Mateo, CA.
 
7
8
9
 
10
 
11
 
12
13
 
14
 
15
BUENO, F., JOSE GARC~A DE LA BANDA, M., HERME- NEGILDO, M., ROSSI, F., AND MONTANARI, U. 1994. Towards true concurrency semantics based transformation between CLP and CC. In Proceedings of the International Workshop on Principles and Practice of Constraint Programming, (Orcas Island, WA) Vol. 874 LNCS, A. Borning, Ed., Springer-Verlag.
 
16
 
17
18
 
19
CHEESEMAN, P., KANEFSKY, B., AND TAYLOR, W. 1991. Where the really hard problems are. In Proceedings of the International Joint Conference on Artificial Intelligence, 331-337.
20
 
21
 
22
CODOGNET, P. AND DIAZ, D. 1996. Compiling constraints in clp(fd). J. Logic Program. 27, 3.
 
23
CODOGNET, P. AND ROSSI, F. 1995. NMCC programming: Constraint enforcement and retraction in CC programming. In Proceedings of the International Conference on Logic Programming.
 
24
25
 
26
 
27
DECHTER, R. 1992. Constraint networks. Encyclopedia of Artificial Intelligence, 276-285.
 
28
 
29
 
30
 
31
DINCBAS, M., VAN HENTENRYCK, P., SIMONIS, H., AGGOUN, A., GRAF, T., AND BERTHIER, F. 1988. The constraint logic programming language CHIP. In Proceedings of the International Conference on Fifth Generation Computer Systems (Tokyo).
 
32
EUROPEAN COMPUTER RESEARCH CENTER. 1993. Eclipse User's Guide.
 
33
FALASCHI, M., GABBRIELLI, M., MARRIOTT, Z., AND PALAMIDESSI, C. 1993. Compositional analysis for concurrent constraint programming. In Proceedings of the Annual IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 210-221.
 
34
PIKES, R. 1968. A heuristic program for solving problems stated as nondeterministic procedures. Ph.D. Thesis, Carnegie Mellon University.
35
36
 
37
FREUDER, E. C. 1994. Exploiting structure in constraint satisfaction problems. In Constraint Programming, NATO ASI series, B. Mayoh, E. Tyugu, and J. Penjam, Eds., Springer-Verlag, 51-74.
 
38
 
39
 
40
 
41
 
42
GARC~A DE LA BANDA, M., HERMENEGILDO, M., BRUYNOOGHE, M., DUMORTIER, V., JANSSENS, G., AND SIMOENS, W. 1997. Global analysis of constraint logic programs. ACM Trans. Program. Lang. Syst. (to appear).
 
43
 
44
GARCfA DE LA BANDA, M., MARRIOTT, K., AND STUCKEY, P. 1995. Efficient analysis of constraint logic programs with dynamic scheduling. In Proceedings of the International Logic Programming Symposium (Portland, OR, Dec.), MIT Press, Cambridge, MA.
 
45
GASCHNIG, g. 1979. Performance measurement and analysis of search algorithms. Tech. Rep. CMU-CS-79-124, Carnegie Mellon University, Pittsburgh, PA.
 
46
GLEICHER, M. 1995. Practical issues in programming constraints. In Principles and Practice of Constraint Programming: The Newport Papers, V. A. Saraswat and P. Van Hentenryck, Eds., MIT Press, Cambridge, MA, 407-426.
 
47
48
 
49
GROSS-BRUNSCHWILER, R. 1996. Implementation of constraint database system using a compile-time rewrite approach. Ph.D. Thesis, ETH.
50
 
51
GRUMBACH, S., Su, J., AND TOLLU, C. 1995. Linear constraint databases. In Proceedings of the LCC; LNCS (to appear) Springer-Verlag.
 
52
 
53
 
54
 
55
 
56
HARALICK, M. AND ELLIOT, J. 1980. Increasing tree-search efficiency for constraint satisfaction problems. Artif. Intell. 14, 263-313.
 
57
 
58
 
59
HERMENEGILDO, M., MARRIOTT, Z., PUEBLA, G., AND STUCKEY, P. 1995. Incremental analysis of logic programs. In International Conference on Logic Programming, (June), MIT Press, Cambridge, MA, 797-811.
 
60
 
61
HEYDON, A. AND NELSON, G. 1994. The Juno-2 constraint-based drawing editor. Tech. Rep. 131a, DEC Systems Research Center, Palo Alto, CA.
 
62
 
63
HOSOBE, H., MATSUOKA, S., AND YONEZAWA, A. 1996. Generalized local propagation: A framework for solving constraint hierarchies. In Proceedings of the International Conference on Principles and Practice of Constraint Programming, (Boston), E. C. Freuder, Ed., Vol. 1118, Springer-Verlag.
64
 
65
JAFFAR, J. AND MAHER, M.J. 1994. Constraint logic programming: A survey. J. Logic Program. 19 & 20, 503-581.
66
67
 
68
 
69
JEAVONS, P., COHEN, D., AND GYSSENS, M. 1996. A test for tractability. In Principles and Practice of Constraint Programming, E. C. Freuder, Ed., LNCS, No. 1118, Springer- Verlag, Boston, MA, 267-281.
 
70
71
 
72
73
 
74
KELLY, A. D., MACDONALD, A., MARRIOTT, K., STUCKEY, P. J., AND YAP, R. H. C. 1996. Effectiveness of optimizing compilation for clp(r). In Proceedings of the Joint International Conference and Symposium on Logic Programming, MIT Press, Cambridge, MA, 37-51.
 
75
KONDRAK, G. AND VAN BEEK, P. 1995. A theoretical evaluation of selected backtracking algorithms. In Proceedings of the International Joint Conference on Artificial Intelligence (Montreal), 541-547.
 
76
KUPER, G. M. 1993. Aggregation in constraint databases. In Proceedings of the Workshop on Principles and Practice of Constraint Programming.
 
77
 
78
LAURIERE, J.-L. 1978. A language and a program for stating and solving combinatorial problems. Artif. Intell. 10, 1.
 
79
80
 
81
 
82
MACKWORTH, A. K. 1977. Consistency in networks of relations. Artif. Intell. 8, 1.
 
83
MACKWORTH, A. K. 1992. Constraint satisfaction. In Encyclopedia of Artificial Intelligence, 285-293.
 
84
 
85
MACKWORTH, A. K. AND FREUDER, E. C. 1993. The complexity of constraint satisfaction revisited. Artif. Intell. 25, 57-62.
 
86
MAHER, M.g. 1987. Logic semantics for a class of committed-choice programs. In Proceedings of the International Conference on Logic Programming, MIT Press, Cambridge, MA.
87
88
 
89
MCALOON, K. AND TRETKOFF, C. 1997. Logic, modeling and programming. Ann. Oper. Res. (to appear).
 
90
MEIER, M. 1996. Grace User Manual. Available at http://www.ecrc.de/eclipse/html/grace/grace. html.
 
91
MINTON, S. 1996. Automatically configuring constraint satisfaction programs: A case study. Constraints 1/2, 4-31.
 
92
 
93
MONTANARI, U. 1970. Networks of constraints: Fundamental properties and application to picture processing. Inf. Sci. 7, 1974. Also Tech. Rep., Carnegie Mellon University, 1970.
 
94
MONTANARI, U. AND ROSSI, F. 1995a. A concurrent semantics for concurrent constraint programming via contextual nets. In Principles and Practice of Constraint Programming: The Newport Papers. V. A. Saraswat and P. Van Hentenryck, Eds., MIT Press, Cambridge, MA.
 
95
96
97
 
98
 
99
NEUMERKEL, U. 1990. Extensible unification by metastructures. In Proceedings of the META'90 Workshop.
 
100
PAI, D.K. 1991. Least constraint: A framework for the control of complex mechanical systems. In Proceedings of the American Control Conference (Boston, MA, June), 1615-1621.
101
 
102
RAMAKRISHNAN, R. 1988. Magic templates: A spellbinding approach to logic programs. In Proceedings of the International Conference on Logic Programming.
 
103
 
104
 
105
 
106
SANNELLA, M. 1995. The SkyBlue constraint solver and its applications. In Principles and Practice of Constraint Programming: The Newport Papers, V. A. Saraswat and P. Van Hentenryck, Eds., MIT Press, Cambridge, MA, 385-406.
 
107
 
108
109
110
 
111
112
 
113
SMOLKA, G. 1995. The Oz programming model. In Computer Science Today, Jan van Leeuwen, Ed., LNCS, No. 1000, Springer-Verlag, Berlin, 324-343.
 
114
SRIVASTAVA, D. 1992. Subsumption and indexing in constraint query languages with linear arithmetic constraints. Ann. Math. Artif. Intell. (to appear).
115
 
116
 
117
STALLMAN, R. M. AND SUSSMAN, G. J. 1977. Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis. Artif. Intell. 9, 135-196.
 
118
STEELE, G. L. 1980. The definition and implementation of a computer programming language based on constraints. Ph.D. Thesis, MIT.
 
119
SUTHERLAND, I. 1963. Sketchpad: A man-machine graphical communication system. In Proceedings of the IFIP Spring Joint Computer Conference.
 
120
TARAU, P., DAVISON, A., DE BOSSCHERE, K., AND HERMENEGILDO, M., EDS. 1996. Proceedings of the First Workshop on Logic Programming Tools for INTERNET Applications, JICSLP '96 (Bonn).
 
121
TSANG, E. 1993. Foundations of Constraint Satisfaction. Academic Press, London.
 
122
 
123
 
124
VAN HENTENRYCK, P. 1989b. Parallel constraint satisfaction in logic programming. In International Conference on Logic Programming (Lisbon, Portugal, June), MIT Press, Cambridge, MA, 165-180.
 
125
VAN HENTENRYCK, P. 1991. Constraint logic programming. Knowl. Eng. Rev. 6, 6, 151-194.
 
126
VAN HENTENRYCK, P., SARASWAT, V. A., AND DEV- ILLE, Y. 1995. Constraint processing in cc(fd). In Constraint Programming: Basics and Trends, A. Podelski, Ed., LNCS 910, Springer Verlag.
 
127
WALTZ, D. L. 1975. Understanding line drawings of scenes with shadows. In The Psychology of Computer Vision, P. Winston, Ed., McGraw-Hill.
 
128
129
 
130
 
131
ZHANG, Y. AND MACKWORTH, A. K. 1995a. Constraint programming in constraint nets. In Principles and Practice of Constraint Programming: The Newport Papers, V. A. Saras- Tat and P. Van Hentenryck, Eds., MIT Press, Cambridge, MA, 49-68.
 
132

CITED BY  11

Collaborative Colleagues:
Pascal Van Hentenryck: colleagues
Vijay Saraswat: colleagues