Hybrid tractability of valued constraint problems

The constraint satisfaction problem (CSP) is a central generic problem in computer science and artificial intelligence: it provides a common framework for many theoretical problems as well as for many real-life applications. Valued constraint problems are a generalisation of the CSP which allow the user to model optimisation problems. Considerable effort has been made in identifying properties which ensure tractability in such problems. In this work, we initiate the study of hybrid tractability of valued constraint problems; that is, properties which guarantee tractability of the given valued constraint problem, but which do not depend only on the underlying structure of the instance (such as being tree-structured) or only on the types of valued constraints in the instance (such as submodularity). We present several novel hybrid classes of valued constraint problems in which all unary constraints are allowed, which include a machine scheduling problem, constraint problems of arbitrary arities with no overlapping nogoods, and the SoftAllDiff constraint with arbitrary unary valued constraints. An important tool in our investigation will be the notion of forbidden substructures.

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

[2]  Stanislav Zivny,et al.  Same-Relation Constraints , 2009, CP.

[3]  Philippe Jégou.  Decomposition of Domains Based on the Micro-Structure of Finite Constraint-Satisfaction Problems , 1993, AAAI.

[4]  Peter Jeavons,et al.  Perfect Constraints Are Tractable , 2008, CP.

[5]  Martin C. Cooper,et al.  Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination , 2010, Artif. Intell..

[6]  Jean-Charles Régin,et al.  Cost-Based Arc Consistency for Global Cardinality Constraints , 2002, Constraints.

[7]  J. Edmonds.  Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.

[8]  W. A. Horn.  Technical Note - Minimizing Average Flow Time with Parallel Machines , 1973, Oper. Res..

[9]  Derek G. Corneil,et al.  Complement reducible graphs , 1981, Discret. Appl. Math..

[10]  Jean-Charles Régin,et al.  Generalized Arc Consistency for Global Cardinality Constraint , 1996, AAAI/IAAI, Vol. 1.

[11]  Rustem Takhanov,et al.  A Dichotomy Theorem for the General Minimum Cost Homomorphism Problem , 2007, STACS.

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

[13]  Alan K. Mackworth.  Constraint Satisfaction , 1985 .

[14]  Phokion G. Kolaitis,et al.  Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics , 2002, CP.

[15]  Roman Barták,et al.  Constraint Processing , 2009, Encyclopedia of Artificial Intelligence.

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

[17]  V. Lozin,et al.  A polynomial algorithm to find an independent set of maximum weight in a fork-free graph , 2006, SODA 2006.

[18]  Patrice Boizumault,et al.  Σ-All Different: Softening AllDifferent in Weighted CSPs , 2007 .

[19]  Jimmy Ho-man Lee,et al.  Towards efficient consistency enforcement for global constraints in weighted constraint satisfaction , 2009, IJCAI 2009.

[20]  Vadim V. Lozin,et al.  Independent Sets of Maximum Weight in Apple-Free Graphs , 2008, SIAM J. Discret. Math..

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

[22]  A. Tamura,et al.  A revision of Minty's algorithm for finding a maximum weight stable set of a claw-free graph , 2001 .

[23]  Paul D. Seymour,et al.  Recognizing Berge Graphs , 2005, Comb..

[24]  Paavo Kotinurmi,et al.  Message Passing , 2011, Encyclopedia of Parallel Computing.

[25]  Patrice Boizumault,et al.  Σ-All Different: Softening AllDifferent in Weighted CSPs , 2007, 19th IEEE International Conference on Tools with Artificial Intelligence(ICTAI 2007).

[26]  Michael I. Jordan.  Graphical Models , 2003 .

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

[29]  Michael I. Jordan,et al.  Graphical Models, Exponential Families, and Variational Inference , 2008, Found. Trends Mach. Learn..

[30]  R. Dechter.  to Constraint Satisfaction , 1991 .

[31]  P. Seymour,et al.  The Strong Perfect Graph Theorem , 2002, math/0212070.

[32]  Ravindra K. Ahuja,et al.  Network Flows , 2011 .

[33]  Gilles Pesant,et al.  On global warming: Flow-based soft global constraints , 2006, J. Heuristics.

[34]  Pedro Barahona,et al.  PSICO: Solving Protein Structures with Constraint Programming and Optimization , 2002, Constraints.

[35]  David A. Cohen,et al.  A New Classs of Binary CSPs for which Arc-Constistency Is a Decision Procedure , 2003, CP.

[36]  Michael Wooldridge,et al.  Proceedings of the 21st International Joint Conference on Artificial Intelligence , 2009 .

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

[38]  Tony Jebara,et al.  MAP Estimation, Message Passing, and Perfect Graphs , 2009, UAI.

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

[40]  Martin Grohe.  The complexity of homomorphism and constraint satisfaction problems seen from the other side , 2007, JACM.

[41]  Jean-Charles Régin,et al.  A Filtering Algorithm for Constraints of Difference in CSPs , 1994, AAAI.

[42]  George J. Minty,et al.  On maximal independent sets of vertices in claw-free graphs , 1980, J. Comb. Theory B.

[43]  Rina Dechter,et al.  Network-Based Heuristics for Constraint-Satisfaction Problems , 1987, Artif. Intell..

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

[45]  Toby Walsh,et al.  Handbook of Constraint Programming , 2006, Handbook of Constraint Programming.

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

[47]  Christian Bessiere,et al.  Specific Filtering Algorithms for Over-Constrained Problems , 2001, CP.

[48]  Martin C. Cooper,et al.  A New Hybrid Tractable Class of Soft Constraint Problems , 2010, CP.

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

[50]  T. K. Satish Kumar,et al.  A Framework for Hybrid Tractability Results in Boolean Weighted Constraint Satisfaction Problems , 2008, CP.

[51]  Vladimir Kolmogorov,et al.  Generalising tractable VCSPs defined by symmetric tournament pair multimorphisms , 2010, ArXiv.

[52]  V. E. Alekseev,et al.  Polynomial algorithm for finding the largest independent sets in graphs without forks , 2004, Discret. Appl. Math..

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

[54]  Peter Jeavons,et al.  The Complexity of Constraint Languages , 2006, Handbook of Constraint Programming.

[55]  Vladimir Kolmogorov,et al.  The complexity of conservative valued CSPs , 2011, JACM.

[56]  Martin Milanič,et al.  A polynomial algorithm to find an independent set of maximum weight in a fork-free graph , 2006, SODA '06.

[57]  Philippe David,et al.  Using Pivot Consistency to Decompose and Solve Functional CSPs , 1994, J. Artif. Intell. Res..

[58]  L. Beineke.  Characterizations of derived graphs , 1970 .

[59]  Edward G. Coffman,et al.  Scheduling independent tasks to reduce mean finishing time , 1974, CACM.

[60]  Yehuda Naveh,et al.  Generalizing AllDifferent: The SomeDifferent Constraint , 2006, CP.

[61]  Salil P. Vadhan,et al.  Computational Complexity , 2005, Encyclopedia of Cryptography and Security.

[62]  Martin C. Cooper,et al.  Generalising submodularity and horn clauses: Tractable optimization problems defined by tournament pair multimorphisms , 2008, Theor. Comput. Sci..

[63]  Jack Edmonds,et al.  Maximum matching and a polyhedron with 0,1-vertices , 1965 .

[64]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .