funsat: A modern DPLL-style SAT solver
Funsat is a native Haskell SAT solver that uses modern techniques for solving SAT instances. Current features include two-watched literals, conflict-directed learning, non-chronological backtracking, a VSIDS-like dynamic variable ordering, and restarts. Our goal is to facilitate convenient embedding of a reasonably fast SAT solver as a constraint solving backend in other applications. Currently along this theme we provide unsatisfiable core generation (see Funsat.Resolution) and a logical circuit interface (see Funsat.Circuit). New in 0.6: circuits and BSD3 license.
| Versions | 0.4, 0.5, 0.5.1, 0.5.2, 0.6.0 |
|---|---|
| Dependencies | array, base, bimap (>=0.2 && <0.3), bitset (<1), containers, fgl, mtl, parse-dimacs (>=1.2 && <2), pretty, QuickCheck (<2), random, time |
| License | BSD3 |
| Author | Denis Bueno |
| Maintainer | Denis Bueno <dbueno@gmail.com> |
| Stability | beta |
| Category | Algorithms |
| Home page | http://github.com/dbueno/funsat |
| Executables | funsat |
| Upload date | Fri Apr 17 22:51:25 UTC 2009 |
| Uploaded by | DenisBueno |
| Built on | ghc-6.10, ghc-6.12 |
| Distributions | Arch: 0.6.0 |
Modules
- Control
- Funsat
- Text
Downloads
- funsat-0.6.0.tar.gz (Cabal source package)
- package description (included in the package)