Classical DPLL Algorithm for solving SAT
Switch branches/tags
Nothing to show
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
src
.gitignore
LICENSE
cnf
readme.md
x.cabal

readme.md

This is a simple implementation of the Classical DPLL Algorithm for solving SAT, written in Haskell

It uses a Happy parser for parsing CNF formula in DIMACS.

To run it simply do

cabal install alex
cabal install happy
cabal configure
cabal run < cnf