Constraint Networks: Techniques and Algorithms

Constraint Networks: Techniques and Algorithms

Volumn , Issue , 2010, Pages

  Lecoutre, Christophe ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84891567918     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1002/9780470611821     Document Type: Book

References (429)

1. ACHLIOPTAS D., KIROUSIS L., KRANAKIS E., KRIZANC D., MOLLOY M., STAMATIOU Y., "Random constraint satisfaction: a more accurate picture", Proceedings of CP'97, p. 107-120, 1997.
2. ACHLIOPTAS D., GOMES C., KAUTZ H., SELMAN B., "Generating satisfiable problem instances", Proceedings of AAAI'00, p. 256-301, 2000.
3. ALBERT R., JEONG H., BARABASI A., "Diameter of the World-Wide Web", Nature, vol. 401, p. 130-131, 1999.
4. ALBERT R., JEONG H., BARABASI A., "Error and attack tolerance of complex networks", Nature, vol. 406, p. 378-482, 2000.
5. ALLEN J., "Maintaining knowledge about temporal intervals", Communications of the ACM, vol. 26, num. 11, p. 832-843, 1983.
6. ALOUL F., RAMANI A., MARKOV I., SAKALLAH K., "Solving difficult SAT instances in the presence of symmetry", Proceedings of DAC'02, p. 731-736, 2002.
7. ALOUL F., RAMANI A., MARKOV I., SAKALLAH K., "ShatterPB: symmetrybreaking for pseudo-Boolean formulas", Proceedings of ASP-DAC'04, p. 883-886, 2004.
8. ALOUL F., SAKALLAH K., MARKOV I., "Efficient symmetry breaking for Boolean satisfiability", IEEE Transactions on Computers, vol. 55, num. 5, p. 549-558, 2006.
9. AMILHASTRE J., FARGIER H., MARQUIS P., "Consistency restoration and explanations in dynamic CSPs - application to configuration", Artificial Intelligence, vol. 135, num. 1-2, p. 199-234, 2002.
10. ANBULAGAN, BOTEA A., "Crossword puzzles as a constraint problem", Proceedings of CP'08, p. 550-554, 2008.
11. ANSOTEGUI C., BéJAR R., FERNANDEZ C., MATEU C., "Edge matching puzzles as hard SAT/CSP benchmarks", Proceedings of CP'08, p. 560-565, 2008.
12. APT K., Principles of Constraint Programming, Cambridge University Press, 2003.
13. BABAI L., "Automorphism groups, isomorphism, reconstruction", Handbook of Combinatorics, Chapter 27, p. 1447-1551, MIT Press, 1996.
14. BACKOFEN R., WILL S., "Excluding symmetries in constraint based search", Proceedings of CP'99, p. 73-87, 1999.
15. BACCHUS F., "Extending Forward Checking", Proceedings of CP'00, p. 35-51, 2000.
16. BACCHUS F., CHEN X., VAN BEEK P., WALSH T., "Binary versus non binary constraints", Artificial Intelligence, vol. 140, num. 1-2, p. 1-37, 2002.
17. BACKOFEN R., WILL S., "Excluding symmetries in constraint based search", Constraints, vol. 7, num. 3-4, p. 333-349, 2002.
18. BAKER R., DIKKER F., F.TEMPELMAN, WOGNUM P., "Diagnosing and solving over-determined constraint satisfaction problems", Proceedings of IJCAI'93, p. 276-281, 1993.
19. BAKER A., "The hazards of fancy backtracking", Proceedings of AAAI '94, p. 288- 293, 1994.
20. BALAFOUTIS T., STERGIOU K., "Exploiting constraint weights for revision ordering in arc consistency algorithms", Proceedings of the ECAI-2008 workshop on Modeling and Solving Problems with Constraints, 2008.
21. BALAFOUTIS T., STERGIOU K., "On conflict-driven variable ordering heuristics", Proceedings of CSCLP'08, 2008.
22. DE LA BANDA M. G., STUCKEY P., WAZNY J., "Finding all minimal unsatisfiable subsets", Proceedings of PPDP'03, 2003.
23. BAPTISTA L., LYNCE I., MARQUES-SILVA J., "Complete search restart strategies for satisfiability", Proceedings of SSA'01 workshop held with IJCAI'01, 2001.
24. BARTAK R., ERBEN R., "A new algorithm for singleton arc consistency", Proceedings of FLAIRS'04, p. 257-262, 2004.
25. BAYARDO R., SHRAG R., "Using CSP look-back techniques to solve real-world SAT instances", Proceedings of AAAI'97, p. 203-208, 1997.
26. BEACHAM A., CHEN X., SILLITO J., VAN BEEK P., "Constraint programming lessons learned from crossword puzzles", Proceedings of Canadian Conference on AI, p. 78-87, 2001.
27. BECKWITH A., CHOUEIRY B., ZOU H., "How the level of interchangeability embedded in a finite constraint satisfaction problem affects the performance of search", Proceedings of AI'01, p. 50-61, 2001.
28. BECK J., PROSSER P., WALLACE R., "Variable ordering heuristics show promise", Proceedings of CP'04, p. 711-715, 2004.
29. BEERI C., FAGIN R., MAIER D., YANNAKAKIS M., "On the desirability of acyclic database schemes", Journal of the ACM, vol. 30, num. 3, p. 479-513, 1983.
30. VAN BEEK P., "On the minimality and decomposability of constraint networks", Proceedings of AAAI'92, p. 447-452, 1992.
31. VAN BEEK P., "On the inherent level of local consistency in constraint networks", Proceedings of AAAI'94, p. 368-373, 1994.
32. VAN BEEK P., DECHTER R., "Constraint tightness versus global consistency", Proceedings of KR'94, p. 572-582, 1994.
33. VAN BEEK P., DECHTER R., "On the minimality and global consistency of rowconvex constraint networks", Journal of the ACM, vol. 42, num. 3, p. 543-561, 1995.
34. VAN BEEK P., DECHTER R., "Constraint tightness and looseness versus local and global consistency", Journal of the ACM, vol. 44, num. 4, p. 549-566, 1997.
35. VAN BEEK P., "Backtracking search algorithms", Handbook of Constraint Programming, Chapter 4, p. 85-134, Elsevier, 2006.
36. BELLICHA A., CAPELLE C., HABIB M., KOKéNY T., VILAREM M., "CSP techniques using partial orders on domain values", Proceedings of ECAI'94 workshop on constraint satisfaction issues raised by practical applications, 1994.
37. BELDICEANU N., CARLSSON M., RAMPON J., Global constraint catalog, Report num. T2005-08, Swedish Institute of Computer Science, http://www.emn.fr/x-info/sdemasse/gccat/, 2005-2008.
38. BENSON B., FREUDER E., "Interchangeability preprocessing can improve forward checking search", Proceedings of ECAI'92, p. 28-30, 1992.
39. BENHAMOU B., "Study of symmetry in constraint satisfaction problems", Proceedings of CP'94, p. 246-254, 1994.
40. BEN-SASSON E., WIGDERSON A., "Short proofs are narrow - resolution made simple", Journal of the ACM, vol. 48, num. 2, p. 149-169, 2001.
41. BENHAMOU B., SAIDI M., "Local symmetry breaking during search in CSPs", Proceedings of CP'07, p. 195-209, 2007.
42. BENNACEUR H., LECOUTRE C., ROUSSEL O., "A decomposition technique for solving Max-CSP", Proceedings of ECAI'08, p. 500-504, 2008.
43. BESSIERE C., "Arc-consistency in dynamic constraint satisfaction problems.", Proceedings of AAAI'91, p. 221-226, 1991.
44. BESSIERE C., "Arc consistency and arc consistency again", Artificial Intelligence, vol. 65, p. 179-190, 1994.
45. BESSIERE C., RéGIN J., "MAC and combined heuristics: two reasons to forsake FC (and CBJ?) on hard problems", Proceedings of CP'96, p. 61-75, 1996.
46. BESSIERE C., RéGIN J., "Arc consistency for general constraint networks: preliminary results", Proceedings of IJCAI'97, p. 398-404, 1997.
47. BESSIERE C., FREUDER E., RéGIN J., "Using constraint metaknowledge to reduce arc consistency computation", Artificial Intelligence, vol. 107, p. 125-148, 1999.
48. BESSIERE C., CHMEISS A., SAIS L., "Neighborhood-based variable ordering heuristics for the constraint satisfaction problem", Proceedings of CP'01, p. 565-569, 2001.
49. BESSIERE C., RéGIN J., "Refining the basic constraint propagation algorithm", Proceedings of IJCAI'01, p. 309-315, 2001.
50. BESSIERE C., MESEGUER P., FREUDER E., LARROSA J., "On Forward Checking for non-binary constraint satisfaction", Artificial Intelligence, vol. 141, p. 205-224, 2002.
51. BESSIERE C., DEBRUYNE R., "Optimal and suboptimal singleton arc consistency algorithms", Proceedings of CP'04 workshop on constraint propagation and implementation, p. 17-27, 2004.
52. BESSIERE C., DEBRUYNE R., "Theoretical analysis of singleton arc consistency", Proceedings of ECAI'04 workshop on modelling and solving problems with constraints, p. 20-29, 2004.
53. BESSIERE C., COLETTA R., PETIT T., "Apprentissage de contraintes globales implicites", Proceedings of JFPC'05, p. 249-258, 2005.
54. BESSIERE C., DEBRUYNE R., "Optimal and suboptimal singleton arc consistency algorithms", Proceedings of IJCAI'05, p. 54-59, 2005.
55. BESSIERE C., RéGIN J., YAP R., ZHANG Y., "An optimal coarse-grained arc consistency algorithm", Artificial Intelligence, vol. 165, num. 2, p. 165-185, 2005.
56. BESSIERE C., "Constraint propagation", Handbook of Constraint Programming, Chapter 3, Elsevier, 2006.
57. BESSIERE C., DEBRUYNE R., "Theoretical analysis of singleton arc consistency and its extensions", Artificial Intelligence, vol. 172, num. 1, p. 29-41, 2008.
58. BESSIERE C., PETIT T., ZANUTTINI B., "Réordonnancement de domaines dans les réseaux de contraintes", Proceedings of JFPC'08, p. 133-142, 2008.
59. BESSIERE C., STERGIOU K., WALSH T., "Domain filtering consistencies for nonbinary constraints", Artificial Intelligence, vol. 72, num. 6-7, p. 800-822, 2008.
60. BITNER J., REINGOLD E., "Backtrack programming techniques", Communications of the ACM, vol. 18, num. 11, p. 651-656, 1975.
61. BLIEK C., Wordwise algorithms and improved heuristics for solving hard constraint satisfaction problems, Report num. 12-96-R045, ERCIM, 1996.
62. BLIEK C., SAM-HAROUD D., "Generalizing partial order and dynamic backtracking", Proceedings of AAAI'98, p. 319-325, 1998.
63. BLIEK C., SAM-HAROUD D., "Path consistency on triangulated constraint graphs", Proceedings of IJCAI'99, p. 456-461, 1999.
64. BORDEAUX L., MONFROY E., BENHAMOU F., "Improved bounds on the complexity of kB-consistency", Proceedings of IJCAI'01, p. 303-308, 2001.
65. BORDEAUX L., CADOLI M., MANCINI T., "Exploiting fixable, removable, and implied values in constraint satisfaction problems", Proceedings of LPAR'04, p. 270-284, 2004.
66. BORDEAUX L., CADOLI M., MANCINI T., "A unifying framework for structural properties of CSPs: definitions, complexity, tractability", Journal of Artificial Intelligence Research, vol. 32, p. 607-629, 2008.
67. BOUSSEMART F., HEMERY F., LECOUTRE C., "Revision ordering heuristics for the constraint satisfaction problem", Proceedings of CPAI'04 workshop held with CP'04, p. 29-43, 2004.
68. BOUSSEMART F., HEMERY F., LECOUTRE C., SAIS L., "Boosting systematic search by weighting constraints", Proceedings of ECAI'04, p. 146-150, 2004.
69. BOUSSEMART F., HEMERY F., LECOUTRE C., SAIS L., "Support inference for generic filtering", Proceedings of CP'04, p. 721-725, 2004.
70. BOUTALEB K., JéGOU P., TERRIOUX C., "(no)good recording and ROBDDs for solving structured (V)CSPs.", Proceedings of ICTAI'06, p. 297-304, 2006.
71. BRELAZ D., "New methods to color the vertices of a graph", Communications of the ACM, vol. 22, p. 251-256, 1979.
72. BRIGGS P., TORCZON L., "An efficient representation for sparse sets", ACM Letters on Programming Languages and Systems, vol. 2, num. 1-4, p. 59-69, 1993.
73. BROWN C., L. FINKELSTEIN P. P., "Backtrack searching in the presence of symmetry", Proceedings of AAECC'88, p. 99-110, 1988.
74. BRUYNOOGHE M., "Solving combinatorial search problems by intelligent backtracking", Information Processing Letters, vol. 12, num. 1, p. 36-39, 1981.
75. BRUYNOOGHE M., PEREIRA L. M., "Deduction revision by intelligent backtracking", Implementations of Prolog, p. 194-215, 1984.
76. BRUNI R., SASSANO A., "Detecting minimaly unsatisfiable subformulae in unsatisfiable SAT instances by means of adaptative core search", Proceedings of SAT'00, 2000.
77. CABON B., DE GIVRY S., LOBJOIS L., SCHIEX T., WARNERS J., "Radio Link Frequency Assignment", Constraints, vol. 4, num. 1, p. 79-89, 1999.
78. CAMBAZARD H., JUSSIEN N., "Identifying and exploiting problem structures using explanation-based constraint programming", Constraints, vol. 11, num. 4, p. 295- 313, 2006.
79. CAMBAZARD H., O'SULLIVAN B., "Reformulating positive table constraints using functional dependencies", Proceedings of CP'08, p. 418-432, 2008.
80. CARLIER J., PINSON E., "Adjustments of heads and tails for the job-shop problem", European Journal of Operational Research, vol. 78, p. 146-161, 1994.
81. CARLSSON M., BELDICEANU N., Revisiting the lexicographic ordering constraint, Report num. T2002-17, Swedish Institute of Computer Science, 2002.
82. CARLSSON M., "Filtering for the case constraint", 2006, Talk given at the advanced school on global constraints.
83. CHEESEMAN P., KANEFSKY B., TAYLOR W., "Where the really hard problems are", Proceedings of IJCAI'91, p. 331-337, 1991.
84. CHEN X., VAN BEEK P., "Conflict-directed backjumping revisited", Journal of Artificial Intelligence Research, vol. 14, p. 53-81, 2001.
85. CHENG K., YAP R., "Maintaining generalized arc consistency on ad hoc n-ary Boolean constraints", Proceedings of ECAI'06, p. 78-82, 2006.
86. CHENG K., YAP R., "Maintaining generalized arc consistency on ad hoc r-ary constraints", Proceedings of CP'08, p. 509-523, 2008.
87. CHENG K., YAP R., "An overview of mddc-solve", Proceedings of the third constraint solver competition, p. 3-7, 2008.
88. CHMEISS A., JéGOU P., Partial and global path consistency revisited, Report num. 120.95, L.I.M., 1995.
89. CHMEISS A., "Sur la consistance de chemin et ses formes partielles", Proceedings of RFIA'96, p. 212-219, 1996.
90. CHMEISS A., JéGOU P., "Efficient path-consistency propagation", International Journal on Artificial Intelligence Tools, vol. 7, num. 2, p. 121-142, 1998.
91. CHMEISS A., SAIS L., "About the use of local consistency in solving CSPs", Proceedings of ICTAI'00, p. 104-107, 2000.
92. CHMEISS A., JéGOU P., KEDDAR L., "On a generalization of triangulated graphs for domains decomposition of CSPs", Proceedings of IJCAI'03, p. 203-208, 2003.
93. CHOUEIRY B., FALTINGS B., WEIGEL R., "Abstraction by interchangeability in resource allocation", Proceedings of IJCAI'95, p. 1694-1710, 1995.
94. CHOUEIRY B., NOUBIR G., "On the computation of local interchangeability in discrete constraint satisfaction problems", Proceedings of AAAI'98, p. 326-333, 1998.
95. CHOI C., HENZ M., NG K., "Components for state restoration in tree search", Proceedings of CP'01, p. 240-255, 2001.
96. CHOUEIRY B., DAVIS A., "Dynamic bundling: Less effort for more solutions", Proceedings of SARA'02, p. 64-82, 2002.
97. COHEN D., "A new class of binary CSPs for which arc-consistency is a decision procedure", Proceedings of CP'03, p. 807-811, 2003.
98. COHEN D., JEAVONS P., "Tractable constraint languages", Constraint Processing, Chapter 11, p. 299-331, Morgan Kaufmann, 2003.
99. COHEN D., JEAVONS P., JEFFERSON C., PETRIE K., SMITH B., "Symmetry definitions for constraint satisfaction problems", Constraints, vol. 11, num. 2-3, p. 115- 137, 2006.
100. COOPER M., "Characterising tractable constraints", Artificial Intelligence, vol. 41, num. 1, p. 89-95, 1989.
101. COOPER M., COHEN D., JEAVONS P., "Characterising tractable constraints", Artificial Intelligence, vol. 65, p. 347-361, 1994.
102. COOPER M., "Fundamental properties of neighbourhood substitution in constraint satisfaction problems", Artificial Intelligence, vol. 90, p. 1-24, 1997.
103. COOPER M., JEAVONS P., SALAMON A., "Hybrid tractable CSPs which generalize tree structure", Proceedings of ECAI'08, p. 530-534, 2008.
104. CORMEN T., LEISERSON C., RIVEST R., STEIN C., Introduction to Algorithms, MIT Press, 2001.
105. CORREIA M., BAROHONA P., "On the integration of singleton consistency and look-ahead heuristics", Proceedings of CSCLP'07, p. 62-75, 2007.
106. COVER T., THOMAS J., Elements of information theory, Wiley-Interscience, 2006.
107. CRAWFORD J., "A theoretical analysis of reasoning by symmetry in first-order logic", Proceedings of the workshop on Tractable Reasoning, held with AAAI'92, p. 17-22, 1992.
108. CRAWFORD J., GINSBERG M., LUKS E., ROY A., "Symmetry-breaking predicates for search problems", Proceedings of KR'96, p. 148-159, 1996.
109. CRUCITTIA P., LATORAB V., MARCHIORIC M., RAPISARDAB A., "Error and attack tolerance of complex networks", Physica A, vol. 340, p. 388-394, 2004.
110. DARGA P., LIFFITON M., SAKALLAH K., MARKOV I., "Exploiting structure in symmetry generation for CNF", Proceedings of DAC'04, p. 530-534, 2004.
111. DAVIS M., LOGEMANN G., LOVELAND D., "A machine program for theoremproving", Communication of the ACM, vol. 5, num. 7, p. 394-397, 1962.
112. DEBRUYNE R., BESSIERE C., "From restricted path consistency to max-restricted path consistency", Proceedings of CP'97, p. 312-326, 1997.
113. DEBRUYNE R., BESSIERE C., "Some practical filtering techniques for the constraint satisfaction problem", Proceedings of IJCAI'97, p. 412-417, 1997.
114. DEBRUYNE R., Consistances locales pour les problèmes de satisfaction de contraintes de grande taille, PhD thesis, Universite Montpellier II, 1998.
115. DEBRUYNE R., "A strong local consistency for constraint satisfaction", Proceedings of ICTAI'99, p. 202-209, 1999.
116. DEBRUYNE R., BESSIERE C., "Domain filtering consistencies", Journal of Artificial Intelligence Research, vol. 14, p. 205-230, 2001.
117. DECHTER R., PEARL J., "Network-based heuristics for constraint satisfaction problems", Artificial Intelligence, vol. 34, num. 1, p. 1-38, 1988.
118. DECHTER R., MEIRI I., "Experimental evaluation of preprocessing techniques in constraint satisfaction problems", Proceedings of IJCAI'89, p. 271-277, 1989.
119. DECHTER R., PEARL J., "Tree clustering for constraint networks", Artificial Intelligence, vol. 38, num. 3, p. 353-366, 1989.
120. DECHTER R., "Enhancement schemes for constraint processing: backjumping, learning and cutset decomposition", Artificial Intelligence, vol. 41, p. 273-312, 1990.
121. DECHTER R., "Constraint networks", Encyclopedia of Artificial Intelligence, p. 276-285, Wiley, 1992.
122. DECHTER R., "From local to global consistency", Artificial Intelligence, vol. 55, num. 1, p. 87-108, 1992.
123. DECHTER R., VAN BEEK P., "Local and global relational consistency", Theoretical Computer Science, vol. 173, num. 1, p. 283-308, 1997.
124. DECHTER R., FROST D., "Backjump-based backtracking for constraint satisfaction problems", Artificial Intelligence, vol. 136, p. 147-188, 2002.
125. DECHTER R., Constraint Processing, Morgan Kaufmann, 2003.
126. DECHTER R., "Tractable structures for CSPs", Handbook of Constraint Programming, Chapter 7, p. 209-244, Elsevier, 2006.
127. DEVILLE Y., BARETTE O., VAN HENTENRYCK P., "Constraint satisfaction over connected row-convex constraints", Artificial Intelligence, vol. 109, p. 243-271, 1999.
128. VAN DONGEN M., "AC3d an efficient arc consistency algorithm with a low space complexity", Proceedings of CP'02, p. 755-760, 2002.
129. VAN DONGEN M., "Beyond singleton arc consistency", Proceedings of ECAI'06, p. 163-167, 2006.
130. DOYLE J., "A truth maintenance system", Artificial Intelligence, vol. 12, num. 3, p. 231-272, 1979.
131. EéN N., SORENSSON N., "An extensible SAT-solver", Proceedings of SAT'03, 2003.
132. EIDENBERG C., FALTINGS B., "Using the breakout algorithm to identify hard and unsolvable subproblems", Proceedings of CP'03, p. 822-826, 2003.
133. ERDOS P., RENYI A., "On random graphs", Publicationes Mathematicae, vol. 6, p. 290-297, 1959.
134. FAHLE T., SCHAMBERGER S., SELLMAN M., "Symmetry breaking", Proceedings of CP'01, p. 93-107, 2001.
135. FLENER P., FRISCH A., HNICH B., KIZILTAN Z.,MIGUEL I., PEARSON J.,WALSH T., "Breaking row and column symmetries in matrix models", Proceedings of CP'02, p. 462-476, 2002.
136. FLENER P., PEARSON J., SELLMANN M., VAN HENTENRYCK P., "Static and dynamic structural symmetry breaking", Proceedings of CP'06, p. 695-699, 2006.
137. FOCACCI F., MILANO M., "Global cut framework for removing symmetries", Proceedings of CP'01, p. 77-92, 2001.
138. FREDKIN E., "Trie memory", Communications of the ACM, vol. 3, num. 9, p. 490- 499, 1960.
139. FREUDER E., "Synthesizing constraint expressions", Communication of the ACM, vol. 21, num. 11, p. 958-965, 1978.
140. FREUDER E., "A sufficient condition for backtrack-free search", Journal of the ACM, vol. 29, num. 1, p. 24-32, 1982.
141. FREUDER E., "A sufficient condition for backtrack-bounded search", Journal of the ACM, vol. 32, num. 4, p. 755-761, 1985.
142. FREUDER E., QUINN M., "Taking advantage of stable sets of variables in constraint satisfaction problems", Proceedings of IJCAI'85, p. 1076-1078, 1985.
143. FREUDER E., "Eliminating interchangeable values in constraint satisfaction problems", Proceedings of AAAI'91, p. 227-233, 1991.
144. FREUDER E., HUBBE P., "Using inferred disjunctive constraints to decompose constraint satisfaction problems", Proceedings of IJCAI'93, p. 254-261, 1993.
145. FREUDER E., ELFE C., "Neighborhood inverse consistency preprocessing", Proceedings of AAAI'96, p. 202-208, 1996.
146. FREUDER E., SABIN D., "Interchangeability supports abstraction and reformulation for multi-dimensional constraint satisfaction", Proceedings of AAAI'97, p. 191-196, 1997.
147. FREUDER E., MACKWORTH A., "Constraint satisfaction: an emerging paradigm", Handbook of Constraint Programming, Chapter 2, Elsevier, 2006.
148. FRISCH A., HNICH B., KIZILTAN Z., MIGUEL I., WALSH T., "Global constraints for lexicographic orderings", Proceedings of CP'02, p. 93-108, 2002.
149. FRISCH A., MIGUEL I., WALSH T., "CGRASS: A system for transforming constraint satisfaction problems", Proceedings of CSCLP'02, p. 23-36, 2002.
150. FRIEZE A.,MOLLOY M., "The satisfiability threshold for randomly generated binary constraint satisfaction problems", Proceedings of Random'03, p. 275-289, 2003.
151. FRISCH A., HNICH B., KIZILTAN Z., MIGUEL I., WALSH T., "Propagation algorithms for lexicographic ordering constraints", Artificial Intelligence, vol. 170, num. 10, p. 803-834, 2006.
152. FROST D., DECHTER R., "Dead-end driven learning", Proceedings of AAAI'94, p. 294-300, 1994.
153. FROST D., DECHTER R., "Look-ahead value ordering for constraint satisfaction problems", Proceedings of IJCAI'95, p. 572-578, 1995.
154. FUKUNAGA A., "Complete restart strategies using a compact representation of the explored search space", Proceedings of SSA'03 workshop held with IJCAI'03, 2003.
155. GAO Y., CULBERSON J., "Consistency and random constraint satisfaction models with a high constraint tightness", Proceedings of CP'04, p. 17-31, 2004.
156. GASCHNIG J., "A constraint satisfaction method for inference making", Proceedings of the 12th Annual Allerton Conference on Circuit and System Theory, p. 866- 874, 1974.
157. GASCHNIG J., "Experimental case studies of backtrack vs. Waltz-type vs. new algorithms for satisficing assignment problems", Proceedings of the second Canadian Conference on Artificial Intelligence, p. 268-277, 1978.
158. GASCHNIG J., Performance measurement and analysis of search algorithms, Report num. CMU-CS-79-124, Carnegie Mellon, 1979.
159. GAUR D., JACKSON W., HAVENS W., "Detecting unsatisfiable CSPs by coloring the micro-structure", Proceedings of AAAI'97, p. 215-220, 1997.
160. GEELEN P., "Dual viewpoint heuristics for binary constraint satisfaction problems", Proceedings of ECAI'92, p. 31-35, 1992.
161. GENT I., WALSH T., "Easy problems are sometimes hard", Artificial Intelligence, vol. 70, num. 1-2, p. 335-345, 1994.
162. GENT I., MACINTYRE E., PROSSER P., SMITH B., WALSH T., "An empirical study of dynamic variable ordering heuristics for the constraint satisfaction problem", Proceedings of CP'96, p. 179-193, 1996.
163. GENT I., MACINTYRE E., PROSSER P., WALSH T., "The Constrainedness of Search", Proceedings of AAAI-96, p. 246-252, 1996.
164. GENT I., HOOS H., PROSSER P., WALSH T., "Morphing: Combining structure and randomness", Proceedings of AAAI'99, p. 654-660, 1999.
165. GENT I., SMITH B., "Symmetry breaking during search", Proceedings of ECAI'00, p. 599-603, 2000.
166. GENT I.,MACINTYRE E., PROSSER P., SMITH B.,WALSH T., "Random constraint satisfaction: flaws and structure", Constraints, vol. 6, num. 4, p. 345-372, 2001.
167. GENT I., "Arc consistency in SAT", Proceedings of ECAI'02, p. 121-125, 2002.
168. GENT I., HARVEY W., KELSEY T., "Groups and constraints: Symmetry breaking during search", Proceedings of CP'02, p. 415-430, 2002.
169. GENT I., HARVEY W., KELSEY T., LINTON S., "Generic SBDD using computational group theory", Proceedings of CP'03, p. 333-347, 2003.
170. GENT I., JEFFERSON C., MIGUEL I., "Minion: A fast, scalable constraint solver", Proceedings of ECAI'06, p. 98-102, 2006.
171. GENT I., JEFFERSON C., MIGUEL I., "Watched literals for constraint propagation in minion", Proceedings of CP'06, p. 182-197, 2006.
172. GENT I., PETRIE K., PUGET J., "Symmetry in constraint programming", Handbook of Constraint Programming, Chapter 10, p. 329-376, Elsevier, 2006.
173. GENT I., JEFFERSON C., MIGUEL I., NIGHTINGALE P., "Data structures for generalised arc consistency for extensional constraints", Proceedings of AAAI'07, p. 191- 197, 2007.
174. GINSBERG M., FRANK M., HALPIN M., TORRANCE M., "Search lessons learned from crossword puzzles", Proceedings of AAAI'90, p. 210-215, 1990.
175. GINSBERG M., "Dynamic backtracking", Journal of Artificial Intelligence Research, vol. 1, p. 25-46, 1993.
176. GINSBERG M., MCALLESTER D., "GSAT and dynamic backtracking", Proceedings of KR'94, p. 226-237, 1994.
177. DE GIVRY S., SCHIEX T., VERFAILLIE G., "Exploiting tree decomposition and soft local consistency in weighted CSP", Proceedings of AAAI'06, 2006.
178. GOLOMB S., BAUMERT L., "Backtrack programming", Journal of the ACM, vol. 12, num. 4, p. 516-524, 1965.
179. GOMES C., SELMAN B., CRATO N., "Heavy-tailed probability distributions in combinatorial search", Proceedings of CP'97, p. 121-135, 1997.
180. GOMES C., SELMAN B., KAUTZ H., "Boosting combinatorial search through randomization.", Proceedings of AAAI'98, p. 431-437, 1998.
181. GOMES C., SELMAN B., CRATO N., KAUTZ H., "Heavy-tailed phenomena in satisfiability and constraint satisfaction problems", Journal of Automated Reasoning, vol. 24, p. 67-100, 2000.
182. GOMES C., SHMOYS D., "Completing quasigroups or latin squares: a structured graph coloring problem", Proceedings of Computational Symposium on Graph Coloring and Generalization, 2002.
183. GOMES C., FERNáNDEZ C., SELMAN B., BESSIERE C., "Statistical regimes across constrainedness regions", Proceedings of CP'04, p. 32-46, 2004.
184. GOMES C., WALSH T., "Randomness and structure", Handbook of Constraint Programming, Chapter 18, p. 639-664, Elsevier, 2006.
185. GOODMAN N., SHMUELI O., "Syntactic characterization of tree database schemas", Journal of the ACM, vol. 30, num. 4, p. 767-786, 1983.
186. GOTTLOB G., LEONE N., SCARCELLO F., "A comparison of structural CSP decomposition methods", Artificial Intelligence, vol. 124, p. 243-282, 2000.
187. GOTTLOB G., LEONE N., SCARCELLO F., "The complexity of acyclic conjunctive queries", Journal of the ACM, vol. 43, num. 3, p. 431-498, 2001.
188. GOTTLOB G., LEONE N., SCARCELLO F., "Hypertree decompositions and tractable queries", Journal of Computer and System Sciences, vol. 64, num. 3, p. 579-627, 2002.
189. GREENBLATT R., EASTLAKE D., CROCKER S., "The Greenblatt chess program", Proceedings of the Fall Joint Computer Conference, p. 801-810, 1967.
190. GREGOIRE E., MAZURE B., PIETTE C., "Extracting MUSes", Proceedings of ECAI'06, p. 387-391, 2006.
191. GREGOIRE E., MAZURE B., PIETTE C., "MUST: Provide a finer-grained explanation of unsatisfiability", Proceedings of CP'07, p. 317-331, 2007.
192. GREEN M., COHEN D., "Domain permutation reduction for constraint satisfaction problems", Artificial Intelligence, vol. 172, p. 1094-1118, 2008.
193. GRIMES D., WALLACE R., "Learning to identify global bottlenecks in constraint satisfaction search", Proceedings of FLAIRS'07, 2007.
194. GYSSENS M., JEAVONS P., COHEN D., "Decomposing constraint satisfaction problems using database techniques", Artificial Intelligence, vol. 66, num. 1, p. 57-89, 1994.
195. HADZIC T., HANSEN E., O'SULLIVAN B., "On automata, MDDs and BDDs in constraint satisfaction", Proceedings of ECAI'08 Workshop on Inference Methods Based on Graphical Structures of Knowledge, 2008.
196. HAN C., LEE C., "Comments on Mohr and Henderson's path consistency", Artificial Intelligence, vol. 36, p. 125-130, 1988.
197. HAN B., LEE S.-J., "Deriving minimal conflict sets by cs-trees with mark set in diagnosis from first principles", IEEE Tansactions on Systems, Man and Cybernetics, vol. 29, num. 2, p. 281-286, 1999.
198. HART P., NILSSON N., RAPHAEL B., "A formal basis for the heuristic determination of minimum cost paths", IEEE Transactions on Systems Science and Cybernetics, vol. 4, num. 2, p. 100-107, 1968.
199. HART P., NILSSON N., RAPHAEL B., "Correction to "a formal basis for the heuristic determination of minimum cost paths"", SIGART Newsletter, vol. 37, p. 28-29, 1972.
200. HARALICK R., ELLIOTT G., "Increasing tree search efficiency for constraint satisfaction problems", Artificial Intelligence, vol. 14, p. 263-313, 1980.
201. HARVEY W., Nonsystematic backtracking search, PhD thesis, Stanford University, 1995.
202. HARVEY W., GINSBERG M., "Limited discrepancy search", Proceedings of IJCAI'95, p. 607-615, 1995.
203. HARVEY W., "Symmetry breaking and the social golfer problem", Proceedings of the workshop on Symmetry in Constraint Satisfaction Problems held with CP'01, p. 9-16, 2001.
204. HASELBOCK A., "Exploiting interchangeabilities in constraint satisfaction problems", Proceedings of IJCAI'93, p. 282-287, 1993.
205. HEBRARD E., "Implementing a constraint solver: a case study", Slides of the workshop of the third international constraint solver competition, http://www.cril. univ-artois.fr/CPAI08, 2008.
206. HEMERY F., LECOUTRE C., SAIS L., BOUSSEMART F., "Extracting MUCs from constraint networks", Proceedings of ECAI'06, p. 113-117, 2006.
207. VAN HENTENRYCK P., DEVILLE Y., TENG C., "A generic arc-consistency algorithm and its specializations", Artificial Intelligence, vol. 57, p. 291-321, 1992.
208. VAN HENTENRYCK P., FLENER P., PEARSON J., AGREN M., "Compositional derivation of symmetries for constraint satisfaction", Proceedings of SARA'05, p. 234-247, 2005.
209. VAN HOEVE W., MILANO M., "Postponing branching decisions", Proceedings of ECAI'04, p. 1105-1106, 2004.
210. VAN HOEVE W., KATRIEL I., "Global constraints", Handbook of Constraint Programming, Chapter 6, p. 169-208, Elsevier, 2006.
211. HOFFMANN J., NEBEL B., "The FF planning system: Fast plan generation through heuristic search", Journal of Artificial Intelligence Research, vol. 14, p. 253-302, 2001.
212. HOGG T., WILLIAMS C., "The hardest constraint problems: A double phase transition", Artificial Intelligence, vol. 69, num. 1-2, p. 359-377, 1994.
213. HOGG T., "Which search problems are random?", Proceedings of AAAI'98, p. 438- 443, 1998.
214. HOOS H., TSANG E., "Local search methods", Handbook of Constraint Programming, Chapter 5, p. 135-167, Elsevier, 2006.
215. HORSCH M., HAVENS W., "An empirical study of probabilistic arc consistency as a variable ordering heuristic", Proceedings of CP'00, p. 525-530, 2000.
216. HULUBEI T., O'SULLIVAN B., "Failure analysis in backtrack search for constraint satisfaction", Proceedings of CP'06, p. 731-735, 2006.
217. HULUBEI T., O'SULLIVAN B., "The impact of search heuristics on heavy-tailed behaviour", Constraints Journal, vol. 11, num. 2-3, p. 159-178, 2006.
218. HWANG J., MITCHELL D., "2-way vs d-way branching for CSP", Proceedings of CP'05, p. 343-357, 2005.
219. INTERIAN Y., "Backdoor sets for random 3-SAT", Proceedings of SAT'03, 2003.
220. JANSSEN P., JéGOU P., NOUGUIER B., VILAREM M., "A filtering process for general constraint-satisfaction problems: achieving pairwise-consistency using an associated binary representation", Proceedings of IEEE Workshop on Tools for Artificial Intelligence, p. 420-427, 1989.
221. JEAVONS P., COHEN D., GYSSENS M., "A unifying framework for tractable constraints", Proceedings of CP'95, p. 276-291, 1995.
222. JEAVONS P., COOPER M., "Tractable constraints on ordered domains", Artificial Intelligence, vol. 79, p. 327-339, 1995.
223. JEAVONS P., COHEN D., COOPER M., "Constraints, consistency and closure", Artificial Intelligence, vol. 101, p. 251-265, 1998.
224. JéGOU P., Contribution à l'étude des problèmes de satisfaction de contraintes, PhD thesis, Université Montpellier II, 1991.
225. JéGOU P., "Decomposition of domains based on the micro-structure of finite constraint-satisfaction problems", Proceedings of AAAI'93, p. 731-736, 1993.
226. JéGOU P., TERRIOUX C., "Hybrid backtracking bounded by tree-decomposition of constraint networks", Artificial Intelligence, vol. 146, num. 1, p. 43-75, 2003.
227. JéGOU P., TERRIOUX C., "Decomposition and Good Recording for Solving Max- CSPs", Proceedings of ECAI'04, p. 196-200, 2004.
228. JéGOU P., NDIAYE S., TERRIOUX C., "A new evaluation of Forward Checking and its consequences on efficiency of tools for decomposition of CSPs", Proceedings of ICTAI'08, p. 486-490, 2008.
229. JéGOU P., NDIAYE S., TERRIOUX C., "Stratégies hybrides pour des décompositions optimales et efficaces", Proceedings of JFPC'09, 2009.
230. JUNKER U., "QuickXplain: conflict detection for abitrary constraint propagation algorithms", Proceedings of IJCAI'01 Workshop on Modelling and Solving Problems with Constraints, p. 75-82, 2001.
231. JUNKER U., "QuickXplain: preferred explanations and relaxations for overconstrained problems", Proceedings of AAAI'04, p. 167-172, 2004.
232. JUSSIEN N., BARICHARD V., "The PaLM system: explanation-based constraint programming", Proceedings of TRICS'00 workshop held with CP'00, p. 118-133, 2000.
233. JUSSIEN N., DEBRUYNE R., BOIZUMAULT P., "Maintaining arc-consistency within dynamic backtracking", Proceedings of CP'00, p. 249-261, 2000.
234. JUSSIEN N., LHOMME O., Unifying search algorithms for CSP, Report num. 02-3- INFO, Ecole des Mines de Nantes, 2002.
235. JUSSIEN N., A to Z of sudoku, ISTE, 2007.
236. KASK K., DECHTER R., GOGATE V., "Counting-based look-ahead schemes for constraint satisfaction", Proceedings of CP'04, p. 317-331, 2004.
237. KATSIRELOS G., BACCHUS F., "Unrestricted nogood recording in CSP search", Proceedings of CP'03, p. 873-877, 2003.
238. KATSIRELOS G., BACCHUS F., "Generalized nogoods in CSPs", Proceedings of AAAI'05, p. 390-396, 2005.
239. KATSIRELOS G., WALSH T., "A compression algorithm for large arity extensional constraints", Proceedings of CP'07, p. 379-393, 2007.
240. KELSEY T., LINTON S., RONEY-DOUGAL C., "New developments in symmetry breaking in search using computational group theory", Proceedings of AISC'04, p. 199- 210, 2004.
241. KILBY P., SLANEY J., THIEBAUX S., WALSH T., "Backbones and backdoors in satisfiability", Proceedings of AAAI'05, p. 1368-1373, 2005.
242. KIROUSIS L., "Fast parallel constraint satisfaction", Artificial Intelligence, vol. 64, num. 1, p. 147-160, 1993.
243. KIZILTAN Z., Symmetry breaking ordering constraints, PhD thesis, Uppsala University, 2004.
244. DE KLEER J., "An assumption-based TMS", Artificial Intelligence, vol. 28, num. 2, p. 127-162, 1986.
245. DE KLEER J., "A comparison of ATMS and CSP techniques", Proceedings of IJCAI'89, p. 290-296, 1989.
246. KNUTH D., "Dancing links", 2000, http://www-csfaculty. stanford.edu/knuth/preprints.html.
247. KORF R., "Depth-first iterative-deepening: An optimal admissible tree search", Artificial Intelligence, vol. 27, num. 1, p. 97-109, 1985.
248. LABURTHE F., ROCHART G., JUSSIEN N., "Evaluer la difficulté d'une grille de sudoku à l'aide d'un modèle contraintes", Proceedings of JFPC'06, p. 239-248, 2006.
249. LAL A., CHOUEIRY B., FREUDER E., "Neighborhood interchangeability and dynamic bundling for non-binary finite CSPs", Proceedings of AAAI'05, p. 397-404, 2005.
250. LANG J., MARQUIS P., "Complexity results for independence and definability in propositional logic", Proceedings of KR'98, p. 356-367, 1998.
251. LAW Y., LEE J., WALSH T., YIP J., "Breaking symmetry of interchangeable variables and values", Proceedings of CP'07, p. 423-437, 2007.
252. LECOUTRE C., BOUSSEMART F., HEMERY F., "Exploiting multidirectionality in coarse-grained arc consistency algorithms", Proceedings of CP'03, p. 480-494, 2003.
253. LECOUTRE C., BOUSSEMART F., HEMERY F., "Implicit random CSPs", Proceedings of ICTAI'03, p. 482-486, 2003.
254. LECOUTRE C., BOUSSEMART F., HEMERY F., "Backjump-based techniques versus conflict-directed heuristics", Proceedings of ICTAI'04, p. 549-557, 2004.
255. LECOUTRE C., CARDON S., "A greedy approach to establish singleton arc consistency", Proceedings of IJCAI'05, p. 199-204, 2005.
256. LECOUTRE C., PROSSER P., "Maintaining singleton arc consistency", Proceedings of CPAI'06 workshop held with CP'06, p. 47-61, 2006.
257. LECOUTRE C., SAIS L., TABARY S., VIDAL V., "Last conflict-based reasoning", Proceedings of ECAI'06, p. 133-137, 2006.
258. LECOUTRE C., SAIS L., VION J., "Using SAT encodings to derive CSP value ordering heuristics", Proceedings of SAT/CP workshop held with CP'06, p. 33-47, 2006.
259. LECOUTRE C., SZYMANEK R., "Generalized arc consistency for positive table constraints", Proceedings of CP'06, p. 284-298, 2006.
260. LECOUTRE C., CARDON S., VION J., "Conservative dual consistency", Proceedings of AAAI'07, p. 237-242, 2007.
261. LECOUTRE C., CARDON S., VION J., "Path consistency by dual consistency", Proceedings of CP'07, p. 438-452, 2007.
262. LECOUTRE C., HEMERY F., "A study of residual supports in arc consistency", Proceedings of IJCAI'07, p. 125-130, 2007.
263. LECOUTRE C., SAIS L., TABARY S., VIDAL V., "Exploiting past and future: Pruning by inconsistent partial state dominance", Proceedings of CP'07, p. 453-467, 2007.
264. LECOUTRE C., SAIS L., TABARY S., VIDAL V., "Nogood recording from restarts", Proceedings of IJCAI'07, p. 131-136, 2007.
265. LECOUTRE C., SAIS L., TABARY S., VIDAL V., "Recording and minimizing nogoods from restarts", Journal on Satisfiability, Boolean Modeling and Computation (JSAT), vol. 1, p. 147-167, 2007.
266. LECOUTRE C., SAIS L., TABARY S., VIDAL V., "Transposition Tables for Constraint Satisfaction", Proceedings of AAAI'07, p. 243-248, 2007.
267. LECOUTRE C., "Optimization of simple tabular reduction for table constraints", Proceedings of CP'08, p. 128-143, 2008.
268. LECOUTRE C., LIKITVIVATANAVONG C., SHANNON S., YAP R., ZHANG Y., "Maintaining arc consistency with multiple residues", Constraint Programming Letters, vol. 2, p. 3-19, 2008.
269. LECOUTRE C., VION J., "Enforcing arc consistency using bitwise operations", Constraint Programming Letters, vol. 2, p. 21-35, 2008.
270. LECOUTRE C., ROUSSEL O., "Failure consistencies for constraint satisfaction", Submission, 2009.
271. LECOUTRE C., SAIS L., TABARY S., VIDAL V., "Reasoning from last conflict(s) in constraint programming", Submitted, 2009.
272. LHOMME O., "Consistency techniques for numeric CSPs", Proceedings of IJCAI'93, p. 232-238, 1993.
273. LHOMME O., "Arc-consistency filtering algorithms for logical combinations of constraints", Proceedings of CPAIOR'04, p. 209-224, 2004.
274. LHOMME O., "Quick shaving", Proceedings of AAAI'05, p. 411-415, 2005.
275. LHOMME O., RéGIN J., "A fast arc consistency algorithm for n-ary constraints", Proceedings of AAAI'05, p. 405-410, 2005.
276. LI L., ALDERSON D., DOYLE J., WILLINGER W., "Towards a theory of scale-free graphs: Definition, properties, and implications", Internet Mathematics, vol. 2, num. 4, p. 431-523, 2005.
277. LIKITVIVATANAVONG C., ZHANG Y., BOWEN J., FREUDER E., "Arc consistency in MAC: a new perspective", Proceedings of CPAI'04 workshop held with CP'04, p. 93-107, 2004.
278. LIKITVIVATANAVONG C., ZHANG Y., SHANNON S., BOWEN J., FREUDER E., "Arc consistency during search", Proceedings of IJCAI'07, p. 137-142, 2007.
279. LUBY M., SINCLAIR A., ZUCKERMAN D., "Optimal speedup of Las Vegas algorithms", Information Processing Letters, vol. 47, num. 4, p. 173-180, 1993.
280. LYNCE I., MARQUES-SILVA J., "Hidden structure in unsatisfiable random 3-SAT: An empirical study", Proceedings of ICTAI'04, p. 246-251, 2004.
281. LYNCE I., MARQUES-SILVA J., "On computing minimum unsatisfiable cores", Proceedings of SAT'04, 2004.
282. MACKWORTH A., "Consistency in networks of relations", Artificial Intelligence, vol. 8, num. 1, p. 99-118, 1977.
283. MACKWORTH A., "On reading sketch maps", Proceedings of IJCAI'77, p. 598- 606, 1977.
284. MAIER D., The theory of relational databases, Computer Science Press, Rockville, MD, 1983.
285. MANCINI T., CADOLI M., "Exploiting functional dependencies in declarative problem specifications", Artificial Intelligence, vol. 171, num. 16-17, p. 985-1010, 2007.
286. MARSLAND T., "Computer chess and search", Encyclopedia of Artificial Intelligence, p. 224-241, J. Wiley & Sons, 1992.
287. MARQUES-SILVA J., SAKALLAH K., Conflict analysis in search algorithms for propositional satisfiability, Report num. RT/4/96, INESC, Lisboa, Portugal, 1996.
288. MARTIN P., SHMOYS D., "A new approach to computing optimal schedules for the job-shop scheduling problem", Proceedings of IPCO'96, p. 389-403, 1996.
289. MARINESCU R., DECHTER R., "Advances in AND/OR Branch-and-Bound Search for Constraint Optimization", Proceedings of the CP'05 Workshop on Preferences and Soft Constraints, 2005.
290. MARINESCU R., DECHTER R., "AND/OR Branch-and-Bound for Graphical Models", Proceedings of IJCAI'05, p. 224-229, 2005.
291. MAUSS J., TATAR M., "Computing minimal conflicts for rich constraint languages", Proceedings of ECAI'02, p. 151-155, 2002.
292. MAZURE B., SAIS L., GREGOIRE E., "Boosting complete techniques thanks to local search methods", Annals of Mathematics and Artificial Intelligence, vol. 22, p. 319- 331, 1998.
293. MCGREGOR J., "Relational consistency algorithms and their application in finding subgraph and graph isomorphisms", Information Sciences, vol. 19, p. 229-250, 1979.
294. MCKAY B., "Practical graph isomorphism", Congressus Numerantium, vol. 30, p. 45-87, 1981.
295. MEARS C., DE LA BANDA M. G., WALLACE M., "On implementing symmetry detection", Forthcoming in Constraints, 2009.
296. MEHTA D., VAN DONGEN M., "Two new lightweight arc consistency algorithms", Proceedings of CPAI'04 workshop held with CP'04, p. 109-123, 2004.
297. MEHTA D., VAN DONGEN M., "Reducing checks and revisions in coarse-grained MAC algorithms", Proceedings of IJCAI'05, p. 236-241, 2005.
298. MEHTA D., VAN DONGEN M., "Static value ordering heuristics for constraint satisfaction problems", Proceedings of CPAI'05 workshop held with CP'05, p. 49-62, 2005.
299. MEHTA D., VAN DONGEN M., "Probabilistic consistency boosts MAC and SAC", Proceedings of IJCAI'07, p. 143-148, 2007.
300. MEHTA D., Augmenting the efficiency of arc consistency algorithms, PhD thesis, National University of Ireland, Cork, 2009.
301. MESEGUER P., TORRAS C., "Exploiting symmetries within constraint satisfaction search", Artificial Intelligence, vol. 129, num. 1-2, p. 133-163, 2001.
302. MINTON S., JOHNSTON M., PHILIPS A., LAIRD P., "Minimizing conflicts: a heuristic repair method for constraint-satisfaction and scheduling problems", Artificial Intelligence, vol. 58, num. 1-3, p. 161-205, 1992.
303. MITCHELL D., "Some random CSPs are hard for resolution", Submitted, 2000.
304. MITCHELL D., "Resolution complexity of random constraints", Proceedings of CP'02, p. 295-309, 2002.
305. MITCHELL D., "Resolution and constraint satisfaction", Proceedings of CP'03, p. 555-569, 2003.
306. MOHR R., HENDERSON T., "Arc and path consistency revisited", Artificial Intelligence, vol. 28, p. 225-233, 1986.
307. MOHR R., MASINI G., "Good old discrete relaxation", Proceedings of ECAI'88, p. 651-656, 1988.
308. MOLLOY M., "Models for random constraint satisfaction problems", SIAM Journal of computing, vol. 32, num. 4, p. 935-949, 2003.
309. MONTANARI U., "Network of constraints: Fundamental properties and applications to picture processing", Information Science, vol. 7, p. 95-132, 1974.
310. MONASSON R., ZECCHINA R., KIRKPATRICK S., SELMAN B., TROYANSKY L., "Determining computational complexity from characteristic phase transitions", Nature, vol. 400, p. 133-137, 1999.
311. MORRIS P., "The breakout method for escaping from local minima", Proceedings of AAAI'93, p. 40-45, 1993.
312. MOSKEWICZ M. W., MADIGAN C. F., ZHAO Y., ZHANG L., MALIK S., "Chaff: Engineering an Efficient SAT Solver", Proceedings of DAC'01, p. 530-535, 2001.
313. NADEL B., "Tree search and arc consistency in constraint satisfaction algorithms", KANAL L., KUMAR V., Eds., Search in Artificial Intelligence, p. 287-342, Springer-Verlag, London, UK, 1988.
314. NAGARAJAN S., GOODWIN S., SATTAR A., "Extending dual arc consistency", International Journal of Pattern Recognition and Artificial Intelligence, vol. 17, num. 5, p. 781-815, 2003.
315. VON NEUMANN J., "Zur theorie der gesellschaftsspiele", Mathematische Annalen, vol. 100, p. 295-320, 1928.
316. NIST, Secure hash standard, National Institute of Standards and Technology, http://csrc.nist.gov/publications/fips/fips180-2/fips180-2.pdf, 2002, FIPS 180-2.
317. NUDEL B., "Consistent-labeling problems and their algorithms: expectedcomplexities and theory based heuristics", Artificial Intelligence, vol. 21, num. 1-2, p. 135- 178, 1983.
318. OH Y., MNEIMNEH M., ANDRAUS Z., SAKALLAH K., MARKOV I., "AMUSE: A minimally-unsatisfiable subformula extractor", Proceedings of DAC'04, p. 518-523, 2004.
319. OSTROWSKI R., GREGOIRE E., MAZURE B., SAIS L., "Recovering and exploiting structural knowledge from CNF formulas", Proceedings of CP'02, p. 185-199, 2002.
320. OUIS S., JUSSIEN N., BOIZUMAULT P., "k-relevant explanations for constraint programming", Proceedings of the workshop on User-Interaction in Constraint Satisfaction (UICS'02) held with CP'02, p. 109-123, 2002.
321. PAPADIMITRIOU C., WOLFE D., "The complexity of facets resolved", Journal of Computer and System Sciences, vol. 37, p. 2-13, 1988.
322. PESANT G., "A filtering algorithm for the stretch constraint", Proceedings of CP'01, p. 183-195, 2001.
323. PESANT G., "A regular language membership constraint for finite sequences of variables", Proceedings of CP'04, p. 482-495, 2004.
324. PETCU A., FALTINGS B., "Applying interchangeability techniques to the distributed breakout algorithm", Proceedings of CP'03, p. 925-929, 2003.
325. PETIT T., BESSIERE C., RéGIN J., "A general conflict-set based framework for partial constraint satisfaction", Proceedings of SOFT'03 workshop held with CP'03, 2003.
326. PHAM D., THORNTON J., SATTAR A., "Building structure into local search for SAT", Proceedings of IJCAI'07, p. 2359-2364, 2007.
327. PINCUS S., KALMAN R., "Not all (possibly) "random" sequences are created equal", National Academy of Sciences of the United States of America, vol. 94, num. 8, p. 3513- 3518, 1997.
328. PIPATSRISAWAT K., DARWICHE A., "A lightweight component caching scheme for satisfiability solvers", Proceedings of SAT'07, p. 294-299, 2007.
329. PRCOVIC N., NEVEU B., "Progressive focusing search", Proceedings of ECAI'02, p. 126-130, 2002.
330. PROSSER P., "Hybrid algorithms for the constraint satisfaction problems", Computational Intelligence, vol. 9, num. 3, p. 268-299, 1993.
331. PROSSER P., MAC-CBJ: maintaining arc consistency with conflict-directed backjumping, Report num. 95/177, Department of Computer Science, University of Strathclyde, 1995.
332. PROSSER P., "An empirical study of phase transitions in binary constraint satisfaction problems", Artificial Intelligence, vol. 81, p. 81-109, 1996.
333. PROSSER P., STERGIOU K., WALSH T., "Singleton consistencies", Proceedings of CP'00, p. 353-368, 2000.
334. PUGET J., "On the satisfiability of symmetrical constrained satisfaction problems", Proceedings of ISMIS'93, p. 475-489, 1993.
335. PUGET J., "The next challenge for CP: Ease of use", Invited Talk at CP-2004, 2004.
336. PUGET J., "Automatic detection of variable and value symmetries", Proceedings of CP'05, p. 475-489, 2005.
337. PUGET J., "Symmetry breaking revisited", Constraints, vol. 10, num. 1, p. 23-46, 2005.
338. PUGET J., "An efficient way of breaking value symmetries", Proceedings of AAAI'06, p. 117-122, 2006.
339. RAMANI A., MARKOV I., "Automatically exploiting symmetries in constraint programming", Proceedings of CSCLP'04, p. 98-112, 2004.
340. RAZGON I., MEISELS A., "Maintaining dominance consistency", Proceedings of CP'03, p. 945-949, 2003.
341. RAZGON I., MEISELS A., "A CSP search algorithm with responsibility sets and kernels", Constraints, vol. 12, num. 2, p. 151-177, 2007.
342. REFALO P., "Impact-based search strategies for constraint programming", Proceedings of CP'04, p. 557-571, 2004.
343. RéGIN J., "AC-*: a configurable, generic and adaptive arc consistency algorithm", Proceedings of CP'05, p. 505-519, 2005.
344. REINEFELD A., MARSLAND T. A., "Enhanced iterative-deepening search", IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 16, num. 7, p. 701-710, 1994.
345. RICHAUD G., CAMBAZARD H., O'SULLIVAN B., JUSSIEN N., "Automata for nogood recording in constraint satisfaction problems", Proceedings of SAT/CP workshop held with CP'06, 2006.
346. RIVEST R., The md5 message-digest algorithm, MIT Laboratory for Computer Science and RSA Data Security, Inc., 1992, Request for Comments 1321.
347. ROBERTSON N., SEYMOUR P., "Graph minors II: Algorithmic aspects of treewidth", Journal of Algorithms, vol. 7, num. 3, p. 309-322, 1986.
348. ROUSSEL O., LECOUTRE C., XML representation of constraint networks: Format XCSP 2.1, Report num. arXiv:0902.2362, CoRR, 2009.
349. ROY P., PACHET F., "Using symmetry of global constraints to speed up the resolution of constraint satisfaction problems", Proceedings of the workshop on non-binary constraints, held with ECAI'98, 1998.
350. RUAN Y., KAUTZ H., HORVITZ E., "The backdoor key: A path to understanding problem hardness", Proceedings of AAAI'04, p. 124-130, 2004.
351. SABIN D., FREUDER E., "Contradicting conventional wisdom in constraint satisfaction", Proceedings of CP'94, p. 10-20, 1994.
352. SABIN D., FREUDER E., "Understanding and improving the MAC algorithm", Proceedings of CP'97, p. 167-181, 1997.
353. SADEH N., SYCARA K., XIONG Y., "Backtracking techniques for the job shop scheduling constraint satisfaction problem", Artificial Intelligence, vol. 76, p. 455-480, 1995.
354. SADEH N., FOX M., "Variable and value ordering heuristics for the job shop scheduling constraint satisfaction problem", Artificial Intelligence, vol. 86, p. 1-41, 1996.
355. SAMARAS N., STERGIOU K., "Binary encodings of non-binary constraint satisfaction problems: algorithms and experimental results", Journal of Artificial Intelligence Research, vol. 24, p. 641-684, 2005.
356. SAMER M., SZEIDER S., "Backdoor trees", Proceedings of AAAI'08, p. 363-368, 2008.
357. SANCHEZ M., DE GIVRY S., SCHIEX T., "Mendelian error detection in complex pedigrees using weighted constraint satisfaction techniques", Constraints Journal, vol. 13, num. 1-2, p. 130-154, 2008.
358. SCHIEX T., VERFAILLIE G., "Nogood recording for static and dynamic constraint satisfaction problems", International Journal of Artificial Intelligence Tools, vol. 3, num. 2, p. 187-207, 1994.
359. SCHIEX T., VERFAILLIE G., "Stubborness: a possible enhancement for backjumping and nogood recording", Proceedings of ECAI'94, p. 165-172, 1994.
360. SCHIEX T., RéGIN J., GASPIN C., VERFAILLIE G., "Lazy arc consistency", Proceedings of AAAI'96, p. 216-221, 1996.
361. SCHULTE C., "Comparing trailing and copying for constraint programming", Proceedings of ICLP'99, p. 275-289, 1999.
362. SCHULTE C., CARLSSON M., "Finite domain constraint programming systems", Handbook of Constraint Programming, Chapter 14, p. 495-526, Elsevier, 2006.
363. SELMAN B., KAUTZ H., "Domain-independent extensions to GSAT: solving large structured satisfiability problems", Proceedings of IJCAI'93, p. 290-295, 1993.
364. SELLMANN M., VAN HENTENRYCK P., "Structural symmetry breaking", Proceedings of IJCAI'05, p. 298-303, 2005.
365. SHANNON C., "A mathematical theory of communication", Bell System Technical Journal, vol. 27, p. 379-423, 1948.
366. SIMONIS H., "Sudoku as a constraint problem", Proceedings of the workshop on modelling and reformulating constraint satisfaction problems held with CP'05, p. 13-27, 2005.
367. SINGH M., "Path consistency revisited", International Journal on Artificial Intelligence Tools, vol. 5, p. 127-141, 1996.
368. DE SIQUEIRA J., PUGET J., "Explanation-based generalisation of failures", Proceedings of ECAI'88, p. 339-344, 1988.
369. SLATE D., ATKIN L., "Chess 4.5: The northwestern university chess program", Chess Skill in Man and Machine, p. 82-118, Springer-Verlag, 1977.
370. SMITH B., GRANT S., "Sparse constraint graphs and exceptionally hard problems", Proceedings of IJCAI'95, p. 646-654, 1995.
371. SMITH B., DYER M., "Locating the phase transition in binary constraint satisfaction problems", Artificial Intelligence, vol. 81, p. 155-181, 1996.
372. SMITH B., "The brelaz heuristic and optimal static orderings", Proceedings of CP'99, Alexandria, VA, p. 405-418, 1999.
373. SMITH B., "Constructing an asymptotic phase transition in random binary constraint satisfaction problems", Theoretical Computer Science, vol. 265, p. 265-283, 2001.
374. SMITH B., STURDY P., "Value ordering for finding all solutions", Proceedings of IJCAI'05, p. 311-316, 2005.
375. SMITH B., "Modelling", Handbook of Constraint Programming, Chapter 11, p. 377- 406, Elsevier, 2006.
376. STALLMAN R., SUSSMAN G., "Forward reasoning and dependency directed backtracking in a system for computer-aided circuit analysis", Artificial Intelligence, vol. 9, p. 135-196, 1977.
377. STEELE G., The definition and implementation of a computer programming language based on constraints, Report num. AI-TR-595, MIT, 1980.
378. STERGIOU K., WALSH T., "Inverse consistencies for non-binary constraints", Proceedings of ECAI'06, p. 153-157, 2006.
379. STERGIOU K., "Strong inverse consistencies for non-binary CSPs", Proceedings of ICTAI'07, p. 215-222, 2007.
380. STERGIOU K., "Heuristics for dynamically adapting propagation", Proceedings of ECAI'08, 2008.
381. SZEIDER S., "Backdoor sets for DLL subsolvers", Journal of Automated Reasoning, vol. 35, num. 1-3, p. 73-88, 2005.
382. SZYMANEK R., O'SULIVAN B., "Guiding search using constraint-level advice", Proceedings of ECAI'06, p. 158-162, 2006.
383. SZYMANEK R., LECOUTRE C., "Constraint-level advice for shaving", Proceedings of ICLP'08, p. 636-650, 2008.
384. TAILLARD E., "Benchmarks for basic scheduling problems", European journal of operations research, vol. 64, p. 278-295, 1993.
385. TEAM T. C., "Choco: an open source Java constraint programming library", Proceedings of the third constraint solver competition, p. 8-14, 2008.
386. THORNTON J., Constraint weighting local search for constraint satisfaction, PhD thesis, Griffith University, Australia, 2000.
387. TSANG E., Foundations of constraint satisfaction, Academic Press, 1993.
388. ULLMANN J., "Parallel recognition of idealised line characters", Kybernetik/Biological Cybernetics, vol. 2, num. 5, p. 221-226, 1965.
389. ULLMANN J., "Associating parts of patterns", Information and Control, vol. 9, num. 6, p. 583-601, 1966.
390. ULLMANN J., "An algorithm for subgraph isomorphism", Journal of the ACM, vol. 23, num. 1, p. 31-42, 1976.
391. ULLMANN J., "A binary n-gram technique for automatic correction of substitution, deletion, insertion and reversal errors in words", Computer Journal, vol. 20, num. 2, p. 141- 147, 1977.
392. ULLMANN J., "Partition search for non-binary constraint satisfaction", Information Science, vol. 177, p. 3639-3678, 2007.
393. VEMPATY N., "Solving constraint satisfaction problems using finite state automata", Proceedings of AAAI'92, p. 453-458, 1992.
394. VERFAILLIE G., SCHIEX T., "Dynamic backtracking for dynamic CSPs", Proceedings of ECAI'94 workshop on constraint satisfaction issues raised by practical applications, 1994.
395. VERFAILLIE G., MARTINEZ D., BESSIERE C., "A generic customizable framework for inverse local consistency", Proceedings of AAAI'99, p. 169-174, 1999.
396. VERROUST F., PRCOVIC N., "Solving partially symmetrical CSPs", Proceedings of the workshop on Symmetry in Constraint Satisfaction Problems held with CP'06, p. 25-30, 2006.
397. VIDAL V., "A lookahead strategy for heuristic search planning", Proceedings of ICAPS'04, p. 150-159, 2004.
398. WALTZ D., Generating semantic descriptions from drawings of scenes with shadows, Report num. AI-TR-271, MIT, 1972.
399. WALTZ D., "Understanding line drawings of scenes with shadows", The Psychology of Computer Vision, p. 19-91, McGraw-Hill, 1975.
400. WALLACE R., FREUDER E., "Ordering heuristics for arc consistency algorithms", Proceedings of AI/GI/VI'92, p. 163-169, 1992.
401. WALLACE R., "Why AC3 is almost always better than AC4 for establishing arc consistency in CSPs", Proceedings of IJCAI'93, p. 239-245, 1993.
402. WALSH T., "Search in a small world", Proceedings of IJCAI'99, p. 1172-1177, 1999.
403. WALSH T., "SAT v CSP", Proceedings of CP'00, p. 441-456, 2000.
404. WALSH T., Relational consistencies, Report num. APES report 28-2001, University of York, 2001.
405. WALLACE R., "Heuristic policy analysis and efficiency assessment in constraint satisfaction search", Proceedings of ICTAI'06, p. 305-314, 2006.
406. WALSH T., "General symmetry breaking constraints", Proceedings of CP'06, p. 650-664, 2006.
407. WALLACE R., GRIMES D., "Experimental studies of variable selection strategies based on constraint weights", Journal of Algorithms, vol. 63, num. 1-3, p. 114-129, 2008.
408. WATTS D., STROGATZ S., "Collective dynamics of 'small-world' networks", Nature, vol. 393, p. 440-442, 1998.
409. WILLIAMS C., HOGG T., "Exploiting the deep structure of constraint problems", Artificial Intelligence, vol. 70, p. 73-117, 1994.
410. WILLIAMS R., GOMES C., SELMAN B., "Backdoors to typical case complexity", Proceedings of IJCAI'03, p. 1173-1178, 2003.
411. WILLIAMS R., GOMES C., SELMAN B., "On the connections between backdoors, restarts, and heavy-tailedness in combinatorial search", Proceedings of SAT'03, 2003.
412. WILSON R., Four Colors Suffice: How the Map Problem Was Solved, Princeton University Press, 2005.
413. World Wide Web Consortium, http://www.w3.org/XML/, Extensible markup language (xml), 1997.
414. XU K., LI W., "Exact phase transitions in random constraint satisfaction problems", Journal of Artificial Intelligence Research, vol. 12, p. 93-103, 2000.
415. XU K., LI W., Many hard examples in exact phase transitions with application to generating hard satisfiable instances, Report num. cs.CC/0302001, CoRR, 2003, Revised version in Theoretical Computer Science, vol. 355, p. 291-302, 2006.
416. XU K., BOUSSEMART F., HEMERY F., LECOUTRE C., "A simple model to generate hard satisfiable instances", Proceedings of IJCAI'05, p. 337-342, 2005.
417. XU K., BOUSSEMART F., HEMERY F., LECOUTRE C., "Random constraint satisfaction: easy generation of hard (satisfiable) instances", Artificial Intelligence, vol. 171, num. 8-9, p. 514-534, 2007.
418. ZABIH R., "Some applications of graph bandwidth to constraint satisfaction problems", Proceedings of AAAI'90, p. 46-51, 1990.
419. ZHANG L., MADIGAN C., MOSKEWICZ M., MALIK S., "Efficient conflict driven learning in a Boolean satisfiability solver", Proceedings of ICCAD'01, p. 279-285, 2001.
420. ZHANG Y., YAP R., "Making AC3 an optimal algorithm", Proceedings of IJCAI'01, p. 316-321, 2001.
421. ZHANG H., "A random jump strategy for combinatorial search", Proceedings of AIandM'02, 2002.
422. ZHANG L., MALIK S., "The quest for efficient Boolean satisfiability solvers", Proceedings of CADE'02, p. 295-313, 2002.
423. ZHANG L., MALIK S., "Extracting small unsatisfiable cores from unsatisfiable Boolean formulas", Proceedings of SAT'03, 2003.
424. ZHANG Y., YAP R., "Consistency and set intersection", Proceedings of IJCAI'03, p. 263-270, 2003.
425. ZHANG Y., YAP R., "Erratum: P. van Beek and R. Dechter's theorem on constraint looseness and local consistency", Journal of the ACM, vol. 50, num. 3, p. 277-279, 2003.
426. ZHANG Y., FREUDER E., "Tractable tree convex constraint networks", Proceedings of AAAI'04, p. 197-203, 2004.
427. ZHANG Y., YAP R., "Set intersection and consistency in constraint networks", Journal of Artificial Intelligence Research, vol. 27, p. 441-464, 2006.
428. ZHANG Y., FREUDER E., "Properties of tree convex constraints", Artificial Intelligence, vol. 172, num. 12-13, p. 1605-1612, 2008.
429. ZOBRIST A. L., A new hashing method with applications for game playing, Report num. 88, Computer Sciences Dept., Univ. of Wisconsin. Reprinted in Int. Computer Chess Association Journal 13(2):169-173 (1990)., 1970.