clpfd swMATH ID: 6308 Software Authors: Triska, Markus Description: 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. Homepage: http://www.swi-prolog.org/man/clpfd.html Programming Languages: SWI-Prolog Related Software: SWI-Prolog; XSB; SICStus; Prolog; jPET; ATGen; Pex; ACIDE; NP Datalog; Ciao; Gecode; COMET; B-Prolog; YAP-Prolog; Datalog; CSPLib Cited in: 5 Documents Further Publications: http://www.swi-prolog.org/Publications.txt Standard Articles 1 Publication describing the Software Year The finite domain constraint solver of SWI-Prolog Triska, Markus 2012 all top 5 Cited by 13 Authors 2 Bergenti, Federico 2 Monica, Stefania 1 Aranda-López, Gabriel 1 Demoen, Bart 1 Desouter, Benoit 1 Körner, Philipp 1 Krings, Sebastian 1 Nieva, Susana 1 Nogatz, Falco 1 Sáenz-Pérez, Fernando 1 Sánchez-Hernández, Jaime 1 Schrijvers, Tom 1 Triska, Markus 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 (68-XX) 1 Mathematical logic and foundations (03-XX) 1 Operations research, mathematical programming (90-XX) Citations by Year