The clp(FD,S) language

• What is clp(FD,S)?
• Features of the solver
• Documentation
• Ports & Distribution
• Feedback

What is clp(FD,S)?

clp(FD,S) is a semiring-based Constraint Logic Programming language over Finite Domains. This means that it includes a Prolog and a solver for semiring-based constraints over finite domains.

Features of the solver

The main feature of clp(FD,S) is the fact that it handles valued constraints. More precisely, given a valuation structure S (namely a semiring), clp(FD,S) is a solver for constraints valued in S.

For example, different instances of clp(FD,S) allow the resolution of:

• usual CSPs,
• Fuzzy CSPs,
• hierarchical CSPs and others...

Moreover, clp(FD,S) provides a lot of builtin:

• arithmetic constraints,
• boolean constraints,
• meta constraints,
• optimization constraints,
• global constraints,
• predicates for constraints retraction

Documentation

For the moment, a single document which contains a user's manual and a reference manual:

• [zip'ed postscript, 86k]
• [html]

Ports & Distribution

clp(FD,S) is ported on:

• Solaris
• SunOS
• GNU-Linux (i86)

The last version can be downloaded from here and should be installed following this procedure.

Feedback

I appreciate to get feedback from clp(FD,S) users but, unfortunately, i don't have time to maintain it anymore.