clpfd
swMATH ID:  6308 
Software Authors:  Triska, Markus 
Description:  We present a new constraint solver over finite domains, freely available as library(clpfd) in SWIProlog. Our solver has several unique features, which we describe in this paper: Reasoning over arbitrarily large integers, always terminating propagation, and a domainspecific 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. 
Homepage:  http://www.swiprolog.org/man/clpfd.html 
Programming Languages:  SWIProlog 
Related Software:  SWIProlog; XSB; SICStus; Prolog; jPET; ATGen; Pex; ACIDE; NP Datalog; Ciao; Gecode; COMET; BProlog; YAPProlog; Datalog; CSPLib 
Cited in:  5 Documents 
Further Publications:  http://www.swiprolog.org/Publications.txt 
Standard Articles
1 Publication describing the Software  Year 

The finite domain constraint solver of SWIProlog Triska, Markus 
2012

all
top 5
Cited by 13 Authors
Cited in 3 Serials
2  Annals of Mathematics and Artificial Intelligence 
1  Science of Computer Programming 
1  The Journal of Logic and Algebraic Programming 
Cited in 3 Fields
5  Computer science (68XX) 
1  Mathematical logic and foundations (03XX) 
1  Operations research, mathematical programming (90XX) 