Virtual Arc Consistency for Weighted CSP

Optimizing a combination of local cost functions on discrete variables is a central problem in many formalisms such as in probabilistic networks, maximum satisfiability, weighted CSP or factor graphs. Recent results have shown that maintaining a form of local consistency in a Branch and Bound search provides bounds that are strong enough to solve many practical instances. In this paper, we introduce Virtual Arc Consistency (VAC) which iteratively identifies and applies sequences of cost propagation over rational costs that are guaranteed to transform a WCSP in another WCSP with an improved constant cost. Although not as strong as Optimal Soft Arc Consistency, VAC is faster and powerful enough to solve submodular problems. Maintaining VAC inside branch and bound leads to important improvements in efficiency on large difficult problems and allowed us to close two famous frequency assignment problem instances.

[1]  Felip Manyà,et al.  Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers , 2005, CP.

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

[3]  Jozef Kratica,et al.  Solving the simple plant location problem by genetic algorithm , 2001, RAIRO Oper. Res..

[4]  Simon de Givry,et al.  Existential arc consistency: Getting closer to full arc consistency in weighted CSPs , 2005, IJCAI.

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

[6]  Dmitrij Schlesinger,et al.  Exact Solution of Permuted Submodular MinSum Problems , 2007, EMMCVPR.

[7]  Martin C. Cooper,et al.  Arc consistency for soft constraints , 2004, Artif. Intell..

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

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

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

[11]  Albert Oliveras,et al.  MiniMaxSat: A New Weighted Max-SAT Solver , 2007, SAT.

[12]  Christian Bessiere,et al.  New Lower Bounds of Constraint Violations for Over-Constrained Problems , 2001, CP.

[13]  Thomas Schiex,et al.  A new local consistency for weighted CSP dedicated to long domains , 2006, SAC '06.

[14]  Martin C. Cooper.  Minimization of Locally Defined Submodular Functions by Optimal Soft Arc Consistency , 2007, Constraints.

[15]  Tomás Werner,et al.  A Linear Programming Approach to Max-Sum Problem: A Review , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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

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

[18]  Martin C. Cooper,et al.  Optimal Soft Arc Consistency , 2007, IJCAI.