Gecode Environment for developing constraint-based systems and applications
Download

Gecode Ranking & Summary

Gecode Tags

development develop development environment application development constraint constraint development

Gecode Description

Environment for developing constraint-based systems and applications Gecode (Generic constraint development environment) is an open, portable, free, accessible, and efficient environment for developing constraint-based systems and applications.Gecode features a generic kernel on top of which modules such as search, finite domain integer constraints, and so on are provided. Here are some key features of "Gecode": · Open: Gecode is radically open for programming: it can be easily interfaced to other systems. It supports the programming of new propagators (as implementation of constraints), branching strategies, and search engines. New variable domains can be programmed at the same level of efficiency as finite domain and integer set variables that come predefined with Gecode. · Free: Gecode is distributed under the MIT license and is listed as free software by the FSF. All of its parts including documentation, implementations of global constraints, and examples are available as source code for download. · Portable: Gecode is implemented in C++ that carefully follows the C++ standard. It can be compiled with modern C++ compilers and runs on a wide range of machines (including 64bit machines). · Accessible: Gecode comes with extensive reference documentation that allows to focus on different programming tasks with Gecode. In the near future, we intend to release tutorial documentation explaining the various programming tasks in more detail. · Efficient: Gecode offers competitive performance with respect to both runtime and memory usage. A comparison with some other systems is available. What's New in This Release: Kernel: Bug fixes: · Added missing assignment operator for space-based allocators for STL data structures. (minor, thanks to Gustavo Gutierrez) Search engines: Bug fixes: · The memory reported could be sometimes too low (the previous fix for 3.2.0 did not fix it for branch and bound search). (minor) Finite domain integers: Additions: · Added sequence constraint. (major , contributed by David Rijsman) Bug fixes: · The global cardinality (count) constraint now accepts unsorted arrays of values. It previously propagated incorrectly if the array was not sorted. (minor, thanks to Alberto Delgado) · Fixed bug in the ICL_VAL propagator for global cardinality. (minor) · Subscription to constant views did not honor the flag to avoid processing. (minor) Finite integer sets: Bug fixes: · Subscription to constant views did not honor the flag to avoid processing (did not occur in practice). (minor) Script commandline driver: Additions: · Report if search engine has been stopped. (minor) Range and value iterators: Other changes: · Renamed test for subset or disjointness of range iterators to "compare". (minor) Example scripts: Additions: · Added car sequencing example (problem 1 in CSPLib). Uses the new sequence-constraint. (minor) Gecode/FlatZinc: Bug fixes: · Support search annotations with constants in the variable arrays. (minor, thanks to H?kan Kjellerstrand) · The set_in and set_in_reif constraints were buggy when used with Boolean variables (which are usually not generated by mzn2fzn so that the issue probably does not occur in practice). (minor) · The global_cardinality constraint was not completely compatible with the MiniZinc semantics. It would constrain values not mentioned in the array to have zero occurrences, while in MiniZinc they are unrestricted. (minor) · Element constraints in reified positions produced an error in the mzn2fzn translation. (major, thanks to H?kan Kjellerstrand)

Gecode Related Software