3.1. Which global constraints are included?
The global constraints of this catalogue come from the following sources:
Existing constraint systems like:
ALICEΒ [Lauriere78],
CHARME in CΒ [OplobeduMarcovitchTourbier89],
CHIPΒ [DincbasVanHentenryckSimonisAggounGrafBerthier88] in Prolog, C and C++ (http://www.cosytec.com),
ChocoΒ [Laburthe00] in Java (http://choco.emn.fr/),
ECLAIRΒ [Platon03] in Claire,
ECLiPSeΒ [ECLiPSe03], [AptWallace07] in Prolog (http://eclipseclp.org/),
FaCile in OCaml (http://www.recherche.enac.fr/opti/facile/),
Gecode in C++Β [Gecode06] (http://www.gecode.org/),
IF/PROLOG in Prolog
(http://www.ifcomputer.com/IFProlog/Constraints/home_en.html),
Ilog SolverΒ [Puget94] in C++ and later in Java (http://www.ilog.com),
JaCoP in Java (http://www.jacop.eu/),
Koalog in Java,
MinionΒ [GentJeffersonMiguel06] (http://minion.sourceforge.net/index.html),
MozartΒ [Smolka96], [Mozart06] in Oz (http://www.mozart-oz.org/),
SICStusΒ [CarlssonOttossonCarlson97] in Prolog (http://www.sics.se/sicstus/).
When available, the Systems slot of a global constraint entry of the catalogue provides the name of the corresponding global constraint in the context of the Choco, Gecode, JaCoP and SICStus systems.
Constraint programming articles mostly from conferences like:
The Principles and Practice of Constraint Programming (CP)
(http://www.informatik.uni-trier.de/~ley/db/conf/cp/index.html),
The International Joint Conference on Artificial Intelligence (IJCAI)
(http://www.informatik.uni-trier.de/~ley/db/conf/ijcai/index.html),
The National Conference on Artificial Intelligence (AAAI)
(http://www.informatik.uni-trier.de/~ley/db/conf/aaai/index.html),
The International Conference on Logic Programming (ICLP)
(http://www.informatik.uni-trier.de/~ley/db/conf/iclp/index.html),
The International Conference of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems (CPAIOR)
Graph constraints from the CP(Graph) computation domainΒ [Dooms06].
New constraints inspired by variations of existing constraints, practical applications, combinatorial problems, puzzles or discussions with colleagues.