H ? « ‹ ← → › »

Language peer sets for clp(FD):
United States↑
United States/1994↑
Designed 1994 ↑
1990s languages ↑
Fifth generation↑
Post-Cold War↑

clp(FD)(ID:4033/clp004)

Constraint Programming Language over Finite Domains 

alternate simple view
Country: United States
Designed 1994

for Constraint Programming Language over Finite Domains

Prolog and Constraints over Finite Domains and Booleans

from CMU AI gloss:
"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."

Related languages
CLP → clp(FD)   Extension of

Resources
Search in: Google  Google scholar  World Cat  Yahoo  Overture  DBLP  Monash bib  NZ  IEEE  ACM portal  CiteSeer  CSB  ncstrl  jstor  Bookfinder