The expressive power of valued constraints: Hierarchies and collapses

Theoretical Computer Science

Volumn 409, Issue 1, 2008, Pages 137-153

  Cohen, David A ^a   Jeavons, Peter G ^b   Živný, Stanislav ^b  

^a UNIVERSITY OF LONDON   (United Kingdom)

^b UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Expressibility; Feasibility polymorphisms; Fractional polymorphisms; Max closed cost functions; Polymorphisms; Valued constraint satisfaction

Indexed keywords

COST FUNCTIONS;

EXPRESSIBILITY; FEASIBILITY POLYMORPHISMS; FRACTIONAL POLYMORPHISMS; MAX-CLOSED COST FUNCTIONS; VALUED CONSTRAINT SATISFACTION;

POLYMORPHISM;

EID: 55349103368     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2008.08.036     Document Type: Article

References (34)

1. Billionet A., and Minoux M. Maximizing a supermodular pseudo-boolean function: A polynomial algorithm for cubic functions. Discrete Applied Mathematics 12 (1985) 1-11
2. Bistarelli S., Fargier H., Montanari U., Rossi F., Schiex T., and Verfaillie G. Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison. Constraints 4 (1999) 199-240
3. Boehler E., Reith S., Schnoor H., and Vollmer H. Bases for Boolean co-clones. Information Processing Letters 96 (2005) 59-66
4. Boros E., and Hammer P.L. Pseudo-boolean optimization. Discrete Applied Mathematics 123 1-3 (2002) 155-225
5. Bulatov A., Krokhin A., and Jeavons P. Classifying the complexity of constraints using finite algebras. SIAM Journal on Computing 34 3 (2005) 720-742
6. Cohen D., Cooper M., and Jeavons P. An algebraic characterisation of complexity for valued constraints. CP'06. LNCS vol. 4204 (2006)
7. Cohen D., Cooper M., Jeavons P., and Krokhin A. A maximal tractable class of soft constraints. Journal of Artificial Intelligence Research (JAIR) 22 (2004) 1-22
8. Cohen D., Cooper M., Jeavons P., and Krokhin A. The complexity of soft constraint satisfaction. Artificial Intelligence 170 (2006) 983-1016
9. Creignou N., Khanna S., and Sudan M. Complexity Classification of Boolean Constraint Satisfaction Problems. SIAM Monographs on Discrete Mathematics and Applications vol. 7 (2001), SIAM
10. Dechter R. On the expressiveness of networks with hidden variables. AAAI (1990)
11. Dechter R., and Pearl J. Tree clustering for constraint networks. Artificial Intelligence 38 3 (1989) 353-366
12. Denecke K., and Wismath S. Universal Algebra and Applications in Theoretical Computer Science (2002), Chapman and Hall/CRC Press
13. Fearnley A. A strongly rigid binary relation. Acta Universitatis Szegediensis 61 (1995) 35-41
14. Fujishige S. Submodular Functions and Optimization. 2nd ed. Annals of Discrete Mathematics vol. 58 (2005), Elsevier
15. Garey M., and Johnson D. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), Freeman, San Francisco, CA
16. Iwata S. A faster scaling algorithm for minimizing submodular functions. SIAM Journal on Computing 32 (2003) 833-840
17. Iwata S. Submodular function minimization. Mathematical Programming 112 (2008) 45-64
18. Iwata S., Fleischer L., and Fujishige S. A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions. Journal of the ACM 48 (2001) 761-777
19. Jeavons P. On the algebraic structure of combinatorial problems. Theoretical Computer Science 200 (1998) 185-204
20. Jeavons P., Cohen D., and Cooper M. Constraints, consistency and closure. Artificial Intelligence 101 1-2 (1998) 251-265
21. Jeavons P., Cohen D., and Gyssens M. Closure properties of constraints. Journal of the ACM 44 (1997) 527-548
22. Jeavons P., Cohen D., and Gyssens M. How to determine the expressive power of constraints. Constraints 4 (1999) 113-131
23. Jeavons P., and Cooper M. Tractable constraints on ordered domains. Artificial Intelligence 79 2 (1995) 327-339
24. Jégou P. Decomposition of domains based on the micro-structure of finite constraint-satisfaction problems. AAAI (1993)
25. J. Larrosa, R. Dechter, On the dual representation of non-binary semiring-based CSPs, in: Workshop on Soft Constraints, CP'00, 2000
26. Montanari U. Networks of constraints: Fundamental properties and applications to picture processing. Information Sciences 7 (1974) 95-132
27. Narayanan H. Submodular Functions and Electrical Networks (1997), North-Holland, Amsterdam
28. Orlin J.B. A faster strongly polynomial time algorithm for submodular function minimization. IPCO'07. LNCS vol. 4513 (2007)
29. Queyranne M. Minimising symmetric submodular functions. Mathematical Programming 82 (1998) 3-12
30. In: Rossi F., van Beek P., and Walsh T. (Eds). The Handbook of Constraint Programming (2006), Elsevier
31. Schrijver A. A combinatorial algorithm minimizing submodular functions in strongly polynomial time. Journal of Combinatorial Theory, Series B 80 (2000) 346-355
32. Topkis D. Supermodularity and Complementarity (1998), Princeton University Press
33. B. Zanuttini, S. Živný, A note on some collapse results of valued constraints, 2008 (submitted for publication)
34. Živný S., and Jeavons P. Classes of submodular constraints expressible by graph cuts. CP'08. LNCS vol. 5202 (2008)