资源分类
》 资源 》论文》Making Bound Consistency as Effective as Arc Consistency

Making Bound Consistency as Effective as Arc Consistency

2019-11-15 | |  61 |   64 |   0

Abstract We study under what conditions bound consistency (BC) and arc consistency (AC), two forms of propagation used in constraint solvers, are equivalent to each other. We show that they prune exactly the same values when the propagated constraint is connected row convex / closed under median and its complement is row convex. This characterization is exact for binary constraints. Since row convexity depends on the order of the values in the domains, we give polynomial algorithms for computing orders under which BC and AC are equivalent, if any

上一篇：Decompositions of All Different, Global Cardinality and Related Constraints

下一篇：Canadian Traveler Problem with Remote Sensing

用户评价
全部评价

热门资源

  • 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...