当前位置: X-MOL 学术Constraints › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
The power of propagation: when GAC is enough
Constraints ( IF 1.6 ) Pub Date : 2016-08-23 , DOI: 10.1007/s10601-016-9251-0
David A. Cohen , Peter G. Jeavons

Considerable effort in constraint programming has focused on the development of efficient propagators for individual constraints. In this paper, we consider the combined power of such propagators when applied to collections of more than one constraint. In particular we identify classes of constraint problems where such propagators can decide the existence of a solution on their own, without the need for any additional search. Sporadic examples of such classes have previously been identified, including classes based on restricting the structure of the problem, restricting the constraint types, and some hybrid examples. However, there has previously been no unifying approach which characterises all of these classes: structural, language-based and hybrid. In this paper we develop such a unifying approach and embed all the known classes into a common framework. We then use this framework to identify a further class of problems that can be solved by propagation alone.

中文翻译:

传播的力量:当GAC足够时

约束编程中的相当大的努力集中在针对单个约束的有效传播器的开发上。在本文中,我们考虑了将此类传播器的综合功能应用于多个约束的集合。特别是,我们确定了约束问题的类别,这些传播者可以自行决定解决方案的存在,而无需进行任何其他搜索。以前已经确定了此类的零星示例,包括基于限制问题的结构,限制约束类型的类以及一些混合示例。但是,以前没有统一的方法可以表征所有这些类别:结构,基于语言和混合的类别。在本文中,我们开发了这种统一的方法,并将所有已知的类嵌入到一个通用框架中。然后,我们使用此框架来识别可以通过单独传播解决的另一类问题。
更新日期:2016-08-23
down
wechat
bug