A Maximal Tractable Class of Soft Constraints

Many researchers in artificial intelligence are beginning to explore the use of soft constraints to express a set of (possibly conflicting) problem requirements. A soft constraint is a function defined on a collection of variables which associates some measure of desirability with each possible combination of values for those variables. However, the crucial question of the computational complexity of finding the optimal solution to a collection of soft constraints has so far received very little attention. In this paper we identify a class of soft binary constraints for which the problem of finding the optimal solution is tractable. In other words, we show that for any given set of such constraints, there exists a polynomial time algorithm to determine the assignment having the best overall combined measure of desirability. This tractable class includes many commonly-occurring soft constraints, such as 'as near as possible' or 'as soon as possible after', as well as crisp constraints such as 'greater than'. Finally, we show that this tractable class is maximal, in the sense that adding any other form of soft binary constraint which is not in the class gives rise to a class of problems which is NP-hard.

[1]  Bart Selman,et al.  Planning as Satisfiability , 1992, ECAI.

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

[3]  Yoav Shoham,et al.  Run the GAMUT: a comprehensive approach to evaluating game-theoretic algorithms , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..

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

[5]  David Maxwell Chickering,et al.  Learning Bayesian Networks: The Combination of Knowledge and Statistical Data , 1994, Machine Learning.

[6]  Azriel Rosenfeld,et al.  Scene Labeling by Relaxation Operations , 1976, IEEE Transactions on Systems, Man, and Cybernetics.

[7]  Francesca Rossi,et al.  Semiring-based constraint satisfaction and optimization , 1997, JACM.

[8]  Gerhard J. Woeginger,et al.  The cone of Monge matrices: Extremal rays and applications , 1995, Math. Methods Oper. Res..

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

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

[11]  László Lovász,et al.  Submodular functions and convexity , 1982, ISMP.

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

[13]  Eugene C. Freuder,et al.  Partial Constraint Satisfaction , 1989, IJCAI.

[14]  Andrei A. Bulatov,et al.  Tractable conservative constraint satisfaction problems , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..

[15]  Andrew V. Goldberg,et al.  A new approach to the maximum flow problem , 1986, STOC '86.

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

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

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

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

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

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

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

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

[24]  Pascal Van Hentenryck,et al.  Constraint Satisfaction over Connected Row Convex Constraints , 1997, Artif. Intell..

[25]  Z. Ruttkay.  Fuzzy constraint satisfaction , 1994, Proceedings of 1994 IEEE 3rd International Fuzzy Systems Conference.

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

[27]  Michael L. Littman,et al.  Graphical Models for Game Theory , 2001, UAI.

[28]  James F. Allen.  Natural language understanding (2nd ed.) , 1995 .

[29]  Martin C. Cooper.  Reduction operations in fuzzy or valued constraint satisfaction , 2003, Fuzzy Sets Syst..

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

[31]  Donald M. Topkis,et al.  Minimizing a Submodular Function on a Lattice , 1978, Oper. Res..

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

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

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

[35]  Peter van Beek,et al.  Reasoning About Qualitative Temporal Information , 1990, Artif. Intell..