CLP(B): Boolean Constraints in Prolog
New: As of October 2019, CLP(B) ships
with Scryer Prolog.
Post ?- use_module(library(clpb)). to use it.
Publications about CLP(B):
More about Prolog: The Power of Prolog
In particular: Logic Puzzles
Benchmarks:
benchmarks.tar.gz
SICStus
port: clpb.pl
Performance profiles:
performance_analysis.tar.gz
Prolog facts expressing the contiguous United States and
DC as they appear in SGB: edges.pl
Using CLP(B) to compute independent sets, maximal
independent sets, and maximum weighted kernels of the cycle
graph C100: kernels.pl
Using CLP(B) to solve a matchsticks puzzle (remove the minimum number of matchsticks so that no subsquares remain): matchsticks.pl
More CLP(B) usage
examples: github.com/triska/clpb
A ZDD-based variant of the library is available from: https://github.com/triska/clpb/tree/master/zdd
Please write
to triska@metalevel.at or
use the clpb tag
on Stackoverflow if you
have any questions about CLP(B).
Thank you for your interest!
Main page