Consistency techniques for flow-based projection-safe global cost functions in weighted constraint satisfaction.

*(English)*Zbl 1237.68188Summary: Many combinatorial problems deal with preferences and violations, the goal of which is to find solutions with the minimum cost. Weighted constraint satisfaction is a framework for modeling such problems, which consists of a set of cost functions to measure the degree of violation or preferences of different combinations of variable assignments. Typical solution methods for weighted constraint satisfaction problems (WCSPs) are based on branch-and-bound search, which are made practical through the use of powerful consistency techniques such as \(\text{AC}^*\), \(\text{FDAC}^*\), \(\text{EDAC}^*\) to deduce hidden cost information and value pruning during search. These techniques, however, are designed to be efficient only on binary and ternary cost functions which are represented in table form. In tackling many real-life problems, high arity (or global) cost functions are required. We investigate efficient representation scheme and algorithms to bring the benefits of the consistency techniques to also high arity cost functions, which are often derived from hard global constraints from classical constraint satisfaction.

The literature suggests some global cost functions can be represented as flow networks, and the minimum cost flow algorithm can be used to compute the minimum costs of such networks in polynomial time. We show that naive adoption of this flow-based algorithmic method for global cost functions can result in a stronger form of null-inverse consistency. We further show how the method can be modified to handle cost projections and extensions to maintain generalized versions of \(\text{AC}^*\) and \(\text{FDAC}^*\) for cost functions with more than two variables. Similar generalization for the stronger \(\text{EDAC}^*\) is less straightforward. We reveal the oscillation problem when enforcing \(\text{EDAC}^*\) on cost functions sharing more than one variable. To avoid oscillation, we propose a weak version of \(\text{EDAC}^*\) and generalize it to weak \(\text{EDGAC}^*\) for non-binary cost functions. Using various benchmarks involving the soft variants of hard global constraints AllDifferent, GCC, same, and regular, empirical results demonstrate that our proposal gives improvements of up to an order of magnitude when compared with the traditional constraint optimization approach, both in terms of time and pruning.

The literature suggests some global cost functions can be represented as flow networks, and the minimum cost flow algorithm can be used to compute the minimum costs of such networks in polynomial time. We show that naive adoption of this flow-based algorithmic method for global cost functions can result in a stronger form of null-inverse consistency. We further show how the method can be modified to handle cost projections and extensions to maintain generalized versions of \(\text{AC}^*\) and \(\text{FDAC}^*\) for cost functions with more than two variables. Similar generalization for the stronger \(\text{EDAC}^*\) is less straightforward. We reveal the oscillation problem when enforcing \(\text{EDAC}^*\) on cost functions sharing more than one variable. To avoid oscillation, we propose a weak version of \(\text{EDAC}^*\) and generalize it to weak \(\text{EDGAC}^*\) for non-binary cost functions. Using various benchmarks involving the soft variants of hard global constraints AllDifferent, GCC, same, and regular, empirical results demonstrate that our proposal gives improvements of up to an order of magnitude when compared with the traditional constraint optimization approach, both in terms of time and pruning.

##### MSC:

68T20 | Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) |