An Algebraic Characterisation of Complexity for Valued Constraint

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).

[1]  Principles and Practice of Constraint Programming — CP98 , 1999, Lecture Notes in Computer Science.

[2]  Alexander Schrijver,et al.  A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time , 2000, J. Comb. Theory B.

[3]  Sanjeev Khanna,et al.  3. Boolean Constraint Satisfaction Problems , 2001 .

[4]  D. M. Topkis.  Supermodularity and Complementarity , 1998 .

[5]  Thomas J. Schaefer,et al.  The complexity of satisfiability problems , 1978, STOC.

[6]  H. Narayanan.  Submodular functions and electrical networks , 1997 .

[7]  Satoru Fujishige,et al.  Submodular functions and optimization , 1991 .

[8]  Marc Gyssens,et al.  How to Determine the Expressive Power of Constraints , 1999, Constraints.

[9]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[10]  Martin C. Cooper,et al.  The complexity of soft constraint satisfaction , 2006, Artif. Intell..

[11]  Satoru Iwata,et al.  A fully combinatorial algorithm for submodular function minimization , 2001, SODA '02.

[12]  Martin C. Cooper,et al.  A Maximal Tractable Class of Soft Constraints , 2003, IJCAI.

[13]  Nadia Creignou,et al.  A Dichotomy Theorem for Maximum Generalized Satisfiability Problems , 1995, J. Comput. Syst. Sci..

[14]  Marc Gyssens,et al.  Closure properties of constraints , 1997, JACM.

[15]  Ágnes Szendrei,et al.  Clones in universal algebra , 1986 .

[16]  Andrei A. Bulatov,et al.  A dichotomy theorem for constraints on a three-element set , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[17]  J. A. d'Auriac,et al.  Optimal cooperation and submodularity for computing Potts' partition functions with a large number of states , 2002, cond-mat/0204055.

[18]  Peter Jeavons,et al.  Constructing Constraints , 1998, CP.

[19]  William H. Cunningham,et al.  Minimum cuts, modular functions, and matroid polyhedra , 1985, Networks.

[20]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[21]  Tomás Feder,et al.  The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory , 1999, SIAM J. Comput..

[22]  Thomas Schiex,et al.  Semiring-Based CSPs and Valued CSPs: Frameworks, Properties, and Comparison , 1999, Constraints.

[23]  Peter Jeavons,et al.  Classifying the Complexity of Constraints Using Finite Algebras , 2005, SIAM J. Comput..

[24]  Maurice Queyranne,et al.  Minimizing symmetric submodular functions , 1998, Math. Program..

[25]  Satoru Iwata,et al.  A combinatorial strongly polynomial algorithm for minimizing submodular functions , 2001, JACM.

[26]  Rainer E. Burkard,et al.  Perspectives of Monge Properties in Optimization , 1996, Discret. Appl. Math..

[27]  Peter Jonsson,et al.  The Approximability of Three-valued MAX CSP , 2004, SIAM J. Comput..

[28]  Martin C. Cooper,et al.  A Complete Characterization of Complexity for Boolean Constraint Optimization Problems , 2004, CP.

[29]  Peter Jeavons,et al.  On the Algebraic Structure of Combinatorial Problems , 1998, Theor. Comput. Sci..

[30]  Martin C. Cooper,et al.  Soft Constraints: Complexity and Multimorphisms , 2003, CP.

[31]  Martin C. Cooper,et al.  Supermodular functions and the complexity of MAX CSP , 2005, Discret. Appl. Math..

[32]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[33]  Sanjeev Khanna,et al.  Complexity classifications of Boolean constraint satisfaction problems , 2001, SIAM monographs on discrete mathematics and applications.

[34]  Toshihide Ibaraki,et al.  A Note on Minimizing Submodular Functions , 1998, Inf. Process. Lett..

[35]  H. Narayanan,et al.  A note on the minimization of symmetric and general submodular functions , 2003, Discret. Appl. Math..

[36]  Francesca Rossi,et al.  Principles and Practice of Constraint Programming – CP 2003 , 2003, Lecture Notes in Computer Science.

[37]  Mark Wallace,et al.  Principles and Practice of Constraint Programming – CP 2004 , 2004, Lecture Notes in Computer Science.