Gecode: Projects
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 translates Essence Prime models for Gecode and several other solvers.
-
MiniZinc is a free and open-source constraint modeling language and its implementation uses Gecode as the default solver for MiniZinc models.
-
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.
-
ConArg is a tool, built on top of Gecode, that is able to solve various problems related to the (Weighted) Abstract Argumentation Frameworks (AFs).
-
Contributes variables and propagators for finite graphs and maps.
-
Qecode is a solver for quantified constraint satisfaction problems with restricted quantification built on top of Gecode.
-
The Tübingen Linguistic Parsing Architecture uses Gecode/J as part of a parser for variants of Tree Adjoining Grammar.
-
The Constraint based Protein Structure Prediction (CPSP) tools utilize Gecode to calculate optimal structures in 3D lattice protein models.
-
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, for example to link to our web pages, feel free to download it here.