Program to determine whether a given Boolean formula, represented in Conjunctive Normal Form, can be satisfied.
- Unit Propagation
- Pure Literal Elimination
- Recursive Splitting
-
Notifications
You must be signed in to change notification settings - Fork 0
pedronunes19/ssats
About
[WIP] simple SAT Solver implemented in Haskell
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published