Tractable Combinations of Global Constraints
Abstract
We study the complexity of constraint satisfaction problems involving global constraints, i.e., special-purpose constraints provided by a solver and represented implicitly by a parametrised algorithm. Such constraints are widely used; indeed, they are one of the key reasons for the success of constraint programming in solving real-world problems. Previous work has focused on the development of efficient propagators for individual constraints. In this paper, we identify a new tractable class of constraint problems involving global constraints of unbounded arity. To do so, we combine structural restrictions with the observation that some important types of global constraint do not distinguish between large classes of equivalent solutions.
Cite
@article{arxiv.1307.2867,
title = {Tractable Combinations of Global Constraints},
author = {David A. Cohen and Peter G. Jeavons and Evgenij Thorstensen and Stanislav Živný},
journal= {arXiv preprint arXiv:1307.2867},
year = {2013}
}
Comments
To appear in proceedings of CP'13, LNCS 8124. arXiv admin note: text overlap with arXiv:1307.1790