incremental-sat-solver
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.
Ecosystem
hackage.haskell.org
hackage.haskell.org
Latest Release
over 9 years ago
0.1.8
over 9 years ago
Versions
9
9
Downloads
7,562 total
7,562 total
Dependent Repos
1
1
Loading...
Readme
Loading...
Links
| Registry | hackage.haskell.org |
| Source | Repository |
| Homepage | Homepage |
| JSON API | View JSON |
| CodeMeta | codemeta.json |
Package Details
| PURL |
pkg:hackage/incremental-sat-solver
spec |
| License | BSD-3-Clause |
| First Release | about 17 years ago |
| Last Synced | 17 days ago |
Repository
| Stars | 15 on GitHub |
| Forks | 3 on GitHub |