Gecode for Linux 3.7.1
Gecode is a toolkit for developing constraint-based systems and applications. Gecode provides a constraint solver with state-of-the-art performance while being modular and extensible. Gecode is:
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...
Price: USD $0.00;
License: Freeware
File Size: 41984 KB;
Platform: Linux

Gecode x64 3.7.1
Gecode is a toolkit for developing constraint-based systems and applications. Gecode provides a constraint solver with state-of-the-art performance while being modular and extensible. Gecode is:
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...
Price: USD $0.00;
License: Freeware
File Size: 41984 KB;
Platform: Windows XP, Windows , Windows Vista x64,Windows 7 x64

Gecode for Mac OS X 3.7.1
Gecode is a toolkit for developing constraint-based systems and applications. Gecode provides a constraint solver with state-of-the-art performance while being modular and extensible. Gecode is:
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...

Stochastic Local Search Based CSP Solver 4.6.0
Stochastic Local Search Based CSP Solver use stochastic local search algorithms to solve constraint satisfaction problems. Constraint satisfaction problems (CSPs) are pervasive in AI problems. A constraint satisfaction problem is the problem of assigning values to variables that satisfy some constraints. This CSP solver uses stochastic local search algorithms to attempt to find assignments to the variables which satisfy the constraints using...

Consistency Based CSP Solver 4.6.1
Consistency Based CSP Solver create and solve constraint satisfaction problem. Constraint satisfaction problems (CSPs) are pervasive in AI problems. A constraint satisfaction problem is the problem of assigning values to variables that satisfy some constraints. This constraint satisfaction problem solver (arc consistency) tool is designed to help you learn about solving CSPs with a systematic search technique called arc consistency.Consistency...

GNU Prolog for Linux 1.4.0
What is GNU Prolog
GNU Prolog is a free Prolog compiler with constraint solving over finite domains developed by Daniel Diaz.
GNU Prolog accepts Prolog+constraint programs and produces native binaries (like gcc does from a C source). The obtained executable is then stand-alone. The size of this executable can be quite small since GNU Prolog can avoid to link the code of most unused built-in predicates. The performances of GNU Prolog are...

GNU Prolog for Windows (x64 bit) 1.4.0
What is GNU Prolog
GNU Prolog is a free Prolog compiler with constraint solving over finite domains developed by Daniel Diaz.
GNU Prolog accepts Prolog+constraint programs and produces native binaries (like gcc does from a C source). The obtained executable is then stand-alone. The size of this executable can be quite small since GNU Prolog can avoid to link the code of most unused built-in predicates. The performances of GNU Prolog are...

Price: USD $0.00;
License: Freeware
File Size: 4290 KB;
Platform: Windows Vista x64,Windows 7 x64

GNU Prolog for Mac OS X 1.4.0
What is GNU Prolog
GNU Prolog is a free Prolog compiler with constraint solving over finite domains developed by Daniel Diaz.
GNU Prolog accepts Prolog+constraint programs and produces native binaries (like gcc does from a C source). The obtained executable is then stand-alone. The size of this executable can be quite small since GNU Prolog can avoid to link the code of most unused built-in predicates. The performances of GNU Prolog are...

GNU Prolog for Windows (x32 bit) 1.4.0
What is GNU Prolog
GNU Prolog is a free Prolog compiler with constraint solving over finite domains developed by Daniel Diaz.
GNU Prolog accepts Prolog+constraint programs and produces native binaries (like gcc does from a C source). The obtained executable is then stand-alone. The size of this executable can be quite small since GNU Prolog can avoid to link the code of most unused built-in predicates. The performances of GNU Prolog are...

Price: USD $0.00;
License: Freeware
File Size: 4321 KB;
Platform: Windows Vista, Windows , Windows 7

Sudoku X 1.2.2000
This game is the same as sudoku, except that there is an additional constraint that the numbers in the diagonals must not repeat. In this game there will be a grid of 9 x 9 squares, each small grid of 3 x 3 squares is further grouped in to small groups. The object of this game is to fill in the squares with numbers 1 - 9 in such a way that the numbers in each row or column or diagonal must not repeat, and also the numbers in each small group...

Price: USD $0.00;
License: Freeware
File Size: 259 KB;
Platform: Windows 2000, Windows, Windows XP , Win7 x32,Win7 x64,WinServer,WinVista,WinVista x64

a generic NTCC interpreter capable of RT 3.2
Ntccrt is an interpreter for the Non-deterministic Timed Concurrent Constraint (ntcc) calculus and its probabilistic extension (pntcc). It allows to execute models either as a stand-alone program, as a patch in OpenMusic or as an plugin in Max/MSP or PD

Arc Consistency Crossword Compiler 0.1
Arc Consistency Crossword Compiler (arccc) uses constraint satisfaction algorithms to fill crossword grids given a wordlist. The current implementation can fill simple grids in less than a minute. A word list gleaned from a variety of sources is includ

DragonBreath Engine 1.0
The DragonBreath Engine is a constraint solver based on local search. It features real-time computation, handling of dynamics, structural constraint satisfaction, and an easy way to include domain-specific knowledge.

ECLiPSe CLP 1.0
The ECLiPSe Constraint Logic Programming System is designed for solving combinatorial optimization problems, for the development of new constraint solver technology and their hybrids, and for the teaching of modelling, solving and search techniques.

Price: USD $0.00;
License: Freeware
File Size: 7355 KB;
Platform: Windows, Mac, Linux , BSD, Solaris

FRODO: An Open-Source Framework for DCOP 2.10.4
FRODO is a Java platform to solve Distributed Constraint Satisfaction Problems (DisCSPs) and Optimization Problems (DCOPs). It provides implementations for a variety of algorithms, including DPOP (and its variants), ADOPT, SynchBB, DSA...