@hackage incremental-sat-solver0.1.6

Simple, Incremental SAT Solving as a Library

Categories
- Algorithms
License
BSD-3-Clause
Maintainer
sebf@informatik.uni-kiel.de
Links
Versions
- 0.1.8 Wed, 31 Aug 2016
- 0.1.7 Sat, 31 Jan 2009
- 0.1.6 Sat, 31 Jan 2009
- 0.1.5 Fri, 30 Jan 2009
- 0.1.4 Fri, 30 Jan 2009
- 0.1.3 Fri, 30 Jan 2009

Installation
In your cabal file:
Dependencies (3)
Dependents (4)
@hackage/acme-everything, @hackage/alms, @hackage/logic-classes, @hackage/cflp

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.

@hackage incremental-sat-solver0.1.6

Categories

License

Maintainer

Links

Versions

Installation

Dependencies (3)

Dependents (4)