The Finite Domain Constraint Solver of SWI-Prolog
The Finite Domain Constraint Solver of SWI-Prolog
复制标题
SWI-Prolog 的有限域约束求解器
DOI：
--
复制
发表时间：
2012
期刊：
影响因子：
--
通讯作者：
Markus Triska
中科院分区：
文献类型：
--
作者：
Markus Triska
我们提出了一种新的有限域约束求解器，可以在 SWI-Prolog 中作为库 (clpfd) 免费使用。我们的求解器有几个独特的功能，我们在本文中进行了描述：对任意大整数进行推理，始终终止传播，以及简洁地表达约束具体化的完整语义的特定于领域的语言。该库完全用 Prolog 编写，可以轻松移植到其他支持属性变量的 Prolog 系统。该约束求解器的速度足以满足教学和研究目的，并且已经在法国、德国、意大利、奥地利和其他国家的几所大学的课程中使用。
We present a new constraint solver over finite domains, freely available as library(clpfd) in SWI-Prolog. Our solver has several unique features, which we describe in this paper: Reasoning over arbitrarily large integers, always terminating propagation, and a domain-specific language that concisely expresses the full semantics of constraint reification. The library is entirely written in Prolog and can be easily ported to other Prolog systems that support attributed variables. The constraint solver is fast enough for teaching and research purposes and is already being used in courses at several universities in France, Germany, Italy, Austria and other countries.