Chapter 3 Constraint propagation

Foundations of Artificial Intelligence

Volumn 2, Issue C, 2006, Pages 29-83

  Bessiere, Christian ^a  

^a LIRMM   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 77956715307     PISSN: 15746526     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S1574-6526(06)80007-6     Document Type: Chapter

References (126)

1. Apt K.R. The essence of constraint propagation. Theoretical Computer Science 221 1-2 (1999) 179-210
2. Apt K.R. Principles of Constraint Programming (2003), Cambridge University Press
3. Alexandria VA. Apt K.R., and Montfroy E. Automatic generation of constraint propagation algorithms for small finite domains. Proceedings CP'99 (1999) 58-72
4. Edinburgh, Scotland. Bacchus F., and Walsh T. Propagating logical combinations of constraints. Proceedings IJCAI'05 (2005) 35-40
5. Singapore. Barták R. A general relation constraint: An implementation. Proceedings of CP'00 Workshop on Techniques for Implementing Constraint Programming Systems (TRICS) (2000) 30-40
6. Barták R., and Erben R. A new algorithm for singleton arc consistency. Proceedings FLAIRS'04. Miami Beach FL (2004), AAAI Press
7. Beeri C., Fagin R., Maier D., and Yannakakis M. On the desirability of acyclic database schemes. Journal of the ACM 30 (1983) 479-513
8. Paphos, Cyprus. Beldiceanu N. Pruning for the minimum constraint family and for the number of distinct values constraint family. Proceedings CP'01 (2001) 211-224
9. May. Beldiceanu N., Carlsson M., and Rampon J.X. Global constraint catalog. Technical Report T2005:08 (2005), Swedish Institute of Computer Science
10. Ithaca, New York. Benhamou F., McAllester D.A., and Van Hentenryck P. Clp(intervals) revisited. Proceedings of the International Symposium on Logic Programming (ILPS'94) (1994) 124-138
11. Benhamou F., and Older W. Applying interval arithmetic to real, integer and boolean constraints. Journal of Logic Programming 32 (1997) 1-24
12. Paphos, Cyprus. Bennaceur H., and Affane M.S. Partition-k-ac: an efficient filtering technique combining domain partition and arc consistency. Short paper. Proceedings CP'01 (2001) 560-564
13. Berlandier P. Improving domain filtering using restricted path consistency. Proceedings IEEE Conference on Artificial Intelligence and Applications (CAIA'95) (1995)
14. Bessiere C. Arc-consistency and arc-consistency again. Artificial Intelligence 65 (1994) 179-190
15. Washington D.C. Bessiere C., and Cordier M.O. Arc-consistency and arc-consistency again. Proceedings AAAI'93 (1993) 108-113
16. Valencia, Spain. Bessiere C., and Debruyne R. Theoretical analysis of singleton arc consistency. In: Hnich B. (Ed). Proceedings ECAI'04 Workshop on Modelling and solving problems with constraints (2004) 20-29
17. Edinburgh, Scotland. Bessiere C., and Debruyne R. Optimal and suboptimal singleton arc consistency algorithms. Proceedings IJCAI'05 (2005) 54-59
18. Montréal, Canada. Bessiere C., Freuder E.C., and Régin J.C. Using inference to reduce arc consistency computation. Proceedings IJCAI'95 (1995) 592-598
19. Bessiere C., Freuder E.C., and Régin J.C. Using constraint metaknowledge to reduce arc consistency computation. Artificial Intelligence 107 (1999) 125-148
20. San Jose CA. Bessiere C., Hebrard E., Hnich B., and Walsh T. The complexity of global constraints. to appear. Proceedings AAAI'04 (2004) 112-117
21. Toronto, Canada. Bessiere C., Hebrard E., Hnich B., and Walsh T. The tractability of global constraints. Short paper. Proceedings CP'04 (2004) 716-720
22. Bessiere C., Meseguer P., Freuder E.C., and Larrosa J. On forward checking for non-binary constraint satisfaction. Artificial Intelligence 141 (2002) 205-224
23. Nagoya, Japan. Bessiere C., and Régin J.C. Arc consistency for general constraint networks: preliminary results. Proceedings IJCAI'97 (1997) 398-404
24. Seattle WA. Bessiere C., and Régin J.C. Refining the basic constraint propagation algorithm. Proceedings IJCAI'01 (2001) 309-315
25. Bessiere C., Régin J.C., Yap R.H.C., and Zhang Y. An optimal coarse-grained arc consistency algorithm. Artificial Intelligence 165 (2005) 165-185
26. Kinsale, Ireland. Bessiere C., and Van Hentenryck P. To be or not to be ... a global constraint. Short paper. Proceedings CP'03 (2003) 789-794
27. Borning A. The programming language aspects of thinglab, a constraint-oriented simulation laboratory. ACM Trans. Program. Lang. Syst. 3 4 (1981) 353-387
28. Toronto, Canada. Boussemart F., Hemery F., and Lecoutre C. Revision ordering heuristics for the constraint satisfaction problem. Proceedings of the CP'04 Workshop on Constraint Propagation and Implementation (2004) 29-43
29. Cadoli M., and Donini F.M. A survey on knowledge compilation. AI Communications 10 3-4 (1997) 137-150
30. Kinsale, Ireland. Cheng K.C.K., Lee J.H.M., and Stuckey P.J. Box constraint collections for adhoc constraints. Proceedings CP'03 (2003) 214-228
31. Portland OR. Chmeiss A., and Jégou P. Path-consistency: when space misses time. Proceedings AAAI'96 (1996) 196-201
32. Rennes, France. Chmeiss A., and Jégou P. Sur la consistance de chemin et ses formes partielles. (in French). Proceedings RFIA'96 (1996) 212-219
33. Chmeiss A., and Jégou P. Efficient path-consistency propagation. International Journal on Artificial Intelligence Tools 7 2 (1998) 121-142
34. Vancouver, Canada. Chmeiss A., and Saïs L. About the use of local consistency in solving CSPs. Proceedings IEEE-ICTAI'00 (2000) 104-107
35. http://arxiv.org/abs/cs.AI/0412021, December. Choi C.W., Harvey W., Lee J.H.M., and Stuckey P.J. Finite domain bounds consistency revisited (2004)
36. Pisa, Italy. Collavizza H., Delobel F., and Rueher M. A note on partial consistencies over continuous domains. Proceedings CP'98 (1998) 147-161
37. Cooper M.C. An optimal k-consistency algorithm. Artificial Intelligence 41 (1989/1990) 89-95
38. in French. Cros H. Compilation et apprentissage dans les réseaux de contraintes. PhD thesis, University Montpellier II, France (2003)
39. Ithaca NY. Dao T.B.H., Lallouet A., Legtchenko A., and Martin L. Indexical-based solver learning. Proceedings CP'02 (2002) 541-555
40. Davis M., and Putnam H. A computing procedure for quantification theory. Journal of the ACM 7 (1960) 201-215
41. Berlin, Germany. Debruyne R. A property of path inverse consistency leading to an optimal pic algorithm. Proceedings ECAI'00 (2000) 88-92
42. Linz, Austria. Debruyne R., and Bessiere C. From restricted path consistency to max-restricted path consistency. Proceedings CP'97 (1997) 312-326
43. Nagoya, Japan. Debruyne R., and Bessiere C. Some practicable filtering techniques for the constraint satisfaction problem. Proceedings IJCAI'97 (1997) 412-417
44. Debruyne R., and Bessiere C. Domain filtering consistencies. Journal of Artificial Intelligence Research 14 (2001) 205-230
45. Boston MA. Dechter R. On the expressiveness of networks with hidden variables. Proceedings AAAI'90 (1990) 556-562
46. Dechter R. Constraint Processing (2003), Morgan Kaufmann, Kista, Sweden
47. Dechter R., and Pearl J. Network-based heuristics for constraint-satisfaction problems. Artificial Intelligence 34 (1988) 1-38
48. Dechter R., and Pearl J. Tree clustering for constraint networks. Artificial Intelligence 38 (1989) 353-366
49. Dechter R., and van Beek P. Local and global relational consistency. Theoretical Computer Science 173 1 (1997) 283-308
50. Tokyo, Japan. Dincbas M., Van Hentenryck P., Simonis H., and Aggoun A. The constraint logic programming language chip. Proceedings of the International Conference on Fifth Generation Computer Systems (1988) 693-702
51. Fikes R.E. REF-ARF: A system for solving problems stated as procedures. Artificial Intelligence 1 (1970) 27-120
52. Freeman J.W. Improvements to propositional satisfiability search algorithms. PhD thesis, University of Pennsylvania, Philadelphia PA (1995)
53. Nov. Freuder E.C. Synthesizing constraint expressions. Communications of the ACM 21 11 (1978) 958-966
54. Jan. Freuder E.C. A sufficient condition for backtrack-free search. Journal of the ACM 29 1 (1982) 24-32
55. Oct. Freuder E.C. A sufficient condition for backtrack-bounded search. Journal of the ACM 32 4 (1985) 755-761
56. Cambridge MA. Freuder E.C. Completable representations of constraint satisfaction problems. Proceedings KR'91 (1991) 186-195
57. Portland OR. Freuder E.C., and Elfe C.D. Neighborhood inverse consistency preprocessing. Proceedings AAAI'96 (1996) 202-208
58. San Jose CA. Freuder E.C., and Wallace R.J. Selective relaxation for constraint satisfaction problems. IEEE-ICTAI'91 (1991) 332-339
59. Frühwirth T.W. Theory and practice of constraint handling rules. Journal of Logic Programming 37 1-3 (1998) 95-138
60. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to NP-Completeness (1979), Freeman
61. Gaschnig J. A constraint satisfaction method for inference making. Proceedings Twelfth Annual Allerton Conference on Circuit and System Theory (1974) 866-874
62. Gaschnig J. Experimental case studies of backtrack vs waltz-type vs new algorithms for satisficing assignment problems. Proceedings CCSCSI'78 (1978) 268-277
63. Gent I., Stergiou K., and Walsh T. Decomposable constraints. Artificial Intelligence 123 (2000) 133-156
64. Linz, Austria. Gent I.P., MacIntyre E., Prosser P., Shaw P., and Walsh T. The constrainedness of arc consistency. Proceedings CP'97 (1997) 327-340
65. Portland OR. Gent I.P., MacIntyre E., Prosser P., and Walsh T. The constrainedness of search. Proceedings AAAI'96 (1996) 246-252
66. October. Golomb S.W., and Baumert L.D. Backtrack programming. Journal of the ACM 12 4 (1965) 516-524
67. Gyssens M. On the complexity of join dependencies. ACM Trans. Database Syst. 11 1 (1986) 81-108
68. Han C.C., and Lee C.H. Comments on Mohr and Henderson's path consistency algorithm. Artificial Intelligence 36 (1988) 125-130
69. Haralick R.M., and Elliott G.L. Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence 14 (1980) 263-313
70. Van Hentenryck P., Saraswat V., and Deville Y. The design, implementation, and evaluation of the constraint language cc (fd). Constraint Programming: Basics and Trends (1995), Springer Verlag, San Francisco CA
71. ILOG Solver 4.4. ILOG. User's manual (1999), ILOG S.A.
72. Fairfax VA. Janssen P., Jégou P., Nouguier B., and Vilarem M.C. A filtering process for general constraint-satisfaction problems: Achieving pairwise-consistency using an associated binary representation. Proceedings of the IEEE Workshop on Tools for Artificial Intelligence (1989) 420-427
73. in French. Jégou P. Contribution á l'étude des problèmes de satisfaction de contraintes: algorithmes de propagation et de résolution; propagation de contraintes dans les réseaux dynamiques. PhD thesis, CRIM, University Montpellier II (1991)
74. Washington D.C. Jégou P. On the consistency of general constraint-satisfaction problems. Proceedings AAAI'93 (1993) 114-119
75. Kinsale, Ireland. Katriel I., and Thiel S. Fast bound consistency for the global cardinality constraint. Proceedings CP'03 (2003) 437-451
76. Knuth D.E. Semantics of context-free languages. Mathematical Systems Theory 2 2 (1968) 127-145
77. Knuth D.E., and Raghunathan A. The problem of compatible representatives. SIAM Journal of Discrete Mathematics 5 3 (1992) 422-427
78. Marseilles, France. Laburthe F., and Ocre. Choco: implémentation du noyau d'un système de contraintes. Proceedings JNPC'00 (2000) 151-165
79. Laurière J.L. A language and a program for stating and solving combinatorial problems. Artificial Intelligence 10 (1978) 29-127
80. Leconte M. A bounds-based reduction scheme for difference constraints. Proceedings of the FLAIRS'96 workshop on Constraint-based Reasoning (Constraint'96). Key West FL (1996)
81. Kinsale, Ireland. Lecoutre C., Boussemart F., and Hemery F. Exploiting multidirectionality in coarse-grained arc consistency algorithms. Proceedings CP'03 (2003) 480-494
82. Edinburgh, Scotland. Lecoutre C., and Cardon S. A greedy approach to establish singleton arc consistency. Proceedings IJCAI'05 (2005) 199-204
83. Chambéry, France. Lhomme O. Consistency techniques for numeric CSPs. Proceedings IJCAI'93 (1993) 232-238
84. Kinsale, Ireland. Lhomme O. Efficient filtering algorithm for disjunction of constraints. Proceedings CP'03 (2003) 904-908
85. Nagoya, Japan. Li C.M., and Anbulagan. Heuristics based on unit propagation for satisfiability problems. Proceedings IJCAI'97 (1997) 366-371
86. (also in Artificial Intelligence 8, 99-118, 1977). Mackworth A.K. Consistency in networks of relations. Technical Report 75-3 (1975), Dept. of Computer Science, Univ. of B.C. Vancouver
87. Mackworth A.K. Consistency in networks of relations. Artificial Intelligence 8 (1977) 99-118
88. Cambridge MA. Mackworth A.K. On reading sketch maps. Proceedings IJCAI'77 (1977) 598-606
89. Mackworth A.K., and Freuder E.C. The complexity of some polynomial network consistency algorithms for constraint satisfaction problems. Artificial Intelligence 25 (1985) 65-74
90. Martin P., and Shmoys D.B. A new approach to computing optimal schedules for the job-shop scheduling problem. Proceedings 5th International Conference on Integer Programming and Combinatorial Optimization (IPCO'96). LNCS volume 1084 (1996), Springer-Verlag, Vancouver, BC 389-403
91. McGregor J.J. Relational consistency algorithms and their application in finding subgraph and graph isomorphism. Information Science 19 (1979) 229-250
92. Mohr R., and Henderson T.C. Arc and path consistency revisited. Artificial Intelligence 28 (1986) 225-233
93. Munchen, FRG. Mohr R., and Masini G. Good old discrete relaxation. Proceedings ECAI'88 (1988) 651-656
94. Mohr R., and Masini G. Running efficiently arc consistency. In: Ferraté G., et al. (Ed). Syntactic and Structural Pattern Recognition (1988), Springer-Verlag 217-231
95. Montanari U. Networks of constraints: Fundamental properties and applications to picture processing. Information Science 7 (1974) 95-132
96. Montanari U., and Rossi F. Constraint relaxation may be perfect. Artificial Intelligence 48 (1991) 143-170
97. Las Vegas NV. Moskewicz M., Madigan C., Zhao Y., Zhang L., and Malik S. Chaff: Engineering an efficient sat solver. Proceedings International Design Automation Conference (DAC-01) (2001) 530-535
98. Nadel B.A. Tree search and arc consistency in constraint satisfaction algorithms. In: Kanal L., and Kumar V. (Eds). Search in Artificial Intelligence (1988), Springer-Verlag, Berlin 287-342
99. Nadel B.A. Constraint satisfaction algorithms. Computational Intelligence 5 (1989) 188-224
100. Alexandria VA. Pachet F., and Roy P. Automatic generation of music programs. Proceedings CP'99 (1999) 331-345
101. Papadimitriou C.H., and Yannakakis M. The complexity of facets (and some facets of complexity). J. Comput. System Sci. 28 (1984) 244-259
102. Singapore. Prosser P., Stergiou K., and Walsh T. Singleton consistencies. Proceedings CP'00 (2000) 353-368
103. Madison WI. Puget J.F. A fast algorithm for the bound consistency of alldiff constraints. Proceedings AAAI'98 (1998) 359-366
104. Toronto, Canada. Quimper C.G., López-Ortiz A., van Beek P., and Golynski A. Improved algorithms for the global cardinality constraint. Proceedings CP'04 (2004) 542-556
105. Kinsale, Ireland. Quimper C.G., van Beek P., López-Ortiz A., Golynski A., and Sadjad S.B. An efficient bounds consistency algorithm for the global cardinality constraint. Proceedings CP'03 (2003) 600-614
106. Seattle WA. Régin J.C. A filtering algorithm for constraints of difference in CSPs. Proceedings AAAI'94 (1994) 362-367
107. Portland OR. Régin J.C. Generalized arc consistency for global cardinality constraint. Proceedings AAAI'96 (1996) 209-215
108. Stockholm, Sweden. Rossi F., Petrie C., and Dhar V. On the equivalence of constraint satisfaction problems. Proceedings ECAI'90 (1990) 550-556
109. Florence, Italy, September. Schulte C., and Stuckey P.J. When do bounds and domain propagation lead to the same search space. Proceedings of the Third International Conference on Principles and Practice of Declarative Programming (2001), ACM Press 115-126
110. Toronto, Canada. Schulte C., and Stuckey P.J. Speeding up constraint propagation. Proceedings CP'04 (2004) 619-633
111. Singh M. Path consistency revisited. International Journal on Artificial Intelligence Tools 5 1-2 (1996) 127-141
112. Tsang E. No more 'partial' and 'full' looking ahead. Artificial Intelligence 98 (1998) 351-361
113. van Dongen M.R.C. Lightweight arc-consistency algorithms. Technical Report TR-01-2003 (2003), Cork Constraint Computation Center
114. van Dongen M.R.C., and Bowen J.A. Improving arc-consistency algorithms with double-support checks. Proceedings of the Eleventh Irish Conference on Artificial Intelligence and Cognitive Science (2000) 140-149
115. Van Hentenryck P. Constraint Satisfaction in Logic Programming (1989), MIT Press. 0-262-08181-4
116. Paris, France. Van Hentenryck P., and Deville Y. The cardinality operator: A new logical connec tive for constraint logic programming. Proceedings ICLP'91 (1991) 745-759
117. Van Hentenryck P., Deville Y., and Teng C.M. A generic arc-consistency algorithm and its specializations. Artificial Intelligence 57 (1992) 291-321
118. Van Hentenryck P., Saraswat V.A., and Deville Y. Design, implementation, and evaluation of the constraint language cc (FD). Journal of Logic Programming 37 1-3 (1998) 139-164
119. Orlando FL. Verfaillie G., Martinez D., and Bessiere C. A generic customizable framework for inverse local consistency. Proceedings AAAI'99 (1999) 169-174
120. Chambéry, France. Wallace R.J. Why AC-3 is almost always better than AC-4 for establishing arc consistency in CSPs. Proceedings IJCAI'93 (1993) 239-245
121. Vancouver, Canada. Wallace R.J., and Freuder E.C. Ordering heuristics for arc consistency algorithms. Proceedings Ninth Canadian Conference on Artificial Intelligence (1992) 163-169
122. Private communication, September. Walsh T. Errata on singleton consistencies (2000)
123. Walsh T. Relational consistencies. Technical Report APES report 28-2001 (2001), University of York, Cambridge, MA
124. Waltz D.L. Generating semantic descriptions from drawings of scenes with shadows. Tech. Rep. MAC AI-271, MIT (1972)
125. Singapore. Zhang Y., and Yap R.H.C. Arc consistency on n-ary monotonic and linear constraints. Proceedings CP'00 (2000) 470-483
126. Seattle WA. Zhang Y., and Yap R.H.C. Making AC-3 an optimal algorithm. Proceedings IJCAI'01 (2001) 316-321