All不同、全局基数的分解及相关约束
Decompositions of All Different, Global Cardinality and Related Constraints
摘要：
我们发现，一些常见的和重要的全局约束，如ALL-DIFFERENT和GCC可以分解成简单的算术约束，我们实现了边界或范围的一致性，在某些情况下，甚至更大的修剪。这些分解可以很容易地添加到新的求解器。它们还通过共享变量来提供对传播器状态的访问的其他约束。这种共享可以用于改善约束之间的传播。我们报告我们的分解在一个伪布尔求解器的实验。
英文摘要：
We show that some common and important global constraints like ALL-DIFFERENT and GCC can be decomposed into simple arithmetic constraints on which we achieve bound or range consistency, and in some cases even greater pruning. These decompositions can be easily added to new solvers. They also provide other constraints with access to the state of the propagator by sharing of variables. Such sharing can be used to improve propagation between constraints. We report experiments with our decomposition in a pseudo-Boolean solver.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
