
Hello haskell-cafe, funsat is a modern, DPLL-style SAT solver written in Haskell. Funsat solves formulas in conjunctive normal form and produces a total variable assignment for satisfiable problems. Funsat is intended to be reasonably efficient for practical problems and convenient to use as a constraint-solving backend in other software. Version 0.6 is available from Hackage: * http://hackage.haskell.org/cgi-bin/hackage-scripts/package/funsat New in 0.6: * A representation for logical circuits (and, or, not, onlyif, iff, if-then-else) supporting efficient conversion to CNF (for solving) has been added. * Now uses the BSD3 license. Please report any bugs to the github page linked from hackage. Denis
participants (1)
-
Denis Bueno