tool: clp(FD)


Language:
Prolog + constraints over Finite Domains and Booleans
Version:
2.2
Parts:
compiler clp(FD)->C, FD solver, runtime, debugger.
Author:
Daniel Diaz - INRIA Rocquencourt - FRANCE
Location:
ftp://ftp.inria.fr/INRIA/Projects/ChLoE/LOGIC_PROGRAMMING/clp_fd
Description:
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.

Restriction:
free (see COPYRIGHT notice)
Requires:
GNU C (gcc) version 2.4.5 or higher
Ports:
Sparc workstations, PC under linux, sony mews, dec ultrix
Portability:
Generally to 32-bit machines with gcc.
Contact:
Daniel Diaz <Daniel.Diaz@inria.fr>
Status:
no longer maintained - see GNU Prolog by the same author.
Updated:
August 1st, 1994

Related Items

category: logic programming languages summary, or expanded.


This work supported by Idiom Consulting. Idiom is a full-service ISP, providing Internet access in Northern California and Web hosting worldwide.

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