An implementation of the Davis-Putnam-Logemann-Loveland (DPLL) algorithm for solving the CNF-SAT problem.
This algorithm decides the satisfiability of propositional logic formulae in conjunctive normal form (CNF) - i.e. an AND of ORs.
-
Notifications
You must be signed in to change notification settings - Fork 1
Davis–Putnam–Logemann–Loveland (DPLL) algorithm implementation
License
ofmooseandmen/dpll
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Davis–Putnam–Logemann–Loveland (DPLL) algorithm implementation
Resources
License
Stars
Watchers
Forks
Packages 0
No packages published