We would like to encourage you to contribute to Gecode. Currently, the following projects contribute to or make use of the Gecode library:
- Savile Row
(St. Andrews University, UK)
Savile Row translates Essence Prime models for Gecode and several other solvers.
(Monash University, Data61 Decision Sciences, University of Melbourne, Australia)
MiniZinc is a free and open-source constraint modeling language and its implementation uses Gecode as the default sover for MiniZinc models.
(KTH and RISE SICS, Sweden)
Unison is a simple, flexible, and potentially optimal tool that performs integrated register allocation and instruction scheduling using constraint programming as a modern method for combinatorial optimization.
(Dep. of Mathematics and Computer Science, University of Perugia, Italy)
is a tool, built on top of Gecode, that is able to solve various problems related to the (Weighted) Abstract Argumentation Frameworks (AFs).
CP(Graph) and CP(Map)
(Département d'ingénierie informatique, Université catholique de Louvain, Belgium)
contributes variables and propagators for finite graphs and maps
(LIFO, University of Orléans, France)
Qecode is a solver for quantified constraint satisfaction problems with restricted quantification built on top of Gecode.
(Eberhard Karls Universität Tübingen, Germany)
The Tübingen Linguistic Parsing Architecture uses Gecode/J as part of a parser for variants of Tree Adjoining Grammar.
(Bioinformatics group, Albert Ludwigs University Freiburg, Germany)
The Constraint based Protein Structure Prediction (CPSP) tools utilize Gecode to calculate optimal structures in 3D lattice protein models.
(Declarative Languages & Artificial Intelligence Group, K.U.Leuven, Belgium)
The Constraint Programming for Itemset Mining (CP4IM) project uses Gecode to solve itemset mining problems.
If you use Gecode in your project and would like it to be listed here, please send us an email. If you want to use the Gecode logo, e.g. to link to our web pages, feel free to download it here.