Prev Next Up Home Keys Figs Search New

clp(FD) v2.1

Keywords: constraints.

The new version of clp(FD) is available by FTP.

clp(FD) is a constraint logic programming language over Finite Domains. clp(FD) is based on the wamcc Prolog compiler. clp(FD) provides several constraints "a la CHIP" on Finite Domains and Booleans and some facilities to build new constraints. clp(FD) is 4 times faster than CHIP v3.2 on average.

The release consists of a compiler from clp(FD) to C, a FD solver, a runtime system, and a debugger.

It is located at ftp://ftp.inria.fr/INRIA/Projects/ChLoE/LOGIC_PROGRAMMING/clp_fd

It has been ported to Sparc workstations, but should work on most 32-bit machines with gcc. It requires GNU C (gcc) version 2.4.5 or higher.

For more information, contact the author:

Daniel Diaz 
INRIA Rocquencourt, France
Email: Daniel.Diaz@inria.fr
Prev Next Up Home Keys Figs Search New