D. A. Cohen, P. Jeavons, C. Jefferson, K. E. Petrie, and B. M. Smith, Symmetry Definitions for Constraint Satisfaction Problems, Constraints, vol.129, issue.2-3, pp.115-137, 2006.
DOI : 10.1007/s10601-006-8059-8
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.377.2244

D. A. Cohen, M. C. Cooper, P. Creed, D. Marx, and A. Z. Salamon, The tractability of CSP classes defined by forbidden patterns, J. Artif. Intell. Res. (JAIR), vol.45, pp.47-78, 2012.

D. A. Cohen, M. C. Cooper, G. Escamocher, and S. Zivny, Variable elimination in binary CSP via forbidden patterns, pp.517-523, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01141616

M. C. Cooper and G. Escamocher, A dichotomy for 2-constraint forbidden CSP patterns, pp.464-470, 2012.

M. C. Cooper, P. G. Jeavons, and A. Z. Salamon, Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination, Artificial Intelligence, vol.174, issue.9-10, pp.9-10, 2010.
DOI : 10.1016/j.artint.2010.03.002
URL : http://doi.org/10.1016/j.artint.2010.03.002

M. C. Cooper, Fundamental properties of neighbourhood substitution in constraint satisfaction problems, Artificial Intelligence, vol.90, issue.1-2, pp.1-24, 1997.
DOI : 10.1016/S0004-3702(96)00018-5

E. C. Freuder, Eliminating interchangeable values in constraint satisfaction problems, Proceedings of AAAI-91, pp.227-233, 1991.

I. P. Gent, K. E. Petrie, and J. Puget, Symmetry in Constraint Programming, Handbook of Constraint Programming, pp.327-374, 2006.
DOI : 10.1016/S1574-6526(06)80014-3
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.66.189

J. Larrosa and R. Dechter, Boosting search with variable elimination in constraint optimization and constraint satisfaction problems, Constraints, vol.8, issue.3, pp.303-326, 2003.
DOI : 10.1023/A:1025627211942

C. Likitvivatanavong and R. H. Yap, Eliminating redundancy in CSPs through merging and subsumption of domain values, ACM SIGAPP Applied Computing Review, vol.13, issue.2, 2013.
DOI : 10.1145/2505420.2505422

S. D. Prestwich, Full Dynamic Substitutability by SAT Encoding, CP 2004, pp.512-526, 2004.
DOI : 10.1007/978-3-540-30201-8_38
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.64.8856