The funsat package

[Tags: bsd3, library, program]

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.


Properties

Versions0.4, 0.5, 0.5.1, 0.5.2, 0.6.0, 0.6.1, 0.6.2
Dependenciesarray (==0.2.*), base (>=3 && <5), bimap (==0.2.*), bitset (==0.*), containers (==0.2.*), fgl (>=5 && <=5.4.2.2), mtl (==1.*), parse-dimacs (>=1.2 && <2), pretty (<2), QuickCheck (<2), random (<2), time (<1.2)
LicenseBSD3
AuthorDenis Bueno
MaintainerDenis Bueno <dbueno@gmail.com>
Stabilitybeta
CategoryAlgorithms
Home pagehttp://github.com/dbueno/funsat
Executablesfunsat
UploadedSat Jun 26 20:43:58 UTC 2010 by DenisBueno
Downloads689 total (37 in last 30 days)
StatusDocs pending
Build status unknown [no reports yet]

Modules

Downloads

Maintainers' corner

For package maintainers and hackage trustees