The incremental-sat-solver package

[Tags: bsd3, 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.


Properties

Versions0.1, 0.1.1, 0.1.2, 0.1.3, 0.1.4, 0.1.5, 0.1.6, 0.1.7
Dependenciesbase, containers, mtl
LicenseBSD3
AuthorSebastian Fischer
Maintainersebf@informatik.uni-kiel.de
Stabilityexperimental
CategoryAlgorithms
Home pagehttp://github.com/sebfisch/incremental-sat-solver
Bug trackermailto:sebf@informatik.uni-kiel.de
Source repositoryhead: git clone git://github.com/sebfisch/incremental-sat-solver.git
UploadedFri Jan 30 17:38:33 UTC 2009 by SebastianFischer
Downloads855 total (60 in last 30 days)
StatusDocs uploaded by user
Build status unknown [no reports yet]

Modules

[Index]

Downloads

Maintainers' corner

For package maintainers and hackage trustees