| Prolog + constraints over Finite Domains and Booleans | |
| 2.2 | |
| compiler clp(FD)->C, FD solver, runtime, debugger. | |
| Daniel Diaz - INRIA Rocquencourt - FRANCE | |
| ftp://ftp.inria.fr/INRIA/Projects/ChLoE/LOGIC_PROGRAMMING/clp_fd | |
|
clp(FD) is a constraint logic programming language
over Finite Domains. clp(FD) is based on the wamcc
Prolog compiler which translates Prolog to C.
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. | |
| free (see COPYRIGHT notice) | |
| GNU C (gcc) version 2.4.5 or higher | |
| Sparc workstations, PC under linux, sony mews, dec ultrix | |
| Generally to 32-bit machines with gcc. | |
| Daniel Diaz <Daniel.Diaz@inria.fr> | |
| no longer maintained - see GNU Prolog by the same author. | |
| August 1st, 1994 |
category: logic programming languages summary, or expanded.
Please send updates to free-compilers@idiom.com
The HTML is maintained by David Muir Sharnoff and the entries themselves are currently maintained by Bryan Miller.
Copyright (c) 1992-1998 David Muir Sharnoff, All Rights Reserved
Copyright (c) 1994-1996, Steven Allen Robenalt, All Rights Reserved