arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0903.0211cs.AI
收藏

Range and Roots:两种常见的计数和发生约束的验证和验证模式

Range and Roots: Two Common Patterns for Specifying and Propagating Counting and Occurrence Constraints

LIRMM;CNRS(法国国家科学研究中心);U. Montpellier(蒙彼利埃大学);UCC(科克大学);Izmir University of Economics(伊兹密尔经济大学);Univ. di Bologna(博洛尼亚大学);NICTA(国家信息与通信技术研究院);UNSW(新南威尔士大学)

Christian Bessiere, Emmanuel Hebrard, Brahim Hnich, Zeynep Kiziltan, Toby Walsh

摘要:

我们提出了范围和根,这是两个常见的模式,用于指定一个广泛的计数和发生的约束。我们为这两种模式设计了专门的传播算法。因此,使用这些模式指定的计数和出现约束直接继承传播算法。为了说明范围和根约束的能力,我们指定了一些从文献中获得的全局约束。初步的实验表明,传播计数和发生的约束,使用这两种模式导致一个小的性能损失相比,专门的全球性的约束,是有竞争力的替代分解使用基本的约束。

英文摘要:

We propose Range and Roots which are two common patterns useful for specifying a wide range of counting and occurrence constraints. We design specialised propagation algorithms for these two patterns. Counting and occurrence constraints specified using these patterns thus directly inherit a propagation algorithm. To illustrate the capabilities of the Range and Roots constraints, we specify a number of global constraints taken from the literature. Preliminary experiments demonstrate that propagating counting and occurrence constraints using these two patterns leads to a small loss in performance when compared to specialised global constraints and is competitive with alternative decompositions using elementary constraints.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑