Gecode

Gecode (for Generic Constraint Development Environment) is a software library for solving Constraint satisfaction problems. It is programmed in C++ and distributed as free software under the permissive MIT license. Gecode has bindings for several programming languages such as Prolog, Python and Ruby, and an interface to the AMPL modeling language.

The development of Gecode has been led by Christian Schulte,[1] but has been contributed to by many other researchers and programmers, including Denys Duchier, Filip Konvicka, Gabor Szokoli, Guido Tack, Håkan Kjellerstrand, Mikael Lagerkvist, Patrick Pekczynski, Raphael Reischuk, and Tias Guns.[2]

The first release of Gecode was in December 2005.[3] Since then, Gecode has rapidly become one of the most prominent constraint programming systems. Reasons for this are that it runs fast, is extensible, free and open source under a permissive licence, and is written in a popular language. As well as being very useful in its own right, its extensibility and licensing makes it highly suitable for use on other projects.[4] Gecode has been ported to several language, for instance, Gelisp is a wrapper of Gecode for Lisp.[5]

Gecode is a regular participant in the MiniZinc Challenge, a benchmark of constraint solvers organized by the NICTA research centre. It came in first place in all categories in the years 2009, 2010 , 2011 , and 2012 .

References

Notes
  1. Statement on Christian Schulte's web page, Nov 10 2009
  2. Gecode Documentation list of authors, Nov 10 2009
  3. Gecode changelog
  4. List of projects using Gecode
  5. Mauricio Toro, Carlos Agon, Camilo Rueda, Gerard Assayag. "GELISP: A FRAMEWORK TO REPRESENT MUSICAL CONSTRAINT SATISFACTION PROBLEMS AND SEARCH STRATEGIES." Journal of Theoretical and Applied Information Technology 86 (2). 2016. 327-331.


This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.