Weighted constraint satisfaction problem

In artificial intelligence and operations research, a Weighted Constraint Satisfaction Problem (WCSP) is a generalization of a constraint satisfaction problem (CSP) where some of the constraints can be violated (according to a violation degree) and in which preferences among solutions can be expressed. This generalization makes it possible to represent more real-world problems, in particular those that are over-constrained (no solution can be found without violating at least one constraint), or those where we want to find a minimal-cost solution (according to a cost function) among multiple possible solutions.

Formal definition

A Weighted Constraint Network (WCN) is a triplet ${\displaystyle \langle X,C,k\rangle }$ where ${\displaystyle X}$ is a finite set of variables, ${\displaystyle C}$ is a finite set of soft constraints and ${\displaystyle k>0}$ is either a natural integer or ${\displaystyle \infty }$.

Each soft constraint ${\displaystyle c_{S}\in C}$ involves an ordered set ${\displaystyle S}$ of variables, called its scope, and is defined as a cost function from ${\displaystyle l(S)}$ to ${\displaystyle \langle 0,...,k\rangle }$ where ${\displaystyle l(S)}$ is the set of possible instantiations of ${\displaystyle S}$. When an instantiation ${\displaystyle I\in l(S)}$ is given the cost ${\displaystyle k}$, i.e., ${\displaystyle c_{S}(I)=k}$, it is said forbidden. Otherwise it is permitted with the corresponding cost (0 being completely satisfactory).

In WCSP, specific subclass of Valued CSP (VCSP), costs are combined with the specific operator ${\displaystyle \oplus }$ defined as: ${\displaystyle \forall \alpha ,\beta \in \langle 0,...,k\rangle ,\alpha \oplus \beta =min(k,\alpha +\beta )}$. The partial inverse of ${\displaystyle \oplus }$ is ${\displaystyle \ominus }$ defined by: if ${\displaystyle 0\leq \beta \leq \alpha <k}$, ${\displaystyle \alpha \ominus \beta =\alpha -\beta }$ and if ${\displaystyle 0\leq \beta <k}$, ${\displaystyle k\ominus \beta =k}$.

Without any loss of generality, the existence of a nullary constraint ${\displaystyle c_{\emptyset }}$ (a cost) as well as the presence of a unary constraint ${\displaystyle c_{x}}$ for every variable ${\displaystyle x}$ is assumed.

The total cost of an instantiation ${\displaystyle I\in l(S)}$ on a soft constraint ${\displaystyle c_{S}}$, includes the cost of ${\displaystyle I}$ on ${\displaystyle c_{S}}$ as well as the nullary cost ${\displaystyle c_{\emptyset }}$ and the unary costs for ${\displaystyle I}$ of the variables in ${\displaystyle S}$.

Considering a WCN, the usual (NP-hard) task of WCSP is to find a complete instantiation with a minimal cost.

Resolution of binary/ternary WCSPs

Approach with cost transfer operations

Node consistency (NC) and Arc consistency (AC), introduced for the Constraint Satisfaction Problem (CSP), have been studied later in the context of WCSP. Furthermore, several consistencies about the best form of arc consistency have been proposed: Full Directional Arc consistency (FDAC), [1] Existential Directional Arc consistency (EDAC), [2] Virtual Arc consistency (VAC) [3] and Optimal Soft Arc consistency (OSAC). [4]

Algorithms enforcing such properties are based on Equivalence Preserving Transformations (EPT) that allow safe moves of costs among constraints. Three basic costs transfer operations are:

• Project : cost transfer from constraints to unary constraints
• ProjectUnary : cost transfer from unary constraint to nullary constraint
• Extend : cost transfer from unary constraint to constraint

Basic Equivalence Preserving Transformations.

The goal of Equivalence Preserving Transformations is to concentrate costs on the nullary constraint ${\displaystyle c_{\emptyset }}$ and remove efficiently instantiations and values with a cost, added to ${\displaystyle c_{\emptyset }}$, that is greater than or equal to the forbidden cost or the cost of the best solution found.

Approach without cost transfer operations

An alternative to cost transfer algorithms is the algorithm PFC-MRDAC [5] which is a classical branch and bound algorithm that computes lower bound ${\displaystyle lb}$ at each node of the search tree, that corresponds to an under-estimation of the cost of any solution that can be obtained from this node. The cost of the best solution found is ${\displaystyle ub}$. When ${\displaystyle lb\geq ub}$, then the search tree from this node is pruned.

Resolution of n-ary WCSPs

Cost transfer algorithms have been shown to be particularly efficient to solve real-world problem when soft constraints are binary or ternary (maximal arity of constraints in the problem is equal to 2 or 3). For soft constraints of large arity, cost transfer becomes a serious issue because the risk of combinatorial explosion has to be controlled.

An algorithm, called ${\displaystyle GAC^{w}-WSTR}$, [6] has been proposed to enforce a weak version of the property Generalized Arc Consistency (GAC) on soft constraints defined extensionally by listing tuples and their costs. This algorithm combines two techniques, namely, Simple Tabular Reduction (STR) [7] and cost transfer. Values that are no longer consistent with respect to GAC are identified and minimum costs of values are computed. This is particularly useful for efficiently performing projection operations that are required to establish GAC.

Benchmarks

Many real-world WCSP benchmarks are available on http://costfunction.org/en/benchmark [8] and on http://www.cril.univ-artois.fr/~lecoutre/benchmarks.html .

See also

• Constraint satisfaction problem
• Constraint programming
• Preference-based planning

References

1. M. Cooper. Reduction operations in fuzzy or valued constraint satisfaction. Fuzzy Sets and Systems, 134(3):311–342, 2003.
2. S. de Givry, F. Heras, M. Zytnicki, and J. Larrosa. Existential arc consistency: Getting closer to full arc consistency in weighted CSPs. In Proceedings of IJCAI’05, pages 84–89, 2005.
3. M. Cooper, S. de Givry, M. Sanchez, T. Schiex, M. Zytnicki. Virtual Arc Consistency for Weighted CSP. In Proceedings of AAAI’08, pages 253-258, 2008.
4. M. Cooper, S. de Givry, M. Sanchez, T. Schiex, M. Zytnicki, and T. Werner. Soft arc consistency revisited. Artificial Intelligence, 174(7-8):449–478, 2010.
5. E.C. Freuder and R.J. Wallace. Partial constraint satisfaction. Artificial Intelligence, 58(1- 3):21–70, 1992.
6. C. Lecoutre, N. Paris, O. Roussel, S. Tabary. Propagating Soft Table Constraints. In Proceedings of CP’12, pages 390-405, 2012.
7. C. Lecoutre. STR2: Optimized simple tabular reduction for table constraint. Constraints, 16(4):341–371, 2011.
8. The aims of this web site is to promote cost function network in providing Benchmark and teaching material, solver demo, link to article about cost function used in the context of constraint programming.