Constraint Programming: Strategic Directions

Constraints

Volumn 2, Issue 1, 1997, Pages 7-33

  Van Hentenryck, Pascal ^a   Saraswat, Vijay ^b  

^a BROWN UNIVERSITY   (United States)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0344973938     PISSN: 13837133     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1009740804951     Document Type: Article

References (132)

1. F. Afrati, S. Cosmadakis, S. Grumbach, & G. Kuper. (1994). Linear versus polynomial constraints in database query languages. In A. Borning, editor, Proceedings of the International Workshop on Principles and Practice of Constraint Programming, of LNCS #874, Springer-Verlag.
2. H. Aït-Kaci & A. Podelski. (1993). Towards a meaning of LIFE. Journal of Logic Programming 16:195-234.
3. J. Allen. (1983). Maintaining knowledge about temporal intervals. Communications of the ACM 26: 832-843.
4. I. Balbin, D.B. Kemp, K. Meenakshi, & K. Ramamohanarao. (1989). Propagating constraints in recursive deductive databases. In Proceedings of the North American Conference on Logic Programming.
5. E. Best, F.S. De Boer, & C. Palamidessi. (1995). Concurrent constraint programming with information removal. In First Conference on Concurrent Constraint Programming, Venice.
6. S. Bistarelli, U. Montanari, & F. Rossi. (1995). Constraint Solving over Semirings. In Proceedings of the International Joint Conference on Artificial Intelligence. Morgan Kaufman.
7. F.S. De Boer & C. Palamidessi. (1991). A fully abstract model for concurrent constraint programming. In Proceedings of the CAAP. Springer-Verlag.
8. A. Borning. (1981). The programming language aspects of ThingLab, a constraint oriented simulation laboratory. ACM Transaction on Programming Languages and Systems 3: 353-387.
9. A. Borning, R. Anderson, & B. Freeman-Benson. (1996). Indigo: A local propagation algorithm for inequality constraints. In Proceedings of the ACM SIGGRAPH Symposium on User Interface Software and Technology, Seattle.
10. A. Borning & B. Freeman-Benson. (1995). The OTI constraint solver: A constraint library for constructing interactive graphical user interfaces. In U. Montanari and F. Rossi, editors, Proceedings of the International Conference on Principles and Practice of Constraint Programming, volume 976, pp. 624-628, Cassis, France. Springer-Verlag.
11. A. Borning, B. Freeman-Benson, & M. Wilson. (1992). Constraint hierarchies. Lisp and Symbolic Computation 5: 223-270.
12. A. Brodsky, J. Jaffar, & M.J. Maher. (1993) Toward practical constraint databases. In Proceedings of the International Conference on Very Large Data Bases, Dublin.
13. A. Brodsky, C. Lassez, J.-L. Lassez, & M. J. Maher. (1995). Separability of polyhedra for optimal filtering of spatial and constraint data. In Proceedings of the ACM Symposium on Principles of Database Systems. ACM Press.
14. F. Bueno, M. Jose Garcia de la Banda, M. Hermenegildo, U. Montanari, & F. Rossi. (1994). From eventual to atomic and locally atomic CC programs: A concurrent semantics. In Proceedings of the International Conference on Algebraic and Logic Programming.
15. F. Bueno, M. Jose Garcia de la Banda, M. Hermenegildo, F. Rossi, & U. Montanari. (1994). Towards true concurrency semantics based transformation between CLP and CC. In A. Borning, editor, Proceedings of the International Workshop on Principles and Practice of Constraint Programming, of LNCS # 874, Springer-Verlag.
16. J.-H. Byon & P. Revesz. (1995). Disco: A constraint database system with sets. In CONTESSA Workshop on Constraint Databases and Applications.
17. J. Carlier & E. Pinson. (1989). An algorithm for solving the job shop problem. Management Science 35.
18. J. Chassin & P. Codognet. (1994). Parallel Logic Programming Systems. Computing Surveys 26: 295-336.
19. P. Cheeseman, B. Kanefsky, & W. Taylor. (1991). Where the really hard problems are. In Proceedings of the International Joint Conference on Artificial Iintelligence, pp. 331-337.
20. M. Codish, M. Falaschi, & K. Marriott. (1994). Suspension analysis for concurrent logic programs. ACM Transactions on Programming Languages and Systems 16.
21. M. Codish, M. Falaschi, K. Marriott, & W. Winsborough. (1993). Efficient analysis of concurrent constraint logic programs. In Proceedings of the International Colloquium on Automata, Languages and Programming, Lund, Sweden.
22. C. Codognet, P. Codognet, & M. Corsini. (1990). Abstract interpretation for concurrent logic languages. In Proceedings of the North American Conference on Logic Programming. MIT Press.
23. P. Codognet & D. Diaz. (1996). Compiling constraints in clp(fd). Journal of Logic Programming 27.
24. P. Codognet & F. Rossi. (1995). NMCC Programming: Constraint Enforcement and Retraction in CC Programming. In Proceedings of the International Conference on Logic Programming.
25. A. Colmerauer. (1990). An introduction to Prolog-III. Communication of the ACM 33.
26. R. Dechter. (1990). Enhancement schemes for constraint processing: Backjumping, learning and cutset decomposition. Artificial Intelligence 41: 273-312.
27. R. Dechter. (1992). Constraint networks. Encyclopedia of Artificial Intelligence, pp. 276-285.
28. R. Dechter, I. Meiri, & J. Pearl. (1991). Temporal constraint networks. Artificial Intelligence 49: 61-95.
29. R. Dechter & J. Pearl. (1987). Network-based heuristics for constraint satisfaction problems. Artificial Intelligence 34: 1-38.
30. R. Dechter & P. van Beek. (1995). From local to global relational consistency. In U. Montanari and F. Rossi, editors, Proceeding of the International Conference on Constraint Programming, volume 976, Cassis, France, 1995. Springer-Verlag. A full version to appear in Theoretical Computer Science1996.
31. M. Dincbas, P. Van Hentenryck, H. Simonis, A. Aggoun, T. Graf, & F. Berthier. (1988). The constraint logic programming language CHIP. In Proceedings of the International Conference on Fifth Generation Computer Systems. Tokyo, Japan.
32. European Computer Research Center. (1993). Eclipse User's Guide.
33. M. Falaschi, M. Gabbrielli, K. Marriott, & C. Palamidessi. (1993). Compositional analysis for concurrent constraint programming. In Proceedings of the Annual IEEE Symposium on Logic in Computer Science, pp. 210-221. IEEE Computer Society Press.
34. R. Fikes. (1968). A Heuristic Program for Solving Problems Stated as Non-deterministic Procedures. PhD thesis, Carnegie Mellon University.
35. E. C. Freuder. (1978). Synthesizing constraint expressions. Communications of the ACM 21: 958-966.
36. E. C. Freuder. (1982). A sufficient condition for backtrack-free search. Journal of the ACM 29: 24-32.
37. E. C. Freuder. (1994). Exploiting structure in constraint satisfaction problems. In B. Mayoh, E. Tyugu, and J. Penjam, editors, Constraint Programming, NATO ASI series, pp. 51-74. Springer-Verlag.
38. E. C. Freuder, editor. (1996). Principles and Practice of Constraint Programming - CP96, number 1118 in LNCS. Springer-Verlag.
39. T. Frühwirth. (1995). Constraint handling rules. In A. Podelski, editor, Constraint Programming: Basics and Trends, number 910 in LNCS, pp. 90-107. Springer-Verlag.
40. T. Frühwirth, A. Herold, V. Küchenoff, T. Le Provost, & P. Lim. (1992). Constraint logic programming - an informal introduction. In Logic Programming in Action, number 636 in LNCS, pp. 3-35. Springer-Verlag.
41. M. García de la Banda, F. Bueno, & M. Hermenegildo. (1996). Towards independent And-Parallelism in CLP. In Proceedings of the International Symposium on Programming Language Implementation and Logic Programming, LNCS. Springer Verlag.
42. M. García de la Banda, M. Hermenegildo, M. Bruynooghe, V. Dumortier, G. Janssens, & W. Simoens. (to appear). Global Analysis of Constraint Logic Programs. In ACM Transactions on Programming Languages and Systems. ACM, 1996.
43. M. García de la Banda, M. Hermenegildo, & K. Marriott. (1993). Independence in Constraint Logic Programs. In Proceedings of the International Logic Programming Symposium, pp. 130-146. MIT Press, Cambridge, MA.
44. M. García de la Banda, K. Marriott, & P. Stuckey. (1995). Efficient Analysis of Constraint Logic Programs with Dynamic Scheduling. In Proceedings of the International Logic Programming Symposium, Portland, OR. MIT Press, Cambridge, MA.
45. J. Gaschnig. (1979). Performance measurement and analysis of search algorithms. Technical Report CMU-CS-79-124, Carnegie Mellon University, Pittsburgh, Pa.
46. M. Gleicher. (1995). Practical issues in programming constraints. In V. A. Saraswat and P. Van Hentenryck, editors, Principles and Practice of Constraint Programming: The Newport Papers, pp. 407-426. MIT Press.
47. D. Q. Goldin & P.C. Kanellakis. (1996). Constraint query algebras. Constraints.
48. K. Govindarajan, B. Jayaraman, & S. Mantha. (1996). Optimization and Relaxation in Constraint Logic Languages. In Proceedings of the ACM Symposium on Principles of Programming Languages.
49. R. Gross-Brunschwiler. (1996). Implementation of Constraint Database system using a compile-time rewrite aproach. PhD thesis, ETH.
50. S. Grumbach & J. Su. (1995). Dense-order constraint databases. In Proceedings of the ACM Symposium on Principles of Database Systems.
51. S. Grumbach, J. Su, & C. Tollu. (1995). Linear constraint databases. In Proceedings of the LCC; To appear in LNCS Springer-Verlag volume.
52. V. Gupta, R. Jagadeesan, & V. A. Saraswat. (1996). Truly concurrent constraint programming. In U. Montanari and V. Sassone, editors, CONCUR96 - Concurrency Theory, volume 1119 of LNCS.
53. V. Gupta, R. Jagadeesan, & V. A. Saraswat. (to appear). Computing with continuous change. Science of Computer Programming.
54. V. Gupta, R. Jagadeesan, V. A. Saraswat, & D. G. Bobrow. (1995). Programming in hybrid constraint languages. In Antsaklis, Kohn, Nerode, and Sastry, editors, Hybrid Systems II, volume 999 of LNCS. Springer Verlag.
55. M.R. Hansen, B.S. Hansen, P. Lucas, & P. van Emde Boas. (1989). Integrating relational databases and constraint languages. Computer Languages 14: 63-82.
56. M. Haralick & J. Elliott. (1980). Increasing tree-search efficiency for constraint satisfaction problems. Artificial Intelligence 14: 263-313.
57. S. Haridi & S. Janson. (1990). Kernel Andorra Prolog and its Computational Model. In Proceedings of the International Conference on Logic Programming. MIT Press.
58. R. Helm, T. Huynh, C. Lassez, & K. Marriott. (1992). A linear constraint technology for interactive graphic systems. In Graphics Interface '92, pp. 301-309.
59. P. Van Hentenryck. (1989). Constraint Satisfaction in Logic Programming. MIT Press.
60. P. Van Hentenryck. (1989). Parallel Constraint Satisfaction in Logic Programming. In International Conference on Logic Programming, pp. 165-180, Lisbon, Portugal. MIT Press.
61. P. Van Hentenryck. (1991). Constraint logic programming. Knowledge Engineering Review 6: 151-194.
62. P. Van Hentenryck, V. A. Saraswat, & Y. Deville. (1995). Constraint processing in cc(fd). In A. Podelski, editor, Constraint Programming: Basics and Trends. Springer Verlag, LNCS 910.
63. M. Hermenegildo, K. Marriott, G. Puebla, & P. Stuckey. (1995). Incremental Analysis of Logic Programs. In International Conference on Logic Programming, pp. 797-811. MIT Press.
64. M. Hermenegildo & the CLIP group. (1994). Some Methodological Issues in the Design of CIAO - A Generic, Parallel Concurrent Constraint System. In Principles and Practice of Constraint Programming, LNCS 874, pp. 123-133. Springer-Verlag.
65. A. Heydon & G. Nelson. (1994). The Juno-2 constraint-based drawing editor. Technical Report 131a, DEC Systems Research Center, Palo Alto, CA.
66. C. Holzbaur. (1992). Metastructures vs. Attributed Variables in the Context of Extensible Unification. In International Symposium on Programming Language Implementation and Logic Programming, volume 631 of LNCS, pp. 260-268. Springer Verlag.
67. H. Hosobe, S. Matsuoka, & A. Yonezawa. (1996). Generalized local propagation: A framework for solving constraint hierarchies. In E. C. Freuder, editor, Proceedings of the International Conference on Principles and Practice of Constraint Programming, volume 1118, Boston. Springer-Verlag.
68. J. Jaffar & J.-L. Lassez. (1987). Constraint logic programming. In Proceedings of the of the ACM Symposium on Principles of Programming Languages. ACM.
69. J. Jaffar & M.J. Maher. (1994). Constraint Logic Programming: A Survey. Journal of Logic Programming, 19 & 20: 503-581.
70. J. Jaffar, S. Michaylov, P. Stuckey, & R. Yap. (1992). An abstract machine for CLP(R). In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 128-139, San Francisco.
71. J. Jaffar, S. Michaylov, P. Stuckey, & R. Yap. (1992). The CLP(R) Language and System. ACM Transactions on Programming Languages and Systems.
72. M. Jampel, E. Freuder, & M. Maher, editors. (1996). Over-Constrained Systems, number 1106 in LNCS. Springer-Verlag.
73. P. Jeavons, D. Cohen, & M. Gyssens. (1996). A test for tractability. In E. C. Freuder, editor, Principles and Practice of Constraint Programming, number 1118 in LNCS, pp. 267-281. Springer-Verlag, Boston, MA.
74. J.P. Jouannaud, editor. (1994). Proceedings of the 1st Conference on Constraints in Computational Logic (CCL), number 845 in LNCS. Springer-Verlag.
75. F. Kabanza, J.-M. Stevenne, & P. Wolper. (1990). Handling infinite temporal data. In Proceedings of the ACM Symposium on Principles of Database Systems.
76. P. Kanellakis, G. Kuper, & P. Revesz. (1995). Constraint query languages. Journal of Computer and System Sciences, pp. 26-52.
77. P. Kanellakis, S. Ramaswamy, D.E. Vengroff, & J.S. Vitter. (1993). Indexing for data models with constraints and classes. In Symposium on Principles of Database Systems.
78. A.D. Kelly, A. Macdonald, K. Marriott, P.J. Stuckey, & R.H.C. Yap. (1996). Effectiveness of optimizing compilation for clp(r). In Proceedings of the Joint International Conference and Symposium on Logic Programming, pp. 37-51. MIT Press.
79. G. Kondrak & P. van Beek. (1995). A theoretical evaluation of selected backtracking algorithms. In Proceedings of the International Joint Conference on Artificial Iintelligence, pages 541-547, Montreal.
80. G. M. Kuper. (1993). Aggregation in constraint databases. In Proceedings of the Workshop on Principles and Practice of Constraint Programming.
81. J-.L. Lassez, M.J. Maher, & K. Marriott. (1988). Foundations of Deductive Databases and Logic Programming, chapter Unification Revisited. Morgan Kaufmann Publishers, Inc.
82. J.-L. Lauriere. (1978). A language and a program for stating and solving combinatorial problems. Artificial Intelligence 10.
83. A. Levy, I.S. Mumick, & Y. Sagiv. (1994). Query optimization by predicate move-around. In Proceedings of the VLDB Conference.
84. A. Levy & Y. Sagiv. (1992). Constraints and redundancy in datalog. In Proceedings of the ACM Symposium on Principles of Database Systems.
85. Liang-Liang Li, Mike Reeve, Kees Schuerman, André Véron, Jacques Bellone, Claudine Pradelless, Zissis Palaskas, Takis Stamatopoulos, Dominic Clark, S. Doursenot, Chris Rawlings, Jack Shirazi, & Guisseppe Sardu. (1993). APPLAUSE: Applications using the ElipSys parallel CLP system. In Proceedings of the International Conference on Logic Programming, pp. 847-848.
86. A. K. Mackworth. (1992). Constraint satisfaction. Encyclopedia of Artificial Intelligence, pp. 285-293.
87. A. K. Mackworth & E. C. Freuder. (1985). The complexity of some polynomial network consistency algorithms for constraint satisfaction problems. Artificial Intelligence 25.
88. A. K. Mackworth & E. C. Freuder. (1993). The complexity of constraint satisfaction revisited. Artificial Intelligence 25: 57-62.
89. A.K. Mackworth. (1977). Consistency in networks of relations. Artificial Intelligence 8.
90. M. J. Maher. (1987). Logic semantics for a class of committed-choice programs. In Proceedings of the International Conference on Logic Programming. MIT Press.
91. K. Marriott, M. García de la Banda, & M. Hermenegildo. (1994). Analyzing Logic Programs with Dynamic Scheduling. In Proceedings of the ACM Symposium on Principles of Programming Languages, pp. 240-254. ACM.
92. K. Marriott & P. Stuckey. (1992). The 3 R's of Optimizing Constraint Logic Programs: Refinement, Removal, and Reordering. In Proceedings of the ACM Symposium on Principles of Programming Languages. ACM.
93. K. McAloon & C. Tretkoff. (to appear). Logic, modeling and programming. Annals of Operations Research.
94. M. Meier. (1996). Grace User Manual. Available at http://www.ecrc.de/eclipse/html/grace/grace.html.
95. S. Minton. (1996). Automatically Configuring Constraint Satisfaction Programs: A Case Study. Constraints 1/2: 4-31.
96. S. Minton, M. Johnston, A. Philips, & P. Laird. (1992). Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence 58: 161-206.
97. U. Montanari. (1974). Networks of constraints: Fundamental properties and application to picture processing. Information Science 7. Also Technical Report, Carnegie Mellon University, 1970.
98. U. Montanari & F. Rossi. (1995). A concurrent semantics for concurrent constraint programming via contextual nets. In V. A. Saraswat and P. Van Hentenryck, editors, Principles and Practice of Constraint Programming: The Newport Papers. MIT Press.
99. U. Montanari & F. Rossi, editors. (1995). Principles and Practice of Constraint Programming, number 976 in LNCS. Springer-Verlag.
100. I.S. Mumick, S.J. Finkelstein, H. Pirahesh, & R. Ramakrishnan. (1990). Magic conditions. In Proceedings of the ACM Symposium on Principles of Database Systems, pp. 314-330.
101. B. Myers. (1996). The Amulet User Interface Development Environment. In CHI'96 Conference Companion: Human Factors in Computing Systems, Vancouver, B.C. ACM SIGCHI.
102. (1988). G. Nemhauser & P. Wolsey. Integer and Combinatorial Optimization. J. Wiley and Sons.
103. U. Neumerkel. (1990). Extensible Unification by Metastructures. In Proceeding of the META '90 workshop.
104. D. K. Pai. (1991). Least constraint: A framework for the control of complex mechanical systems. In Proceedings of the American Control Conference, pp. 1615-1621, Boston, MA.
105. J. Paredaens, J. Van den Bussche, & D. Van Gucht. (1994). Towards a theory of spatial database queries. In Proceedings of the ACM Symposium on Principles of Database Systems.
106. R. Ramakrishnan. (1988). Magic Templates: A spellbinding approach to logic programs. In Proceedings of the International Conference on Logic Programming.
107. P. Z. Revesz. (1993). A closed-form evaluation for datalog queries with integer (gap)-order constraints. Theoretical Computer Science, 116.
108. P. Z. Revesz. (1995). Datalog queries of set constraint databases. In Proceedings of the International Conference on Database Theory.
109. F. Rossi & U. Montanari. (1994). Concurrent semantics for concurrent constraint programming. In B. Mayoh, E. Tyugu, and J. Penjam, editors, Constraint Programming, NATO ASI Series. Springer-Verlag.
110. M. Sannella. (1995). The SkyBlue constraint solver and its applications. In V. A. Saraswat and P. Van Hentenryck, editors, Principles and Practice of Constraint Programming: The Newport Papers, pp. 385-406. MIT Press.
111. M. Sannella, J. Maloney, B. Freeman-Benson, & A. Borning. (1993). Multi-way versus one-way constraints in user interfaces: Experience with the DeltaBlue algorithm. Software - Practice and Experience, 23: 529-566.
112. V. A. Saraswat. (1993). Concurrent Constraint Programming. MIT Press. ACM Doctoral Dissertation Award and Logic Programming Series.
113. V. A. Saraswat, R. Jagadeesan, & V. Gupta. (1995). Timed Default Concurrent Constraint Programming. Journal of Symbolic Computation, To appear. Extended abstract appeared in Proceedings of the ACM Symposium on Principles of Programming Languages, San Francisco.
114. V. A. Saraswat, M. Rinard, & P. Panangaden. (1991). Semantic foundations of concurrent constraint programming. In Proceedings of the ACM Symposium on Principles of Programming Languages, Orlando, FL. ACM.
115. E. Shapiro. (1982). Algorithmic Program Debugging. ACM Distiguished Dissertation. MIT Press.
116. E. Shapiro. (1989). The family of concurrent logic programming languages. ACM Computing Survey 21
117. G. Smolka. (1995). The Oz programming model. In Jan van Leeuwen, editor, Computer Science Today, number 1000 in LNCS, pp. 324-343. Springer-Verlag, Berlin.
118. D. Srivastava. (1992). Subsumption and indexing in constraint query languages with linear arithmetic constraints. Annals of Mathematics and Artificial Intelligence, to appear.
119. D. Srivastava & R. Ramakrishnan. (1992). Pushing constraint selections. In Proceedings of the ACM Symposium on Principles of Database Systems, pp. 301-315.
120. D. Srivastava, R. Ramakrishnan, & P. Revesz. (1994). Constraint objects. In Proceedings of the International Workshop on the Principles and Practice of Constraint Programming, Orcas Island, WA.
121. R. M. Stallman & G. J. Sussman. (1977). Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis. Artificial Intelligence 9: 135-196.
122. G. L. Steele. (1980). The definition and implementation of a computer programming language based on Constraints. PhD thesis, MIT.
123. I. Sutherland. (1963). Sketchpad: a man-machine graphical communication system. In Proceedings of the IFIP Spring Joint Computer Conference.
124. P. Tarau, A. Davison, K .De Bosschere, & M. Hermenegildo, editors. (1996). Proceedings of the 1st Workshop on Logic Programming Tools for INTERNET Applications, JICSLP '96, Bonn.
125. E. Tsang. (1993). Foundations of Constraint Satisfaction. Academic Press, London.
126. L. Vandeurzen, M. Gyssens, & D. Van Gucht. (1995). On the desirability and limitations of linear spatial query languages. In M. J. Egenhofer and J. R. Herring, editors, Proceedings of the Symposium on Advances in Spatial Databases, volume 951 of LNCS, pages 14-28. Springer Verlag.
127. D. L. Waltz. (1975). Understanding line drawings of scenes with shadows. In P. Winston, editor, The Psychology of Computer Vision. McGraw-Hill.
128. E. Zaffanella. (1995). Domain independent ask approximations in CCP. In U. Montanari and F. Rossi, editors, Proceedings of the International Conference on Principles and Practice of Constraint Programming, number 976 in LNCS, Cassis, France. Springer-Verlag.
129. B. Vander Zanden. (1996). An incremental algorithm for satisfying hierarchies of multi-way dataflow constraints. ACM Transactions on Programming Languages and Systems 18: 30-72.
130. Y. Zhang & A. K. Mackworth. (1994). Specification and verification of constraint-based dynamic systems. In A. Borning, editor, Principles and Practice of Constraint Programming, number 874 in LNCS, pp. 229 -242. Springer-Verlag.
131. Y. Zhang & A. K. Mackworth. (1995). Constraint programming in constraint nets. In V. A. Saraswat and P. Van Hentenryck, editor, Principles and Practice of Constraint Programming: The Newport Papers, pages 49-68. The MIT Press, Cambridge, MA.
132. Y. Zhang & A. K. Mackworth. (1995). Synthesis of hybrid constraint-based controllers. In P. Antsaklis, W. Kohn, A. Nerode, and S. Sastry, editors, Hybrid Systems II, number 999 in LNCS, pp. 552-567. Springer Verlag.