arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1006.3215cs.AIcs.LOcs.PL
收藏

用变量替换法求解函数约束

Solving Functional Constraints by Variable Substitution

Texas Tech University(德克萨斯理工大学);National University of Singapore(新加坡国立大学)

Yuanlin Zhang, Roland H. C. Yap

摘要:

函数约束和双函数约束是约束程序设计(CP)系统中的一个重要约束类,特别是对于约束逻辑程序设计(CLP)系统。具有有限域约束的CP系统通常采用基于CSP的求解器,其使用局部一致性,例如,弧一致性。我们引入了一种新的方法,而不是基于变量替换。我们得到有效的算法,减少系统涉及功能和双功能的约束以及其他非功能性约束。它还全局解决任何CSP,其中存在一个变量,使得任何其他变量都可以通过一系列功能约束从它到达。我们在随机问题上的实验表明,变量消除可以显着提高求解函数约束问题的效率。

英文摘要:

Functional constraints and bi-functional constraints are an important constraint class in Constraint Programming (CP) systems, in particular for Constraint Logic Programming (CLP) systems. CP systems with finite domain constraints usually employ CSP-based solvers which use local consistency, for example, arc consistency. We introduce a new approach which is based instead on variable substitution. We obtain efficient algorithms for reducing systems involving functional and bi-functional constraints together with other non-functional constraints. It also solves globally any CSP where there exists a variable such that any other variable is reachable from it through a sequence of functional constraints. Our experiments on random problems show that variable elimination can significantly improve the efficiency of solving problems with functional constraints.

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

↑