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. © 2013 Springer-Verlag.
CITATION STYLE
Cohen, D. A., Jeavons, P. G., Thorstensen, E., & Živný, S. (2013). Tractable combinations of global constraints. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8124 LNCS, pp. 230–246). https://doi.org/10.1007/978-3-642-40627-0_20
Mendeley helps you to discover research relevant for your work.