incremental-sat-solver

Simple, Incremental SAT Solving as a Library http://github.com/sebfisch/incremental-sat-solver

Latest on Hackage:

0.1.8

This package is not currently in any snapshots. If you're interested in using it, we recommend adding it to Stackage Nightly. Doing so will make builds more reliable, and allow stackage.org to host generated Haddocks.

BSD3 licensed by Sebastian Fischer

Maintained by sebf@informatik.uni-kiel.de

Simple, Incremental SAT Solving as a Library
============================================

This Haskell library provides an implementation of the
Davis-Putnam-Logemann-Loveland algorithm
(cf. <http://en.wikipedia.org/wiki/DPLL_algorithm>) for the boolean
satisfiability problem. It not only allows to solve boolean formulas
in one go but also to add constraints and query bindings of variables
incrementally.

The implementation is not sophisticated at all but uses the basic DPLL
algorithm with unit propagation.

Depends on:

base, containers, mtl

Used by 2 packages:

alms, cflp