D. A. Cohen, M. C. Cooper, G. Escamocher, and S. Zivny, Variable Elimination in Binary CSP via Forbidden Patterns, IJCAI 2013, Proceedings of the 23rd International Joint Conference on Artificial Intelligence, pp.517-523, 2013.
DOI : 10.1016/j.jcss.2015.02.001
URL : https://hal.archives-ouvertes.fr/hal-01141616

D. A. Cohen, M. C. Cooper, G. Escamocher, and S. Zivny, Variable and value elimination in binary constraint satisfaction via forbidden patterns, Journal of Computer and System Sciences, vol.81, issue.7, pp.811127-1143, 2015.
DOI : 10.1016/j.jcss.2015.02.001
URL : https://hal.archives-ouvertes.fr/hal-01280349

M. C. Cooper and S. Zivny, The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden Patterns, Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS '16, pp.652-661, 2016.
DOI : 10.1145/2974019
URL : https://hal.archives-ouvertes.fr/hal-01671341

M. C. Cooper, A. Mouelhi, C. Terrioux, and B. Zanuttini, On Broken Triangles, Principles and Practice of Constraint Programming -20th International Conference, CP 2014. Proceedings, pp.9-24, 2014.
DOI : 10.1007/978-3-319-10428-7_5
URL : https://hal.archives-ouvertes.fr/hal-01356058

M. C. Cooper, A. Duchein, A. Mouelhi, G. Escamocher, C. Terrioux et al., Broken triangles: From value merging to a tractable class of general-arity constraint satisfaction problems, Artificial Intelligence, vol.234, pp.196-218, 2016.
DOI : 10.1016/j.artint.2016.02.001
URL : https://hal.archives-ouvertes.fr/hal-01356091

M. C. Cooper, A. Mouelhi, and C. Terrioux, Extending Broken Triangles and Enhanced Value-Merging, Principles and Practice of Constraint Programming -22nd International Conference, CP 2016, Proceedings, pp.173-188, 2016.
DOI : 10.1007/3-540-58601-6_86
URL : https://hal.archives-ouvertes.fr/hal-01475026

M. C. Cooper, P. Jeavons, and A. Salamon, Hybrid tractable CSPs which generalize tree structure, Proceedings of ECAI, pp.530-534, 2008.

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

M. C. Cooper, P. Jégou, and C. Terrioux, A Microstructure-Based Family of Tractable Classes for CSPs, Principles and Practice of Constraint Programming -21st International Conference, CP, 2015, Proceedings, pp.74-88, 2015.
DOI : 10.1007/978-3-319-23219-5_6
URL : https://hal.archives-ouvertes.fr/hal-01343050

A. Dechter and R. Dechter, Removing redundancies in constraint networks, Proceedings of the 6th National Conference on Artificial Intelligence, pp.105-109, 1987.

E. Mouelhi, A. Jégou, P. Terrioux, and C. , Hidden Tractable Classes: From Theory to Practice, 2014 IEEE 26th International Conference on Tools with Artificial Intelligence, pp.437-445, 2014.
DOI : 10.1109/ICTAI.2014.73

E. Mouelhi, A. Jégou, P. Terrioux, and C. , A Hybrid Tractable Class for Non-binary CSPs, 2013 IEEE 25th International Conference on Tools with Artificial Intelligence, pp.383-413, 2015.
DOI : 10.1109/ICTAI.2013.144
URL : https://hal.archives-ouvertes.fr/hal-01479543

E. C. Freuder, Eliminating interchangeable values in constraint satisfaction problems, Proceedings of the 9th National Conference on Artificial Intelligence, pp.227-233, 1991.

P. Jégou and C. Terrioux, The extendable-triple property: A new CSP tractable class beyond BTP, Proceedings of AAAI, pp.3746-3754, 2015.

P. Jégou, Decomposition of Domains Based on the Micro-Structure of Finite Constraint Satisfaction Problems, Proceedings of the 11th National Conference on Artificial Intelligence, pp.731-736, 1993.

C. Likitvivatanavong, Y. , and R. H. , Many-tomany interchangeable sets of values in csps, Proceedings of SAC, pp.86-91, 2013.
DOI : 10.1145/2480362.2480382

A. K. Mackworth, Consistency in networks of relations, Consistency in Networks of Relations, pp.99-118, 1977.
DOI : 10.1016/0004-3702(77)90007-8

U. Montanari, Networks of constraints: Fundamental properties and applications to picture processing, Information Sciences, vol.7, pp.95-132, 1974.
DOI : 10.1016/0020-0255(74)90008-5
URL : http://repository.cmu.edu/cgi/viewcontent.cgi?article=2837&context=compsci

W. Naanaa and W. Naanaa, Unifying and extending hybrid tractable classes of CSPs, Proceedings of the 9th Hellenic Conference on Artificial Intelligence, pp.407-4241, 2013.
DOI : 10.1145/263867.263499