Abstract
Classical constraint satisfaction is concerned with the feasibility of satisfying a collection of constraints. The extension of this framework to include optimisation is now also being investigated and a theory of so-called soft constraints is being developed. In this extended framework, tuples of values allowed by constraints are given desirability weightings, or costs, and the goal is to find the most desirable (or least cost) assignment.
The complexity of any optimisation problem depends critically on the type of function which has to be minimized. For soft constraint problems this function is a sum of cost functions chosen from some fixed set of available cost functions, known as a valued constraint language. We show in this paper that when the costs are rational numbers or infinite the complexity of a soft constraint problem is determined by certain algebraic properties of the valued constraint language, which we call feasibility polymorphisms and fractional polymorphisms.
As an immediate application of these results, we show that the existence of a non-trivial fractional polymorphism is a necessary condition for the tractability of a valued constraint language with rational or infinite costs over any finite domain (assuming P ≠ NP).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Anglès d’Auriac, J.-C., 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, 6973–6983 (2002)
Bistarelli, S., Fargier, H., Montanari, U., Rossi, F., Schiex, T., Verfaillie, G.: Semiring-based CSPs and valued CSPs: Frameworks, properties and comparison. Constraints 4, 199–240 (1999)
Bulatov, A.A.: A dichotomy theorem for constraints on a three-element set. In: Proc. 43rd IEEE Symposium on Foundations of Computer Science (FOCS 2002), pp. 649–658 (2002)
Bulatov, A.A., Jeavons, P., Krokhin, A.: Classifying the complexity of constraints using finite algebras. SIAM Journal on Computing 34, 720–742 (2005)
Burkard, R., Klinz, B., Rudolf, R.: Perspectives of Monge properties in optimization. Discrete Applied Mathematics 70, 95–161 (1996)
Cohen, D., Cooper, M., Jeavons, P.G.: A Complete Characterization of Complexity for Boolean Constraint Optimization Problems. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 212–226. Springer, Heidelberg (2004)
Cohen, D., Cooper, M.C., Jeavons, P., Krokhin, A.: Soft constraints: complexity and multimorphisms. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 244–258. Springer, Heidelberg (2003)
Cohen, D., Cooper, M.C., Jeavons, P., Krokhin, A.: A maximal tractable class of soft constraints. Journal of Artificial Intelligence Research 22, 1–22 (2004)
Cohen, D., Cooper, M.C., Jeavons, P., Krokhin, A.: Supermodular functions and the complexity of Max CSP. Discrete Applied Mathematics 149(1-3), 53–72 (2005)
Cohen, D., Cooper, M.C., Jeavons, P., Krokhin, A.: The Complexity of Soft Constraint Satisfaction. Artificial Intelligence (to appear)
Creignou, N.: A dichotomy theorem for maximum generalised satisfiability problems. Journal of Computer and Systems Sciences 51(3), 511–522 (1995)
Creignou, N., Khanna, S., Sudan, M.: Complexity classification of Boolean constraint satisfaction problems. SIAM Monographs on Discrete Mathematics and Applications, vol. 7 (2001)
Cunningham, W.H.: Minimum cuts, modular functions, and matroid polyhedra. Networks 15(2), 205–215 (1985)
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), 57–104 (1998)
Fujishige, S.: Submodular Functions and Optimization. In: Annals of Discrete Mathematics, 2nd edn., vol. 58. Elsevier, Amsterdam (2005)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A guide to the theory of NP-completeness. W.H. Freeman, New York (1979)
Iwata, S.: A fully combinatorial algorithm for submodular function minimization. Journal of Combinatorial Theory B 84(2), 203–212 (2002)
Iwata, S., Fleischer, L., Fujishige, S.: A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions. Journal of the ACM 48(4), 761–777 (2001)
Jeavons, P.G.: On the algebraic structure of combinatorial problems. Theoretical Computer Science 200, 185–204 (1998)
Jeavons, P.G.: Constructing constraints. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 2–17. Springer, Heidelberg (1998)
Jeavons, P.G., Cohen, D.A., Gyssens, M.: Closure properties of constraints. Journal of the ACM 44, 527–548 (1997)
Jeavons, P.G., Cohen, D.A., Gyssens, M.: How to determine the expressive power of constraints. Constraints 4, 113–131 (1999)
Jonsson, P., Klasson, M., Krokhin, A.: The approximability of three-valued Max CSP. SIAM Journal of Computing 35, 1329–1349 (2006)
Nagamochi, H., Ibaraki, I.: A note on minimizing submodular functions. Information Processing Letters 67, 239–244 (1998)
Narayanan, H.: Submodular Functions and Electrical Networks. Annals of Discrete Mathematics, vol. 54. North-Holland, Amsterdam (1997)
Narayanan, H.: A note on the minimisation of symmetric and general submodular functions. Discrete Applied Mathematics 131(2), 513–522 (2003)
Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimisation. Wiley, Chichester (1999)
Queyranne, M.: Minimising symmetric submodular functions. Mathematical Programming 82(1-2), 3–12 (1998)
Schaefer, T.J.: The complexity of satisfiability problems. In: Proc. 10th ACM Symposium on Theory of Computing (STOC 1978), pp. 216–226 (1978)
Schrijver, A.: A combinatorial algorithm minimizing submodular functions in strongly polynomial time. J. Combinatorial Theory B-80, 346–355 (2000)
Schrijver, A.: Theory of Linear and Integer Programming. Wiley, Chichester (1986)
Szendrei, A.: Clones in Universal Algebra, Seminaires de Mathematiques Superieures, University of Montreal, vol. 99 (1986)
Topkis, D.: Supermodularity and Complementarity. Princeton University Press, Princeton (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cohen, D.A., Cooper, M.C., Jeavons, P.G. (2006). An Algebraic Characterisation of Complexity for Valued Constraint. In: Benhamou, F. (eds) Principles and Practice of Constraint Programming - CP 2006. CP 2006. Lecture Notes in Computer Science, vol 4204. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11889205_10
Download citation
DOI: https://doi.org/10.1007/11889205_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-46267-5
Online ISBN: 978-3-540-46268-2
eBook Packages: Computer ScienceComputer Science (R0)