Skip to content

Home

dbueno edited this page · 5 revisions
Clone this wiki locally

Welcome to the funsat wiki!

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, giving
(hopefully) small unsatisfiable sub-problems of unsatisfiable input problems
(see “Funsat.Resolution”); and a circuit library for expressing propositional logic
(see “Funsat.Circuit”).

Something went wrong with that request. Please try again.