@article {55848, title = {Tractability-preserving Transformations of Global Cost Functions}, journal = {Artificial Intelligence}, volume = {238}, year = {2016}, pages = {166{\textendash}189}, abstract = {

Graphical model processing is a central problem in artificial intelligence. The optimization of the combined cost of a network of local cost functions federates a variety of famous problems including CSP, SAT and Max-SAT but also optimization in stochastic variants such as Markov Random Fields and Bayesian networks. Exact solving methods for these problems typically include branch and bound and local inference-based bounds.

In this paper we are interested in understanding when and how dynamic programming based optimization can be used to efficiently enforce soft local consistencies on Global Cost Functions, defined as parameterized families of cost functions of unbounded arity. Enforcing local consistencies in cost function networks is performed by applying so-called Equivalence Preserving Transformations (EPTs) to the cost functions. These EPTs may transform global cost functions and make them intractable to optimize.

We identify as tractable projection-safe those global cost functions whose optimization is and remains tractable after applying the EPTs used for enforcing arc consistency. We also provide new classes of cost functions that are tractable projection-safe thanks to dynamic programming.

We show that dynamic programming can either be directly used inside filtering algorithms, defining polynomially DAG-filterable cost functions, or emulated by arc consistency filtering on a Berge-acyclic network of bounded-arity cost functions, defining Berge-acyclic network-decomposable cost functions. We give examples of such cost functions and we provide a systematic way to define decompositions from existing decomposable global constraints.

These two approaches to enforcing consistency in global cost functions are then embedded in a solver for extensive experiments that confirm the feasibility and efficiency of our proposal.

}, keywords = {Computational Complexity, Constraint programming, Constraint satisfaction problem, Cost function network, Decomposition, Global cost functions, Graphical model, Weighted constraint satisfaction problem}, issn = {0004-3702}, doi = {10.1016/j.artint.2016.06.005}, url = {http://dx.doi.org/10.1016/j.artint.2016.06.005}, author = {Allouche, David and Bessiere, Christian and Boizumault, Patrice and de Givry, Simon and Patricia Gutierrez and Lee, Jimmy H.M. and Leung, Ka Lun and Loudni, Samir and M{\'e}tivier, Jean-Philippe and Schiex, Thomas and Wu, Yi} }