Constraint programming: Difference between revisions

Revision as of 21:51, 4 December 2005

Revision as of 21:21, 5 January 2006

Line 33:

*[http://choco.sourceforge.net/ Choco] ([[Java programming language|Java]] library, non-commercial)

*[http://www.research.microsoft.com/~youssefh/DisolverWeb/Disolver.html Disolver] ([[C plus plus|C++]] library, commercial)

*[http://www.gecode.org/ Gecode] ([[C plus plus|C++]] library, non-commercial)

*[http://www.ilog.com/products/solver/ ILOG Solver] ([[C plus plus|C++]] library, commercial)

*[http://www.koalog.com/ Koalog Constraint Solver] ([[Java programming language|Java]] library, commercial)

==Finite Domain==

Finite Domains is one of the most successful domains of Constraint Programming. In some areas (like [[Operations research|Operations Research]]) Constraint Programming is often identified with Constraint Programming over Finite Domains.

Line 65 ⟶ 63:

*[http://pubsonline.informs.org/feature/pdfs/0092.2102.01.3106.29.pdf Program Does Not Equal Program: Constraint Programming and its Relationship to Mathematical Programming]

*[http://kti.ms.mff.cuni.cz/~bartak/constraints/index.html On-Line Guide to Constraint Programming]

[[Category:Logic programming]]