CLP(B): Boolean Constraints in Prolog

System Descriptions:
Library documentation:

Benchmarks: benchmarks.tar.gz

SICStus port:

Performance profiles: performance_analysis.tar.gz

Prolog facts expressing the contiguous United States and DC as they appear in SGB:

Using CLP(B) to compute independent sets, maximal independent sets, and maximum weighted kernels of the cycle graph C100:

Using CLP(B) to solve a matchsticks puzzle (remove the minimum number of matchsticks so that no subsquares remain):

More CLP(B) usage examples:

A ZDD-based variant of the library is available from:

More about Prolog: The Power of Prolog

In particular: Logic Puzzles

Please write to or use the clpb tag on Stackoverflow if you have any questions about CLP(B).

Thank you for your interest!

Markus Triska, May 28th, 2016

Main page