An algebraic characterisation of complexity for valued constraints

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

Volumn 4204 LNCS, Issue , 2006, Pages 107-121

  Cohen, David A ^a   Cooper, Martin C ^b   Jeavons, Peter G ^c  

^a UNIVERSITY OF LONDON   (United Kingdom)

^b IRIT   (France)

^c UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTATIONAL COMPLEXITY; FINITE ELEMENT METHOD; OPTIMIZATION; PROBLEM SOLVING;

CLASSICAL CONSTRAINT SATISFACTION; CONSTRAINT LANGUAGE; DESIRABILITY WEIGHTINGS; OPTIMISATION PROBLEM;

CONSTRAINT THEORY;

EID: 33750366600     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11889205_10     Document Type: Conference Paper

References (33)

1. Anglès d'Auriac, J-Ch., Igloi, F., Preismann, M. & Sebö, A. "Optimal cooperation and submodularity for computing Potts' partition functions with a large number of statistics", J. Physics A: Math. Gen. 35, (2002), pp. 6973-6983.
2. Bistarelli, S., Fargier, H., Montanari, U., Rossi, F., Schiex, T. & Verfaillie, G. "Semiring-based CSPs and valued CSPs: Frameworks, properties and comparison", Constraints 4, (1999), pp. 199-240.
3. Bulatov, A.A. "A dichotomy theorem for constraints on a three-element set", Proc. 43rd IEEE Symposium on Foundations of Computer Science (FOCS'02), (2002), pp. 649-658.
4. Bulatov, A.A., Jeavons, P. & Krokhin, A. "Classifying the complexity of constraints using finite algebras", SIAM Journal on Computing 34, (2005), pp. 720-742.
5. Burkard, R., Klinz, B. & Rudolf, R. "Perspectives of Monge properties in optimization", Discrete Applied Mathematics 70, (1996), pp. 95-161.
6. Cohen, D., Cooper, M.C. & Jeavons, P. "A complete characterisation of complexity for Boolean constraint optimization problems", Proc. 10th Int. Conf. on Principles and Practice of Constraint Programming (CP'04), LNCS 3258, (2004), pp. 212-226.
7. Cohen, D., Cooper, M.C., Jeavons, P. & Krokhin, A. "Soft constraints: complexity and multimorphisms" Proceedings of CP'03, LNCS 2833, (2003), pp. 244-258.
8. Cohen, D., Cooper, M.C., Jeavons, P. & Krokhin, A. "A maximal tractable class of soft constraints" Journal of Artificial Intelligence Research 22, (2004), pp. 1-22.
9. Cohen, D., Cooper, M.C., Jeavons, P. & Krokhin, A. "Supermodular functions and the complexity of Max CSP", Discrete Applied Mathematics, 149 (1-3),(2005), pp. 53-72.
10. Cohen, D., Cooper, M.C., Jeavons, P. & Krokhin, A. "The Complexity of Soft Constraint Satisfaction", Artificial Intelligence, to appear.
11. Creignou, N. "A dichotomy theorem for maximum generalised satisfiability problems", Journal of Computer and Systems Sciences 51(3), (1995), pp. 511-522.
12. Creignou, N., Khanna, S. & Sudan, M. Complexity classification of Boolean constraint satisfaction problems, volume 7 of SIAM Monographs on Discrete Mathematics and Applications, (2001).
13. Cunningham, W.H. "Minimum cuts, modular functions, and matroid polyhedra", Networks 15(2), (1985), pp. 205-215.
14. Feder, T. & Vardi, M.Y. "The computational structure of monotone monadic SNP and constraint satisfaction: a study through datalog and group theory", SIAM Journal on Computing 28(1), (1998), pp. 57-104.
15. Fujishige, S. Submodular Functions and Optimization, 2nd edn., Annals of Discrete Mathematics, Vol. 58, Elsevier, (2005).
16. Garey, M.R. & Johnson, D.S., Computers and Intractability: A guide to the theory of NP-completeness, W.H. Freeman, (1979).
17. Iwata, S. "A fully combinatorial algorithm for submodular function minimization", Journal of Combinatorial Theory, Series B 84(2), (2002), pp. 203-212.
18. Iwata, S., Fleischer, L. & Fujishige, S. "A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions", Journal of the ACM 48(4), (2001), pp. 761-777.
19. Jeavons, P.G. "On the algebraic structure of combinatorial problems", Theoretical Computer Science 200 (1998), pp. 185-204.
20. Jeavons, P.G. "Constructing constraints", Proceedings of CP'98), Lecture Notes in Computer Science 1520, (1998), pp. 2-17.
21. Jeavons, P.G., Cohen D.A. & Gyssens, M. "Closure properties of constraints", Journal of the ACM 44, (1997), pp. 527-548.
22. Jeavons, P.G., Cohen D.A. & Gyssens, M. "How to determine the expressive power of constraints", Constraints, 4, (1999), pp. 113-131.
23. Jonsson, P., Klasson, M. & Krokhin, A. "The approximability of three-valued MAX CSP", SIAM Journal of Computing, 35, (2006), pp. 1329-1349.
24. Nagamochi, H. & Ibaraki, I. "A note on minimizing submodular functions", Information Processing Letters 67, (1998), pp. 239-244.
25. Narayanan, H., Submodular Functions and Electrical Networks, Annals of Discrete Mathematics 54, North Holland (London, New York, Amsterdam), (1997).
26. Narayanan, H. "A note on the minimisation of symmetric and general submodular functions" Discrete Applied Mathematics 131(2), (2003), pp. 513-522.
27. Nemhauser, G.L. & Wolsey, L.A. Integer and Combinatorial Optimisation, Wiley, (1999).
28. Queyranne, M. "Minimising symmetric submodular functions", Mathematical Programming 82(1-2), (1998), pp. 3-12.
29. Schaefer, T.J. "The complexity of satisfiability problems", Proc. 10th ACM Symposium on Theory of Computing (STOC'78), (1978), pp. 216-226.
30. Schrijver, A. "A combinatorial algorithm minimizing submodular functions in strongly polynomial time", J. Combinatorial Theory, Series B, 80, (2000), pp. 346-355.
31. Schrijver, A. Theory of Linear and Integer Programming, Wiley, (1986).
32. Szendrei, A., Clones in Universal Algebra, Seminaires de Mathematiques Superieures, University of Montreal, 99, (1986).
33. Topkis, D. Supermodularity and Complementarity, Princeton University Press, (1998).