CMU Artificial Intelligence Repository
Home INFO Search FAQs Repository Root

clp(FD): Prolog and Constraints over Finite Domains and Booleans

clp(FD) is a constraint logic programming language over finite domains and booleans based on the wamcc Prolog compiler. clp(FD) provides several constraints "a la CHIP" on finite domains and booleans and some facilities for building new constraints. clp(FD) is 4 times faster than CHIP v3.2 on average. Examples include cryptarithms, the Ramsey problem, linear equations, and the N-Queens problem.
See Also: 


Version: 2.2 (1-AUG-94); 2.1 (8-JUN-94) Requires: GCC 2.4.5 or higher Ports: clp(FD) has been tested on Sparc workstations, DEC (Ultrix), Sony MIPS (R3000), and 386/486 PCs under linux. It should be easily ported to 32-bit machines with GCC. Copying: Copyright INRIA. Use, modification, and distribution permitted. Integration in other software also permitted, provided the result is likewise freely distributable. See file named COPYRIGHT for details. Updated: Thu Sep 1 19:46:45 1994 CD-ROM: Prime Time Freeware for AI, Issue 1-1 Bug Reports: Author(s): Daniel Diaz Project ChLoE/INRIA Rocquencourt Institut National de Recherche en Informatique et en Automatique (INRIA) Domaine de Voluceau - Rocquencourt 78153 Le Chesnay Cedex FRANCE Keywords: Authors!Diaz, CLP, Cryptarithms, Finite Domains, Linear Equations, N-Queens, Programming Languages!CLP, Prolog!Implementations, Ramsey Problem References: ?
Last Web update on Mon Feb 13 10:34:25 1995