An easy implementation of a SAT solver to solve satisfiability problems.
- 2 Literal Watching
- Recursive DPLL
- Chronological Backtracking
- Conflict Clause Learning
- Non-Chronological Backtracking
- Learnt Clause Minimization
- Phase saving
To be released.
Feel free to email me at [email protected] or open an issue here if you have any ideas.