Tractable Combinations of Global Constraints
CP'13: Proceedings of the 19th International Conference on Principles and Practice of Constraint Programming(2013)
摘要
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.
更多查看译文
关键词
Constraint Programming, Constraint Satisfaction Problem, Counting Function, Global Constraint, Constraint Problem
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要