Exploiting Tree Decomposition and Soft Local Consistency In Weighted CSP

Several recent approaches for processing graphical models (constraint and Bayesian networks) simultaneously exploit graph decomposition and local consistency enforcing. Graph decomposition exploits the problem structure and offers space and time complexity bounds while hard information propagation provides practical improvements of space and time behavior inside these theoretical bounds. Concurrently, the extension of local consistency to weighted constraint networks has led to important improvements in branch and bound based solvers. Indeed, soft local consistencies give incrementally computed strong lower bounds providing inexpensive yet powerful pruning and better informed heuristics. In this paper, we consider combinations of tree decomposition based approaches and soft local consistency enforcing for solving weighted constraint problems. The intricacy of weighted information processing leads to different approaches, with different theoretical properties. It appears that the most promising combination sacrifices a bit of theory for improved practical efficiency.

[1]  Jegou Philippe,et al.  Decomposition and good recording for solving Max-CSPs , 2004 .

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

[3]  Philippe Jégou,et al.  Hybrid backtracking bounded by tree-decomposition of constraint networks , 2003, Artif. Intell..

[4]  Javier Larrosa,et al.  Pseudo-tree Search with Soft Constraints , 2002, ECAI.

[5]  Simon de Givry,et al.  Radio Link Frequency Assignment , 1999, Constraints.

[6]  Toniann Pitassi,et al.  Value Elimination: Bayesian Interence via Backtracking Search , 2002, UAI.

[7]  Thomas Schiex,et al.  On the Complexity of Compact Coalitional Games , 2009, IJCAI.

[8]  Rina Dechter,et al.  AND/OR Branch-and-Bound for Graphical Models , 2005, IJCAI.

[9]  Michael J. Quinn,et al.  Taking Advantage of Stable Sets of Variables in Constraint Satisfaction Problems , 1985, IJCAI.

[10]  Rina Dechter,et al.  Bucket Elimination: A Unifying Framework for Reasoning , 1999, Artif. Intell..

[11]  Arie M. C. A. Koster,et al.  Frequency assignment : models and algorithms , 1999 .

[12]  Robert E. Tarjan,et al.  Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs , 1984, SIAM J. Comput..

[13]  Adnan Darwiche,et al.  Recursive conditioning , 2001, Artif. Intell..

[14]  Philippe Jégou,et al.  Decomposition and Good Recording for Solving Max-CSPs , 2004, ECAI.

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

[16]  Rina Dechter,et al.  Advances in AND / OR Branch-and-Bound Search for Constraint Optimization , 2005 .

[17]  Hans L. Bodlaender,et al.  Discovering Treewidth , 2005, SOFSEM.