资源分类
》 资源 》论文》Decompositions of All Different, Global Cardinality and Related Constraints

Decompositions of All Different, Global Cardinality and Related Constraints

2019-11-15 | |  63 |   40 |   0

Abstract 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

上一篇：Circuit Complexity and Decompositions of Global Constraints

下一篇：Making Bound Consistency as Effective as Arc Consistency

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...