The complexity of soft constraint satisfaction

Over the past few years there has been considerable progress in methods to systematically analyse the complexity of constraint satisfaction problems with specified constraint types. One very powerful theoretical development in this area links the complexity of a set of constraints to a corresponding set of algebraic operations, known as polymorphisms. In this paper we extend the analysis of complexity to the more general framework of combinatorial optimisation problems expressed using various forms of soft constraints. We launch a systematic investigation of the complexity of these problems by extending the notion of a polymorphism to a more general algebraic operation, which we call a multimorphism. We show that many tractable sets of soft constraints, both established and novel, can be characterised by the presence of particular multimorphisms. We also show that a simple set of NP-hard constraints has very restricted multimorphisms. Finally, we use the notion of multimorphism to give a complete classification of complexity for the Boolean case which extends several earlier classification results for particular special cases.

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

[2]  Mihalis Yannakakis,et al.  The Complexity of Multiterminal Cuts , 1994, SIAM J. Comput..

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

[4]  Francesca Rossi,et al.  Constraint Solving over Semirings , 1995, IJCAI.

[5]  Endre Boros,et al.  Pseudo-Boolean optimization , 2002, Discret. Appl. Math..

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

[7]  Roger Mohr,et al.  Good Old Discrete Relaxation , 1988, ECAI.

[8]  Thomas Schiex,et al.  Solving weighted CSP by maintaining arc consistency , 2004, Artif. Intell..

[9]  Thomas Schiex,et al.  Valued Constraint Satisfaction Problems: Hard and Easy Problems , 1995, IJCAI.

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

[11]  Lefteris M. Kirousis,et al.  Fast Parallel Constraint Satisfaction , 1993, Artif. Intell..

[12]  Víctor Dalmau,et al.  Generalized majority-minority operations are tractable , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).

[13]  Francesca Rossi,et al.  Temporal Constraint Reasoning With Preferences , 2001, IJCAI.

[14]  Martin C. Cooper,et al.  Characterising Tractable Constraints , 1994, Artif. Intell..

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

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

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

[18]  Gregory Gutin,et al.  Level of Repair Analysis and Minimum Cost Homomorphisms of Graphs , 2005, AAIM.

[19]  Eugene C. Freuder,et al.  The Complexity of Constraint Satisfaction Revisited , 1993, Artif. Intell..

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

[21]  Luca Trevisan,et al.  The Approximability of Constraint Satisfaction Problems , 2001, SIAM J. Comput..

[22]  Martin C. Cooper,et al.  Tractable Constraints on Ordered Domains , 1995, Artif. Intell..

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

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

[25]  Satoru Iwata,et al.  Bisubmodular Function Minimization , 2005, SIAM J. Discret. Math..

[26]  Rina Dechter,et al.  Constraint Processing , 1995, Lecture Notes in Computer Science.

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

[28]  Justin Pearson,et al.  Constraints and universal algebra , 1998, Annals of Mathematics and Artificial Intelligence.

[29]  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..

[30]  Nils J. Nilsson,et al.  Artificial Intelligence , 1974, IFIP Congress.

[31]  Satoru Iwata,et al.  Submodular function minimization , 2007, Math. Program..

[32]  P. Jeavons.  Structural Theory of Automata‚ Semigroups‚ and Universal Algebra , 2003 .

[33]  Peter Jeavons,et al.  A Survey of Tractable Constraint Satisfaction Problems , 1997 .

[34]  Martin Grötschel,et al.  The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

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

[36]  Peter Jeavons,et al.  The complexity of maximal constraint languages , 2001, STOC '01.

[37]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[38]  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..

[39]  Gregory Gutin,et al.  Minimum cost and list homomorphisms to semicomplete digraphs , 2005, Discret. Appl. Math..

[40]  Satoru Iwata,et al.  Improved algorithms for submodular function minimization and submodular flow , 2000, STOC '00.

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

[42]  Richard J. Wallace,et al.  Partial Constraint Satisfaction , 1989, IJCAI.

[43]  Reinhard Pöschel,et al.  Funktionen- und Relationenalgebren , 1979 .

[44]  Martin C. Cooper,et al.  Constraints, Consistency and Closure , 1998, Artif. Intell..

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

[46]  Thomas Schiex,et al.  Maintaining Reversible DAC for Max-CSP , 1999, Artif. Intell..

[47]  Ugo Montanari,et al.  Networks of constraints: Fundamental properties and applications to picture processing , 1974, Inf. Sci..

[48]  Andrei A. Bulatov,et al.  A dichotomy theorem for constraint satisfaction problems on a 3-element set , 2006, JACM.

[49]  Pascal Van Hentenryck,et al.  A Generic Arc-Consistency Algorithm and its Specializations , 1992, Artif. Intell..