An algebraic theory of complexity for valued constraints: Establishing a Galois connection

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6907 LNCS, Issue , 2011, Pages 231-242

  Cohen, David A ^a   Creed, Páidí ^a   Jeavons, Peter G ^b   Živný, Stanislav ^b  

^a UNIVERSITY OF LONDON   (United Kingdom)

^b UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRAIC PROPERTIES; ALGEBRAIC THEORIES; CLOSED SET; CONSTRAINT LANGUAGE; CONSTRAINT PROBLEMS; DISCRETE OPTIMISATION; GALOIS CONNECTION; OBJECTIVE FUNCTIONS; OPTIMISATIONS; RATIONAL NUMBERS; VALUED CONSTRAINT SATISFACTION PROBLEMS;

ALGEBRA; COMPUTER SCIENCE; CONSTRAINT THEORY; COSTS; OPTIMIZATION;

COST FUNCTIONS;

EID: 80052135181     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22993-0_23     Document Type: Conference Paper

References (34)

1. Barto, L., Kozik, M.: Constraint Satisfaction Problems of Bounded Width. In: FOCS 2009, pp. 461-471 (2009)
2. Barto, L., Kozik, M., Maróti, M., Niven, T.: CSP dichotomy for special triads. Proceedings of the American Mathematical Society 137(9), 2921-2934 (2009)
3. Barto, L., Kozik, M., Niven, T.: The CSP dichotomy holds for digraphs with no sources and no sinks. SIAM Journal on Computing 38(5), 1782-1802 (2009)
4. Barto, L.: The dichotomy for conservative constraint satisfaction problems revisited. In: LICS 2011 (2011)
5. Berman, J., Idziak, P., Marković, P., McKenzie, R., Valeriote, M., Willard, R.: Varieties with few subalgebras of powers. Trans. of AMS 362(3), 1445-1473 (2010)
6. Bistarelli, S., Fargier, H., Montanari, U., Rossi, F., Schiex, T., Verfaillie, G.: Semiring-based CSPs and Valued CSPs Constraints 4(3), 199-240 (1999)
7. Bodnarčuk, V., Kalužnin, L., Kotov, V., Romov, B.: Galois theory for Post algebras. I. Cybernetics and Systems Analysis 5(3), 243-252 (1969)
8. Börner, F.: Basics of Galois Connections. In: Creignou, N., Kolaitis, P.G., Vollmer, H. (eds.) Complexity of Constraints. LNCS, vol. 5250, pp. 38-67. Springer, Heidelberg (2008)
9. Bulatov, A.: A Graph of a Relational Structure and Constraint Satisfaction Problems. In: LICS 2004, pp. 448-457 (2004)
10. Bulatov, A.: A dichotomy theorem for constraint satisfaction problems on a 3-element set. Journal of the ACM 53(1), 66-120 (2006)
11. Bulatov, A., Krokhin, A., Jeavons, P.: The complexity of maximal constraint languages. In: STOC 2001, pp. 667-674 (2001)
12. Bulatov, A., Krokhin, A., Jeavons, P.: Classifying the Complexity of Constraints using Finite Algebras. SIAM Journal on Computing 34(3), 720-742 (2005)
13. Bulatov, A.A.: Tractable Conservative Constraint Satisfaction Problems. In: LICS 2003, pp. 321-330 (2003)
14. Cohen, D.A., Cooper, M., Jeavons, P.G., Krokhin, A.A.: Soft constraints: Complexity and multimorphisms. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 244-258. Springer, Heidelberg (2003)
15. Cohen, D.A., Cooper, M.C., Jeavons, P.G.: An algebraic characterisation of complexity for valued constraint. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 107-121. Springer, Heidelberg (2006) (Pubitemid 44618734)
16. Cohen, D.A., Cooper, M.C., Jeavons, P.G.: Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms. Theoretical Computer Science 401(1-3), 36-51 (2008)
17. Cohen, D.A., Cooper, M.C., Jeavons, P.G., Krokhin, A.A.: The Complexity of Soft Constraint Satisfaction. Artificial Intelligence 170(11), 983-1016 (2006)
18. Cohen, D.A., Jeavons, P.G., Živný, S.: The expressive power of valued constraints: Hierarchies and collapses. Theoretical Computer Science 409(1), 137-153 (2008)
19. Creed, P., Živný, S.: On minimal weighted clones. In: CP 2011 (2011)
20. Creignou, N.: A dichotomy theorem for maximum generalized satisfiability problems. Journal of Computer and System Sciences 51(3), 511-522 (1995)
21. Creignou, N., Khanna, S., Sudan, M.: Complexity Classification of Boolean Constraint Satisfaction Problems. SIAM, Philadelphia (2001)
22. Deineko, V., Jonsson, P., Klasson, M., Krokhin, A.: The approximability of Max CSP with fixed-value constraints. Journal of the ACM 55(4) (2008)
23. Feder, T., Vardi, M.: The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory. SIAM Journal on Computing 28(1), 57-104 (1998)
24. Geiger, D.: Closed systems of functions and predicates. Pacific Journal of Mathematics 27(1), 95-100 (1968)
25. Gyssens, M., Jeavons, P., Cohen, D.: Decomposing Constraint Satisfaction Problems Using Database Techniques. Artificial Intelligence 66(1), 57-89 (1994)
26. Jeavons, P.: On the Algebraic Structure of Combinatorial Problems. Theoretical Computer Science 200(1-2), 185-204 (1998)
27. Jeavons, P., Cohen, D., Gyssens, M.: Closure Properties of Constraints. Journal of the ACM 44(4), 527-548 (1997)
28. Jonsson, P., Klasson, M., Krokhin, A.: The Approximability of Three-valued MAX CSP. SIAM Journal on Computing 35(6), 1329-1349 (2006)
29. Kolmogorov, V., Živný, S.: The complexity of conservative finite-valued CSPs, Tech. rep., arXiv:1008.1555 (August 2010)
30. Kolmogorov, V., Živný, S.: Generalising tractable VCSPs defined by symmetric tournament pair multimorphisms, Tech. rep., arXiv:1008.3104 (August 2010)
31. Nemhauser, G., Wolsey, L.: Integer and Combinatorial Optimization. John Wiley & Sons, Chichester (1988)
32. Schaefer, T.: The Complexity of Satisfiability Problems. In: Proceedings of the 10th Annual ACM Symposium on Theory of Computing, STOC 1978, pp. 216-226 (1978)
33. Schrijver, A.: Theory of linear and integer programming. John Wiley & Sons, Inc., Chichester (1986)
34. Živný, D.A., Cohen, P.G.: Jeavons, The Expressive Power of Binary Submodular Functions. Discrete Applied Mathematics 157(15), 3347-3358 (2009)