https://github.com/archywillhe/haskell-dpll-sat-solver

Classical DPLL Algorithm for solving SAT
https://github.com/archywillhe/haskell-dpll-sat-solver

Last synced: about 1 year ago
JSON representation

Classical DPLL Algorithm for solving SAT

• Host: GitHub
• URL: https://github.com/archywillhe/haskell-dpll-sat-solver
• Owner: archywillhe
• License: mit
• Created: 2015-07-16T18:07:45.000Z (almost 11 years ago)
• Default Branch: master
• Last Pushed: 2015-08-05T14:55:40.000Z (almost 11 years ago)
• Last Synced: 2025-05-14T11:17:42.592Z (about 1 year ago)
• Language: Haskell
• Homepage:
• Size: 133 KB
• Stars: 2
• Watchers: 1
• Forks: 2
• Open Issues: 0
• Metadata Files:
  • Readme: readme.md
  • License: LICENSE

Awesome Lists containing this project

README

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

It uses a Happy parser for parsing [CNF](https://en.wikipedia.org/wiki/Conjunctive_normal_form) formula in [DIMACS](http://www.satcompetition.org/2009/format-benchmarks2009.html).

To run it simply do

```

cabal install alex

cabal install happy

cabal configure

cabal run < cnf

```