GCC-like restrictions on the same constraint

RECENT ADVANCES IN CONSTRAINTS(2005)

引用 4|浏览0
暂无评分
摘要
The Same constraint takes two sets of variables X and Z such that |X|=|Z| and assigns values to them such that the multiset of values assigned to the variables in X is equal to the multiset of values assigned to the variables in Z. In this paper we extend the Same constraint in a GCC-like manner by adding cardinality requirements on the values. That is, for each value we have a lower and upper bound on the number of variables that can be assigned this value. We show an algorithm that achieves arc-consistency for this constraint and a faster algorithm that achieves bound-consistency for a restricted case of it.
更多
查看译文
关键词
restricted case,gcc-like manner,gcc-like restriction,cardinality requirement,faster algorithm,variables x,arc consistency
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要