T. Balafoutis, A. Paparrizou, K. Stergiou, and T. Walsh, New algorithms for max restricted path consistency, Constraints, vol.31, issue.1, pp.372-406, 2011.
DOI : 10.1145/1452044.1452046

URL : http://www.cse.unsw.edu.au/%7Etw/bpswconstraints11.pdf

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, 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.
DOI : 10.1016/j.artint.2005.02.004

URL : https://hal.archives-ouvertes.fr/lirmm-00105310

C. Bessiere, K. Stergiou, and T. Walsh, Domain filtering consistencies for non-binary constraints, Artificial Intelligence, vol.172, issue.6-7, pp.6-7, 2008.
DOI : 10.1016/j.artint.2007.10.016

URL : https://hal.archives-ouvertes.fr/lirmm-00250086

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

R. Debruyne and C. Bessiere, Domain filtering consistencies, Journal of Artificial Intelligence Research, vol.14, pp.205-230, 2001.

R. Debruyne and C. Bessì-ere, Some practicable filtering techniques for the constraint satisfaction problem, In: IJCAI, issue.1, pp.412-417, 1997.

I. Katriel and P. Van-hentenryck, Randomized filtering algorithms, 2006.

M. Sellmann, Approximated Consistency for Knapsack Constraints, pp.679-693, 2003.
DOI : 10.1007/978-3-540-45193-8_46

K. Stergiou, Heuristics for dynamically adapting propagation in constraint satisfaction problems, AI Commun, vol.22, pp.125-141, 2009.