A. Balafrej, C. Bessiere, R. Coletta, and E. H. Bouyakhf, Adaptive Parameterized Consistency, Proc. CP 2013, vol.8124, pp.143-158, 2013.
URL : https://hal.archives-ouvertes.fr/lirmm-00839025

C. Bessiere, Handbook of Constraint Programming, chap. Constraint Propagation, pp.29-83, 2006.

C. Bessière, J. C. Régin, R. H. Yap, and Y. Zhang, An Optimal Coarse-Grained Arc Consistency Algorithm, Artificial Intelligence, vol.165, issue.2, pp.165-185, 2005.

C. Bessière, K. Stergiou, and T. Walsh, Domain Filtering Consistencies for NonBinary Constraints, Artificial Intelligence, vol.172, pp.800-822, 2008.

F. Boussemart, F. Hemery, C. Lecoutre, and L. Sais, Boosting Systematic Search by Weighting Constraints, Proc. ECAI, pp.146-150, 2004.

R. Debruyne and C. Bessière, From Restricted Path Consistency to Max-Restricted Path Consistency, Proc. CP 97, vol.1330, pp.312-326, 1997.

D. Geschwender, S. Karakashian, R. Woodward, B. Y. Choueiry, and S. D. Scott, Selecting the Appropriate Consistency Algorithm for CSPs Using Machine Learning Techniques, Proc. of AAAI 2013, pp.1611-1612, 2013.

M. Gyssens, On the Complexity of Join Dependencies, ACM Trans. Database Systems, vol.11, issue.1, pp.81-108, 1986.

R. M. Haralick and G. L. Elliott, Increasing Tree Search Efficiency for Constraint Satisfaction Problems, Artificial Intelligence, vol.14, pp.263-313, 1980.

P. Janssen, P. Jégou, B. Nougier, and M. C. Vilarem, A Filtering Process for General Constraint-Satisfaction Problems: Achieving Pairwise-Consistency Using an Associated Binary Representation, IEEE Workshop on Tools for AI, pp.420-427, 1989.

S. Kadioglu, Y. Malitsky, A. Sabharwal, H. Samulowitz, and M. Sellmann, Algorithm Selection and Scheduling, Proc. CP 2011, vol.6876, pp.454-469, 2011.

S. Karakashian, R. Woodward, C. Reeson, B. Y. Choueiry, and C. Bessiere, A First Practical Algorithm for High Levels of Relational Consistency, Proc. AAAI 2010, pp.101-107, 2010.
URL : https://hal.archives-ouvertes.fr/lirmm-00558132

C. Lecoutre, STR2: Optimized Simple Tabular Reduction for Table Constraints, Constraints, vol.16, issue.4, pp.341-371, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00868225

C. Lecoutre, C. Likitvivatanavong, and R. H. Yap, A Path-Optimal GAC Algorithm for Table Constraints, Proc. of ECAI 2012, pp.510-515, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00873051

C. Lecoutre, A. Paparrizou, and K. Stergiou, Extending STR to a Higher-Order Consistency, Proc. AAAI 2013, pp.576-582, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00875427

A. K. Mackworth, Consistency in Networks of Relations. AI, vol.8, pp.99-118, 1977.

R. Mohr and G. Masini, Good Old Discrete Relaxation, European Conference on Artificial Intelligence (ECAI-88), pp.651-656, 1988.
URL : https://hal.archives-ouvertes.fr/inria-00548479

A. Paparrizou and K. Stergiou, Evaluating Simple Fully Automated Heuristics for Adaptive Constraint Propagation, Proc. of ICTAI 2012, pp.880-885, 2012.

G. Pesant, C. G. Quimper, and A. Zanarini, Counting-Based Search: Branching Heuristics for Constraint Satisfaction Problems, JAIR, vol.43, pp.173-210, 2012.

K. Stergiou, Heuristics for Dynamically Adapting Propagation, Proc. of ECAI, pp.485-489, 2008.

J. R. Ullmann, Partition Search for Non-binary Constraint Satisfaction, Information Sciences, vol.177, issue.18, pp.3639-3678, 2007.

L. Xu, F. Hutter, H. H. Hoos, and K. Leyton-brown, SATzilla: Portfolio-Based Algorithm Selection for SAT, JAIR, vol.32, pp.565-606, 2008.