You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
A high-performance C++17 benchmarking suite comparing classical SAT solving algorithms (CDCL, DPLL, Davis-Putnam, Resolution). Includes a custom DIMACS CNF generator in Python and comprehensive performance metrics for 2SAT and 3SAT instances.
In this project, you can see the implementation of the Davis-Putnam (DP) + Davis-Putnam-Logemann-Loveland (DPLL) Algorithms and Resolution to solve SAT problems.