Strategic directions in constraint programming

ACM Computing Surveys

Volumn 28, Issue 4, 1996, Pages 701-726

  Van Hentenryck, Pascal ^a   Saraswat, Vijay ^b   Borning, Alan ^b   Brodsky, Alex ^b   Codognet, Philippe ^b   Dechter, Rina ^b   Dincbas, Mehmet ^b   Freuder, Eugene ^b   Hermenegildo, Manuel ^b   Jaffar, Joxan ^b   Kasif, Simon ^b   Lassez, Jean Louis ^b   McAllester, David ^b   McAloon, Ken ^b   Mackworth, Alan ^b   Montanari, Ugo ^b   Older, William ^b   Puget, Jean Francois ^b   Ramakrishnan, Raghu ^b   Rossi, Francesca ^b   Smolka, Gert ^b   Wachter, Ralph ^b   more..

^a BROWN UNIVERSITY   (United States)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000314222     PISSN: 03600300     EISSN: None     Source Type: Journal    
DOI: 10.1145/242223.242279     Document Type: Article

References (133)

1. AFRATI, F., COSMADAKIS, S., GRUMBACH, S., AND KUPER, G. 1994. Linear versus polynomial constraints in database query languages. In Proceedings of the International Workshop on Principles and Practice of Constraint Programming, (Orcas Island, WA), vol. 874 LNCS, Springer Verlag, New York, 181-192.
2. AI̊T-KACI, H. AND PODELSKI, A. 1993. Towards a meaning of LIFE. J. Logic Program. 16, 3&4, 195-234.
3. ALLEN, J. 1983. Maintaining knowledge about temporal intervals. Commun. ACM 26, 832-843.
4. BALBIN, I., KEMP, D. B., MEENAKSHI, K., AND RAMAMOHANARAO, 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. DE BOER, F. S. AND PALAMIDESSI, C. 1991. A fully abstract model for concurrent constraint programming. In Proceedings of the CAAP. Springer-Verlag.
8. BURNING, A. 1981. The programming language aspects of ThingLab, a constraint oriented simulation laboratory. ACM Trans. Program. Lang. Syst. 3, 4, 353-387.
9. BURNING, A., ANDERSON, R., AND FREEMAN-BENSON, B. 1996. Indigo: A local propagation algorithm for inequality constraints. In Proceedings of the ACM SIGGRAPH Symposium on User Interface Software and Technology (Seattle, Nov.).
10. BURNING, A. AND FREEMAN-BENSON, B. 1995. The OTI constraint solver: A constraint library for constructing interactive graphical user interfaces. In Proceedings of the International Conference on Principles and Practice of Constraint Programming (Cassis, France), Vol. 976, U. Montanari and F. Rossi, Eds., Springer-Verlag, 624-628.
11. BURNING, A., FREEMAN-BENSON, B., AND WILSON, M. 1992. Constraint hierarchies. Lisp Symbol. Comput. 5, 3 (Sept.), 223-270.
12. BRODSKY, A., JAFFAR, J., AND MAHER, M. J. 1993. Toward practical constraint databases. In Proceedings of the International Conference on Very Large Data Bases (Dublin).
13. BRODSKY, A., LASSEZ, C., LASSEZ, J.-L., AND MAHER, M. J. 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, New York.
14. BUENO, F., JOSE GARCÍA DE LA BANDA, M., HERMENEGILDO, M., MONTANARI, U., AND ROSSI, F. 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. BUENO, F., JOSE GARCÍA DE LA BANDA, M., HERMENEGILDO, 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. BYON, J.-H. AND REVESZ, P. 1995. Disco: A constraint database system with sets. In CONT-ESSA Workshop on Constraint Databases and Applications (Sept.).
17. CARLIER, J. AND PINSON, E. 1989. An algorithm for solving the job shop problem. Manage. Sci. 35.
18. CHASSIN, J. AND CODOGNET, P. 1994. Parallel logic programming systems. Comput. Surv. 26, (3) (Sept.), 295-336.
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. CODISH, M., FALASCHI, M., AND MARRIOTT, K. 1994. Suspension analysis for concurrent logic programs. ACM Trans. Program. Lang. Syst. 16, (3).
21. CODISH, M., FALASCHI, M., MARRIOTT, K., AND WINSBOROUGH, W. 1993. Efficient analysis of concurrent constraint logic programs. In Proceedings of the International Colloquium on Automata, Languages and Programming (Lund, Sweden, July).
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. CODOGNET, C., CODOGNET, P., AND CORSINI, M. 1990. Abstract interpretation for concurrent logic languages. In Proceedings of the North American Conference on Logic Programming. MIT Press, Cambridge, MA.
25. COLMERAUER, A. 1990. An introduction to Prolog-Ill. Commun. ACM 33, (7).
26. DECHTER, R. 1990. Enhancement schemes for constraint processing: Backjumping, learning and cutset decomposition. Artif. Intell. 41, 273-312.
27. DECHTER, R. 1992. Constraint networks. Encyclopedia of Artificial Intelligence, 276-285.
28. DECHTER, R. AND PEARL, J. 1987. Networkbased heuristics for constraint satisfaction problems. Artif. Intell. 34, 1-38.
29. DECHTER, R. AND VAN BEEK, P. 1995. From local to global relational consistency. In Proceedings of the International Conference on Constraint Programming, (Cassis, France) Vol. 976, U. Montanari and F. Rossi, Eds. Springer-Verlag. A full version to appear in Theor. Comput. Sci.
30. DECHTER, R., MEIRI, I., AND PEARL, J. 1991. Temporal constraint networks. Artif. Intell. 49, 61-95.
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, K., 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. FIKES, R. 1968. A heuristic program for solving problems stated as nondeterministic procedures. Ph.D. Thesis, Carnegie Mellon University.
35. FREUDER, E. C. 1978. Synthesizing constraint expressions. Commun. ACM 21, 11, 958-966.
36. FREUDER, E. C. 1982. A sufficient condition for backtrack-free search. J. ACM 29, 1, 24-32.
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. FREUDER, E. C. 1996. Principles and Practice of Constraint Programming-CP96. No. 1118 in LNCS. Springer-Verlag.
39. FRÜHWIRTH, T. 1995. Constraint handling rules. In Constraint Programming: Basics and Trends, A. Podelski, Ed., No. 910 LNCS, Springer-Verlag, 90-107.
40. FRÜHWIRTH, T., HEROLD, A., KÜCHENOFF, V., LE PROVOST, T., AND LIM, P. 1992. Constraint logic programming - an informal introduction. In Logic Programming in Action, No. 636 LNCS, Springer-Verlag, 3-35.
41. GARCÍA DE LA BANDA, M., BUENO, F., AND HERMENEGILDO, M. 1996. Towards independent and-parallelism in CLP. In Proceedings of the International Symposium on Programming Language Implementation and Logic Programming (Sept.), LNCS. Springer Verlag.
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. GARCÍA DE LA BANDA, M., HERMENEGILDO, M., AND MARRIOTT, K. 1993. Independence in constraint logic programs. In Proceedings of the International Logic Programming Symposium (Oct.) MIT Press, Cambridge, MA, 130-146.
44. GARCÍA 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, J. 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. GOLDIN, D. Q. AND KANELLAKIS, P. C. 1996. Constraint query algebras. Constraints.
48. GOVINDARAJAN, K., JAYARAMAN, B., AND MANTHA, S. 1996. Optimization and relaxation in constraint logic languages. In Proceedings of the ACM Symposium on Principles of Programming Languages.
49. GROSS-BRUNSCHWILER, R. 1996. Implementation of constraint database system using a compile-time rewrite approach. Ph.D. Thesis, ETH.
50. GRUMBACH, S. AND Su, J. 1995. Dense-order constraint databases. In Proceedings of the ACM Symposium on Principles of Database Systems.
51. GRUMBACH, S., Su, J., AND TOLLU, C. 1995. Linear constraint databases. In Proceedings of the LCC; LNCS (to appear) Springer-Verlag.
52. GUPTA, V., JAGADEESAN, R., AND SARASWAT, V. A. 1996. Truly concurrent constraint programming. In CONCUR96 - Concurrency Theory, U. Montanari and V. Sassone, Eds., Vol. 1119, LNCS, Springer-Verlag.
53. GUPTA, V., JAGADEESAN, R., AND SARASWAT, V. A. 1997. Computing with continuous change. Sci. Comput. Program. (to appear).
54. GUPTA, V., JAGADEESAN, R., SARASWAT, V. A., AND BOBROW, D. G. 1995. Programming in hybrid constraint languages. In Hybrid Systems II, Antsaklis, Kohn, Nerode, and Sastry, Eds., Vol. 999 LNCS, Springer Verlag.
55. HANSEN, M. R., HANSEN, B. S., LUCAS, P., AND VAN EMDE BOAS, P. 1989. Integrating relational databases and constraint languages. Comput. Lang. 14, 2, 63-82.
56. HARALICK, M. AND ELLIOT, J. 1980. Increasing tree-search efficiency for constraint satisfaction problems. Artif. Intell. 14, 263-313.
57. HARIDI, S. AND JANSON, S. 1990. Kernel Andorra Prolog and its computational model. In Proceedings of the International Conference on Logic Programming, MIT Press, Cambridge, MA.
58. HELM, R., HUYNH, T., LASSEZ, C., AND MARRIOTT, K. 1992, A linear constraint technology for interactive graphic systems. In Graphics Interface '92, 301-309.
59. HERMENEGILDO, M., MARRIOTT, K., 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. HERMENEGILDO, M. AND 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, May, Springer-Verlag, New York, 123-133.
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. HOLZBAUR, C. 1992. Metastructures vs. attributed variables in the context of extensible unification. In International Symposium on Programming Language Implementation and Logic Programming (Aug.), Vol. 631 LNCS, Springer Verlag, 260-268.
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. JAFFAR, J. AND LASSEZ, J.-L. 1987. Constraint logic programming. In Proceedings of the ACM Symposium on Principles of Programming Languages, ACM, New York.
65. JAFFAR, J. AND MAKER, M. J. 1994. Constraint logic programming: A survey. J. Logic Program. 19 & 20, 503-581.
66. JAFFAR, J., MICHAYLOV, S., STUCKEY, P., AND YAP, R. 1992. An abstract machine for CLP(R). In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, (San Francisco, June) 128-139.
67. JAFFAR, J., MICHAYLOV, S., STUCKEY, P., AND YAP, R. 1992. The CLP(R) Language and System. ACM Trans. Program. Lang. Syst.
68. JAMPEL, M., FREUDER, E., AND MAHER, M. 1996. Over-Constrained Systems. LNCS, No. 1106, Springer-Verlag.
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. JOUANNAUD, J. P., ED. 1994. Proceedings of the First Conference on Constraints in Computational Logic (CCL). LNCS, No. 845, Springer-Verlag.
71. KABANZA, F., STEVENNE, J.-M., AND WOLPER, P. 1990. Handling infinite temporal data. In Proceedings of the ACM Symposium on Principles of Database Systems.
72. KANELLAKIS, P., KUPER, G., AND REVESZ, P. 1995. Constraint query languages. J. Comput. Syst. Sci. 26-52.
73. KANELLAKIS, P., RAMASWAMY, S., VENGROFF, D. E., AND VITTER, J. S. 1993. Indexing for data models with constraints and classes. In Symposium on Principles of Database Systems.
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. LASSEZ, J.-L., MAHER, M. J., AND MARRIOTT, K. 1988. Foundations of Deductive Databases and Logic Programming. Chapter: Unification Revisited, Morgan-Kaufmann, San Mateo, CA.
78. LAURIERE, J.-L. 1978. A language and a program for stating and solving combinatorial problems. Artif. Intell. 10, 1.
79. LEVY, A., MUMICK, I. S., AND SAGIV, Y. 1994. Que-ry optimization by predicate movearound. In Proceedings of the VLDB Conference.
80. LEVY, A. AND SAGIV, Y. 1992. Constraints and redundancy in datalog. In Proceedings of the ACM Symposium on Principles of Database Systems.
81. Li, L.-L., REEVE, M., SCHUERMAN, K., VERON, A., BELLONE, J., PRADELLESS, C., PALASKAS, Z., STAMATOPOULOS, T., CLARK, D., DOURSENOT, S., RAWLINGS, C., SHIRAZI, J., AND SARDU, G. 1993. APPLAUSE: Applications using the ElipSys parallel CLP system. In Proceedings of the International Conference on Logic Programming, 847-848.
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. MACKWORTH, A. K. AND FREUDER, E. C. 1985. The complexity of some polynomial network consistency algorithms for constraint satisfaction problems. Artif. Intell. 25.
85. MACKWORTH, A. K. AND FREUDER, E. C. 1993. The complexity of constraint satisfaction revisited. Artif. Intell. 25, 57-62.
86. MAHER, M. J. 1987. Logic semantics for a class of committed-choice programs. In Proceedings of the International Conference on Logic Programming, MIT Press, Cambridge, MA.
87. MARRIOTT, K. AND STUCKEY, P. 1992. The 3 Rs of optimizing constraint logic programs: Refinement, removal, and reordering. In Proceedings of the ACM Symposium on Principles of Programming Languages, ACM, New York.
88. MARRIOTT, K., GARCÍA DE LA BANDA, M., AND HERMENEGILDO, M. 1994. Analyzing logic programs with dynamic scheduling. In Proceedings of the ACM Symposium on Principles of Programming Languages, (Jan.), ACM, New York, 240-254.
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. MINTON, S., JOHNSTON, M., PHILIPS, A., AND LAIRD, P. 1992. Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems. Artif. Intell. 58, 161-206.
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. MONTANARI, U. AND ROSSI, F., EDS. 1995b. Principles and Practice of Constraint Programming, LNCS, Vol. 976, Springer-Verlag.
96. MUMICK, I. S., FINKELSTEIN, S. J., PIRAHESH, H., AND RAMAKRISHNAN, R. 1990. Magic conditions. In Proceedings of the ACM Symposium on Principles of Database Systems, 314-330.
97. MYERS, B. 1996. The Amulet user interface development environment. In CHI'96 Conference Companion: Human Factors in Computing Systems, (Vancouver, BC, April), ACM SIG-CHI, New York.
98. NEMHAUSER, G. AND WOLSEY, P. 1988. Integer and Combinatorial Optimization. J. Wiley and Sons, New York.
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. PAREDAENS, J., VAN DEN BUSSCHE, J., AND VAN GUCHT, D. 1994. Towards a theory of spatial database queries. In Proceedings of the ACM Symposium on Principles of Database Systems.
102. RAMAKRISHNAN, R. 1988. Magic templates: A spellbinding approach to logic programs. In Proceedings of the International Conference on Logic Programming.
103. REVESZ, P. Z. 1993. A closed-form evaluation for datalog queries with integer (gap)-order constraints. Theor. Comput. Sci. 116, (Aug.).
104. REVESZ, P. Z. 1995. Datalog queries of set constraint databases. In Proceedings of the International Conference on Database Theory.
105. ROSSI, F. AND MONTANARI, U. 1994. Concurrent semantics for concurrent constraint programming. In Constraint Programming, B. Mayoh, E. Tyugu, and J. Penjam, Eds., NATO ASI Series. Springer-Verlag.
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. SANNELLA, M., MALONEY, J., FREEMAN-BENSON, B., AND BURNING, A. 1993. Multi-way versus one-way constraints in user interfaces: Experience with the DeltaBlue algorithm. Softw. Pract. Exper. 23, 5 (May), 529-566.
108. SARASWAT, V. A. 1993. Concurrent Constraint Programming. ACM Doctoral Dissertation Award and Logic Programming Series, MIT Press, Cambridge, MA.
109. SARASWAT, V. A., JAGADEESAN, R., AND GUPTA, V. 1995. Timed default concurrent constraint programming. J. Symbol. Comput. (to appear). Extended abstract appeared in Proceedings of the ACM Symposium on Principles of Programming Languages (San Francisco, Jan. 1995).
110. SARASWAT, V. A., JAGADEESAN, R., AND GUPTA, V. 1995. Timed default concurrent constraint programming. J. Symbol. Comput. (to appear). Extended abstract appeared in Proceedings of the ACM Symposium on Principles of Programming Languages (San Francisco, Jan. 1995).
111. SAHASWAT, V. A., RINARD, M., AND PANANGADEN, P. 1991. Semantic foundations of concurrent constraint programming. In Proceedings of the ACM Symposium on Principles of Programming Languages (Orlando, FL, Jan.), ACM, New York.
112. SHAPIRO, E. 1982. Algorithmic Program Debugging. ACM Distinguished Dissertation. MIT Press, Cambridge, MA.
113. SHAPIRO, E. 1989. The family of concurrent logic programming languages. ACM Comput. Surv. 21, 3.
114. SMOLKA, G. 1995. The Oz programming model. In Computer Science Today, Jan van Leeuwen, Ed., LNCS, No. 1000, Springer-Verlag, Berlin, 324-343.
115. SRIVASTAVA, D. 1992. Subsumption and indexing in constraint query languages with linear arithmetic constraints. Ann. Math. Artif. Intell. (to appear).
116. SRIVASTAVA, D. AND RAMAKRISHNAN, R. 1992. Pushing constraint selections. In Proceedings of the ACM Symposium on Principles of Database Systems, 301-315.
117. SRIVASTAVA, D., RAMAKRISHNAN, R., AND REVESZ, P. 1994. Constraint objects. In Proceedings of the International Workshop on the Principles and Practice of Constraint Programming (Orcas Island, WA, May).
118. 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.
119. STEELE, G. L. 1980. The definition and implementation of a computer programming language based on constraints. Ph.D. Thesis, MIT.
120. SUTHERLAND, I. 1963. Sketchpad: A man-machine graphical communication system. In Proceedings of the IFIP Spring Joint Computer Conference.
121. 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).
122. TSANG, E. 1993. Foundations of Constraint Satisfaction. Academic Press, London.
123. VANDEURZEN, L., GYSSENS, M., AND VAN GUCHT, D. 1995. On the desirability and limitations of linear spatial query languages. In Proceedings of the Symposium on Advances in Spatial Databases, M. J. Egenhofer and J. R. Herring, Eds., LNCS, Vol. 951, Springer-Verlag, 14-28.
124. VAN HENTENRYCK, P. 1989a. Constraint Satisfaction in Logic Programming. MIT Press, Cambridge, MA.
125. 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.
126. VAN HENTENRYCK, P. 1991. Constraint logic programming. Knowl. Eng. Rev. 6, 6, 151-194.
127. VAN HENTENRYCK, P., SARASWAT, V. A., AND DEVILLE, Y. 1995. Constraint processing in cc(fd). In Constraint Programming: Basics and Trends, A. Podelski, Ed., LNCS 910, Springer Verlag.
128. WALTZ, D. L. 1975. Understanding line drawings of scenes with shadows. In The Psychology of Computer Vision, P. Winston, Ed., McGraw-Hill.
129. ZAFFANELLA, E. 1995. Domain-independent ask approximations in CCP. In Proceedings of the International Conference on Principles and Practice of Constraint Programming (Cassis, France), U. Montanari and F. Rossi, Eds., LNCS, No. 976, Springer-Verlag.
130. VANDER ZANDEN, B. 1996. An incremental algorithm for satisfying hierarchies of multi-way dataflow constraints. ACM Trans. Program Lang. Syst. 18, 1 (Jan.), 30-72.
131. ZHANG, Y. AND MACKWORTH, A. K. 1994. Specification and verification of constraint-based dynamic systems. In Principles and Practice of Constraint Programming, A. Borning, Ed. LNCS, No. 874, Springer-Verlag, 229-242.
132. ZHANG, Y. AND MACKWORTH, A. K. 1995a. Constraint programming in constraint nets. In Principles and Practice of Constraint Programming: The Newport Papers, V. A. Saraswat and P. Van Hentenryck, Eds., MIT Press, Cambridge, MA, 49-68.
133. ZHANG, Y. AND MACKWORTH, A. K. 1995b. Synthesis of hybrid constraint-based controllers. In Hybrid Systems II, P. Antsaklis, W. Kohn, A. Nerode, and S. Sastry, Eds., LNCS, Vol. 999, Springer Verlag, 552-567.