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

约束规划中多集变量Lex界的比较

A Comparison of Lex Bounds for Multiset Variables in Constraint Programming

The Chinese University of Hong Kong(香港中文大学);NICTA(国家信息与通信技术研究院);UNSW(新南威尔士大学)

Yat-Chiu Law, Jimmy Ho-Man Lee, May Hiu-Chun Woo, Toby Walsh

摘要:

约束编程中的集合和多集合变量通常使用子集边界表示。然而,这是一种弱表示,它忽略了关于集合的潜在有用信息,例如它的基数。对于集合变量,length-lex(LL)表示成功地提供了关于长度(基数)和在字典顺序中的位置的信息。对于多集变量,其中元素可以重复,我们考虑更丰富的表示,考虑额外的信息。我们研究了八种不同的表示,我们根据八种不同的排序:长度(共)lex(LL/LC),品种(共)lex(VL/VC),长度品种(共)lex(LVL/LVC),和品种长度(共)lex(VLL/VLC)排序的范围。这些表示将关于基数、多样性(多集中不同元素的数量)和位置的信息集成在一起。理论和经验比较的表达性和紧凑性的八个表示法表明,长度变化(共)lex(LVL/LVC)和变化长度(共)lex(VLL/VLC)通常给出更严格的界限后,约束传播。我们实现了八个表示和评估他们对子集的界限表示基数和品种推理。结果表明,他们提供了显着更好的修剪和运行时间。

英文摘要:

Set and multiset variables in constraint programming have typically been represented using subset bounds. However, this is a weak representation that neglects potentially useful information about a set such as its cardinality. For set variables, the length-lex (LL) representation successfully provides information about the length (cardinality) and position in the lexicographic ordering. For multiset variables, where elements can be repeated, we consider richer representations that take into account additional information. We study eight different representations in which we maintain bounds according to one of the eight different orderings: length-(co)lex (LL/LC), variety-(co)lex (VL/VC), length-variety-(co)lex (LVL/LVC), and variety-length-(co)lex (VLL/VLC) orderings. These representations integrate together information about the cardinality, variety (number of distinct elements in the multiset), and position in some total ordering. Theoretical and empirical comparisons of expressiveness and compactness of the eight representations suggest that length-variety-(co)lex (LVL/LVC) and variety-length-(co)lex (VLL/VLC) usually give tighter bounds after constraint propagation. We implement the eight representations and evaluate them against the subset bounds representation with cardinality and variety reasoning. Results demonstrate that they offer significantly better pruning and runtime.

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

↑