A. Beacham, X. Chen, J. Sillito, and P. Van-beek, Constraint Programming Lessons Learned from Crossword Puzzles, Proceedings of Canadian Conference on AI, pp.78-87, 2001.
DOI : 10.1007/3-540-45153-6_8
URL : http://doi.org/10.1007/3-540-45153-6_8

C. Bessiere, Constraint Propagation, Handbook of Constraint Programming, 2006.
DOI : 10.1016/S1574-6526(06)80007-6
URL : https://hal.archives-ouvertes.fr/lirmm-00117128

C. Bessiere and R. Debruyne, Optimal and suboptimal singleton arc consistency algorithms, Proceedings of IJCAI'05, pp.54-59, 2005.
URL : https://hal.archives-ouvertes.fr/lirmm-00106097

C. Bessiere, E. Hebrard, B. Hnich, and T. Walsh, The Complexity of Reasoning with Global Constraints, Constraints, vol.1, issue.1???3, pp.239-259, 2007.
DOI : 10.1007/s10601-006-9007-3
URL : https://hal.archives-ouvertes.fr/lirmm-00195881

C. Bessiere and J. Régin, MAC and combined heuristics: Two reasons to forsake FC (and CBJ?) on hard problems, Proceedings of CP'96, pp.61-75, 1996.
DOI : 10.1007/3-540-61551-2_66

C. Bessiere and J. Régin, Arc consistency for general constraint networks: preliminary results, Proceedings of IJCAI'97, pp.398-404, 1997.

C. Bessiere, J. C. Régin, R. Yap, and Y. Zhang, An optimal coarse-grained arc consistency algorithm, Artificial Intelligence, vol.165, issue.2, pp.165-185, 2005.
DOI : 10.1016/j.artint.2005.02.004
URL : https://hal.archives-ouvertes.fr/lirmm-00105310

F. Boussemart, F. Hemery, C. Lecoutre, and L. Sais, Boosting systematic search by weighting constraints, Proceedings of ECAI'04, pp.146-150, 2004.

P. Briggs and L. Torczon, An efficient representation for sparse sets, ACM Letters on Programming Languages and Systems, vol.2, issue.1-4, pp.59-69, 1993.
DOI : 10.1145/176454.176484

M. Carlsson, Filtering for the case constraint Talk given at the advanced school on global constraints, 2006.

K. Cheng and R. Yap, Maintaining generalized arc consistency on ad-hoc n-ary Boolean constraints, Proceedings of ECAI'06, pp.78-82, 2006.

K. Cheng and R. Yap, Maintaining Generalized Arc Consistency on Ad Hoc r-Ary Constraints, Proceedings of CP'08, pp.509-523, 2008.
DOI : 10.1007/978-3-540-85958-1_34

K. Cheng and R. Yap, An MDD-based generalized arc consistency algorithm for positive and negative table constraints and some global constraints, Constraints, vol.177, issue.2???3, pp.265-304, 2010.
DOI : 10.1007/s10601-009-9087-y

R. Dechter, Constraint processing, 2003.

R. Dechter and J. Pearl, Tree clustering for constraint networks, Artificial Intelligence, vol.38, issue.3, pp.353-366, 1989.
DOI : 10.1016/0004-3702(89)90037-4

E. Fredkin, Trie memory, Communications of the ACM, vol.3, issue.9, pp.490-499, 1960.
DOI : 10.1145/367390.367400

I. P. Gent, C. Jefferson, I. Miguel, and P. Nightingale, Data structures for generalised arc consistency for extensional constraints, Proceedings of AAAI'07, pp.191-197, 2007.

M. L. Ginsberg, Dynamic backtracking, Journal of Artificial Intelligence Research, vol.1, pp.25-46, 1993.
DOI : 10.1007/3-540-58601-6_105
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.27.4126

M. L. Ginsberg, M. Frank, M. P. Halpin, and M. C. Torrance, Search lessons learned from crossword puzzles, Proceedings of AAAI'90, pp.210-215, 1990.

M. Gyssens, P. Jeavons, and D. A. Cohen, Decomposing constraint satisfaction problems using database techniques, Artificial Intelligence, vol.66, issue.1, pp.57-89, 1994.
DOI : 10.1016/0004-3702(94)90003-5
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.40.3434

R. M. Haralick and G. L. Elliott, Increasing tree search efficiency for constraint satisfaction problems, Artificial Intelligence, vol.14, issue.3, pp.263-313, 1980.
DOI : 10.1016/0004-3702(80)90051-X

J. Jaffar, S. Michaylov, P. Stuckey, and R. Yap, The CLP(R ) language and system, ACM Transactions on Programming Languages and Systems, vol.14, issue.3, pp.339-395, 1992.
DOI : 10.1145/129393.129398

G. Katsirelos and T. Walsh, A Compression Algorithm for Large Arity Extensional Constraints, Proceedings of CP'07, pp.379-393, 2007.
DOI : 10.1007/978-3-540-74970-7_28

C. Lecoutre, Optimization of Simple Tabular Reduction for Table Constraints, Proceedings of CP'08, pp.128-143, 2008.
DOI : 10.1007/978-3-540-85958-1_9
URL : https://hal.archives-ouvertes.fr/hal-00865292

C. Lecoutre and S. Cardon, A greedy approach to establish singleton arc consistency, Proceedings of IJCAI'05, pp.199-204, 2005.

C. Lecoutre, S. Cardon, and J. Vion, Conservative dual consistency, Proceedings of AAAI'07, pp.237-242, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00194544

C. Lecoutre and F. Hemery, A study of residual supports in arc consistency, Proceedings of IJCAI'07, pp.125-130, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00261267

C. Lecoutre and R. Szymanek, Generalized Arc Consistency for Positive Table Constraints, Proceedings of CP'06, pp.284-298, 2006.
DOI : 10.1007/11889205_22
URL : https://hal.archives-ouvertes.fr/hal-00121127

C. Lecoutre and J. Vion, Enforcing arc consistency using bitwise operations, Constraint Programming Letters, vol.2, pp.21-35, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00868075

O. Lhomme and J. C. Régin, A fast arc consistency algorithm for n-ary constraints, Proceedings of AAAI'05, pp.405-410, 2005.

C. Likitvivatanavong, Y. Zhang, J. Bowen, and E. C. Freuder, Arc consistency in MAC: a new perspective, Proceedings of CPAI'04 workshop held with CP'04, pp.93-107, 2004.

A. K. Mackworth, Consistency in networks of relations, Artificial Intelligence, vol.8, issue.1, pp.99-118, 1977.
DOI : 10.1016/0004-3702(77)90007-8

A. K. Mackworth, On reading sketch maps, Proceedings of IJCAI'77, pp.598-606, 1977.

R. Mohr and G. Masini, Good old discrete relaxation, Proceedings of ECAI'88, pp.651-656, 1988.
URL : https://hal.archives-ouvertes.fr/inria-00548479

G. Pesant, A Regular Language Membership Constraint for Finite Sequences of Variables, Proceedings of CP'04, pp.482-495, 2004.
DOI : 10.1007/978-3-540-30201-8_36

F. Rossi, C. Petrie, and V. Dhar, On the equivalence of constraint satisfaction problems, Proceedings of ECAI'90, pp.550-556, 1990.

D. Sabin and E. C. Freuder, Contradicting conventional wisdom in constraint satisfaction, Proceedings of CP'94, pp.10-20, 1994.
DOI : 10.1007/3-540-58601-6_86

N. Samaras and K. Stergiou, Binary encodings of non-binary constraint satisfaction problems: algorithms and experimental results, Journal of Artificial Intelligence Research, vol.24, pp.641-684, 2005.

K. Stergiou and T. Walsh, Encodings of non-binary constraint satisfaction problems, Proceedings of AAAI'99, pp.163-168, 1999.

J. R. Ullmann, A binary n-gram technique for automatic correction of substitution, deletion, insertion and reversal errors in words, The Computer Journal, vol.20, issue.2, pp.141-147, 1977.
DOI : 10.1093/comjnl/20.2.141

J. R. Ullmann, Partition search for non-binary constraint satisfaction, Information Sciences, vol.177, issue.18, pp.3639-3678, 2007.
DOI : 10.1016/j.ins.2007.03.030

M. R. Van-dongen, Beyond singleton arc consistency, Proceedings of ECAI'06, pp.163-167, 2006.

P. Van-hentenryck and V. Ramachandran, Backtracking without trailing in CLP (RLin), ACM Transactions on Programming Languages and Systems, vol.17, issue.4, pp.635-671, 1995.
DOI : 10.1145/210184.210192

K. Xu, F. Boussemart, F. Hemery, and C. Lecoutre, A simple model to generate hard satisfiable instances, Proceedings of IJCAI'05, pp.337-342, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00396466

K. Xu, F. Boussemart, F. Hemery, and C. Lecoutre, Random constraint satisfaction: Easy generation of hard (satisfiable) instances, Artificial Intelligence, vol.171, issue.8-9, pp.8-9514, 2007.
DOI : 10.1016/j.artint.2007.04.001
URL : https://hal.archives-ouvertes.fr/hal-00191088