All releases of Koalog Constraint Solver

Release Notes: New constraints and heuristics have been added to
Koalog Constraint Solver. There is now a generic
mechanism to "shave" the variables. The naming
scheme for the constraints is now more uniform.
Finally, the performance of Koalog Constraint
Solver has been improved.

Release Notes: This release contains new constraints. In
particular, a global constraint for matrix
allocation has been added (ColoredMatrix). Various
small fixes increase the overall performance of
the solver.

Release Notes: This version now includes a Local Search solver useful for
solving huge problems when exact methods are too slow.
Exact (Constraint Programming) and approximate (Local
Search) methods are well integrated in the new hierarchy of
solvers. This version is now supported on Java 5.

Release Notes: The API for disjunctive scheduling has been
refactored a lot. In particular, a Disjunctive
constraint has been added which makes the modeling
of problems such as the Job Shop a very easy task.
Moreover, this release includes various
optimizations in choice points, constraints, and
constraint schedulers. Minor bugs have been fixed.

Release Notes: Koalog Constraint Solver has been optimized. This
release also includes new constraints on sets.
Moreover, a new API makes it possible to store
arbitrary data on the choice point stack (allowing
the writing of incremental algorithms for global
constraints).

Release Notes: The Koalog Constraint Solver API has been
simplified a lot, and is now more intuitive and
easy to use. Moreover, many useless constraints
have been removed while some new, more generic
constraints have been addded. Finally, choice
points have been optimized. Many new code examples
are now available from the KCS Web site.

Release Notes: This release includes many new features. Koalog Constraint Solver now includes a solver over set domains (only integer domains were supported in previous releases) and many constraints over set variables: contains, intersection, union, card, etc. Many new global constraints such as GCC, ColoredMatrix, and AllDifferent (a new algorithm) have also been added to the solver, dramatically increasing its efficiency.