L. Barto, The Dichotomy for Conservative Constraint Satisfaction Problems Revisited, 2011 IEEE 26th Annual Symposium on Logic in Computer Science, pp.301-310, 2011.
DOI : 10.1109/LICS.2011.25

L. Barto, The collapse of the bounded width hierarchy, Journal of Logic and Computation, vol.26, issue.3, 2015.
DOI : 10.1093/logcom/exu070

J. Berman, P. Idziak, P. Markovi´cmarkovi´c, R. Mckenzie, M. Valeriote et al., Varieties with few subalgebras of powers. Transactions of the, pp.1445-1473, 2010.

C. Christianbessì-ere, E. Carbonnel, G. Hébrard, T. Katsirelos, and . Walsh, Detecting and exploiting subproblem tractability, Proceedings of the Twenty- Third international joint conference on Artificial Intelligence, pp.468-474, 2013.

A. A. Bulatov, Complexity of conservative constraint satisfaction problems, ACM Transactions on Computational Logic, vol.12, issue.4, p.24, 2011.
DOI : 10.1145/1970398.1970400
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.137.9544

A. A. Bulatov, Conservative constraint satisfaction re-revisited. preprint arXiv:1408.3690v1, 2014.
DOI : 10.1016/j.jcss.2015.07.004

C. Carbonnel, The Meta-Problem for Conservative Mal'tsev Constraints, Thirtieth AAAI Conference on Artificial Intelligence (AAAI-16), 2016.
URL : https://hal.archives-ouvertes.fr/hal-01230681

H. Chen and B. Larose, Asking the metaquestions in constraint tractability. arXiv preprint, 2016.

V. Dalmau, Generalized Majority-Minority Operations are Tractable, Logical Methods in Computer Science, vol.2, issue.4, 2006.
DOI : 10.2168/LMCS-2(4:1)2006

T. Feder and M. Y. Vardi, The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory, SIAM Journal on Computing, vol.28, issue.1, pp.57-104, 1998.
DOI : 10.1137/S0097539794266766

J. Martin, D. A. Green, and . Cohen, Domain permutation reduction for constraint satisfaction problems, Artif. Intell, vol.172, issue.8-9, pp.1094-1118, 2008.

M. Pawel, P. Idziak, R. Markovic, M. Mckenzie, R. Valeriote et al., Tractability and learnability arising from algebras with few subpowers, LICS, pp.213-224, 2007.

P. Jeavons, D. A. Cohen, and M. Gyssens, Closure properties of constraints, Journal of the ACM, vol.44, issue.4, pp.527-548, 1997.
DOI : 10.1145/263867.263489
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.50.1628

G. Peter and . Jeavons, On the algebraic structure of combinatorial problems, Theoretical Computer Science, vol.200, pp.185-204, 1998.

R. E. Ladner, On the Structure of Polynomial Time Reducibility, Journal of the ACM, vol.22, issue.1, pp.155-171, 1975.
DOI : 10.1145/321864.321877

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

E. L. Post, The two-valued iterative systems of mathematical logic, Annals Mathematical Studies, vol.5, 1941.
DOI : 10.1515/9781400882366

H. Mark and . Siggers, A strong malcev condition for locally finite varieties omitting the unary type. Algebra universalis, pp.15-20, 2010.

R. Williams, C. P. Gomes, and B. Selman, Backdoors to typical case complexity, IJCAI, pp.1173-1178, 2003.