L. Barto and M. Kozik, Robust satisfiability of constraint satisfaction problems, Proceedings of the 44th symposium on Theory of Computing, STOC '12, 2012.
DOI : 10.1145/2213977.2214061

D. Cohen, M. Cooper, and P. Jeavons, Generalising submodularity and horn clauses: Tractable optimization problems defined by tournament pair multimorphisms, Theoretical Computer Science, vol.401, issue.1-3, pp.36-51, 2008.
DOI : 10.1016/j.tcs.2008.03.015

D. Cohen, M. Cooper, P. Jeavons, and A. Krokhin, Supermodular functions and the complexity of MAX CSP, Discrete Applied Mathematics, vol.149, issue.1-3, pp.53-72, 2005.
DOI : 10.1016/j.dam.2005.03.003

D. Cohen, M. Cooper, P. Jeavons, and A. Krokhin, The complexity of soft constraint satisfaction, Artificial Intelligence, vol.170, issue.11, pp.983-1016, 2006.
DOI : 10.1016/j.artint.2006.04.002

D. Cohen, P. Creed, P. Jeavons, and S. , An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection, Proceedings of MFCS-2011, pp.231-242, 2011.
DOI : 10.1007/978-3-642-22993-0_23

C. Martin, Cooper and Stanislav?ivn´yStanislav?Stanislav?ivn´Stanislav?ivn´y Tractable triangles, Proceedings of CP-2011, pp.195-209, 2011.

N. Creignou, A Dichotomy Theorem for Maximum Generalized Satisfiability Problems, Journal of Computer and System Sciences, vol.51, issue.3, pp.511-522, 1995.
DOI : 10.1006/jcss.1995.1087

N. Creignou, S. Khanna, and M. Sudan, Complexity classifications of boolean constraint satisfaction problems, SIAM, 2001.
DOI : 10.1137/1.9780898718546

V. Deineko, P. Jonsson, M. Klasson, and A. Krokhin, The approximability of MAX CSP with fixed-value constraints, Journal of the ACM, vol.55, issue.4, pp.1-37, 2008.
DOI : 10.1145/1391289.1391290

X. Michel, D. P. Goemans, and . Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, J. ACM, vol.42, pp.1115-1145, 1995.

P. Jonsson, M. Klasson, and A. Krokhin, The Approximability of Three-valued MAX CSP, SIAM Journal on Computing, vol.35, issue.6, pp.1329-1349, 2006.
DOI : 10.1137/S009753970444644X

P. Jonsson, F. Kuivinen, and G. Nordh, MAX ONES Generalized to Larger Domains, SIAM Journal on Computing, vol.38, issue.1, pp.329-365, 2008.
DOI : 10.1137/060669231

P. Jonsson, F. Kuivinen, and J. Thapper, Min CSP on Four Elements: Moving beyond Submodularity, Proceedings of CP- 2011, pp.438-453, 2011.
DOI : 10.1007/978-3-642-23786-7_34

P. Jonsson and G. Nordh, Introduction to the Maximum Solution Problem, Complexity of Constraints ? An Overview of Current Research, pp.255-282, 2008.
DOI : 10.1137/0403037

P. Jonsson and J. Thapper, Approximability of the Maximum Solution Problem for Certain Families of Algebras, Proceedings of CSR-2009, pp.215-226, 2009.
DOI : 10.1017/S1446788700029979

S. Khanna, M. Sudan, L. Trevisan, and D. P. Williamson, The Approximability of Constraint Satisfaction Problems, SIAM Journal on Computing, vol.30, issue.6, pp.1863-1920, 2000.
DOI : 10.1137/S0097539799349948

S. Khot, On the Unique Games Conjecture (Invited Survey), 2010 IEEE 25th Annual Conference on Computational Complexity, pp.99-121, 2010.
DOI : 10.1109/CCC.2010.19

V. Kolmogorov and S. , The complexity of conservative valued CSPs, Proceedings of SODA-2012, pp.750-759, 2012.
DOI : 10.1145/2450142.2450146

G. Kun, R. O. Donnell, S. Tamaki, Y. Yoshida, and Y. Zhou, Linear programming, width-1 CSPs, and robust satisfaction, Proceedings of the 3rd Innovations in Theoretical Computer Science Conference on, ITCS '12, pp.484-495, 2012.
DOI : 10.1145/2090236.2090274

P. Raghavendra, Optimal algorithms and inapproximability results for every CSP?, Proceedings of the fourtieth annual ACM symposium on Theory of computing, STOC 08, pp.245-254, 2008.
DOI : 10.1145/1374376.1374414

P. Raghavendra and D. Steurer, How to Round Any CSP, 2009 50th Annual IEEE Symposium on Foundations of Computer Science, pp.586-594, 2009.
DOI : 10.1109/FOCS.2009.74

T. J. Schaefer, The complexity of satisfiability problems, Proceedings of the tenth annual ACM symposium on Theory of computing , STOC '78, pp.216-226, 1978.
DOI : 10.1145/800133.804350

T. Schiex, H. Fargier, and G. Verfaillie, Valued constraint satisfaction problems : Easy and hard problems, Proceedings of IJCAI-1995, pp.631-637, 1995.

J. Thapper and S. , The Power of Linear Programming for Valued CSPs, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, p.2012
DOI : 10.1109/FOCS.2012.25