mirror of
https://github.com/abhamra/verified-CDCL-datastructures
synced 2026-11-12 00:41:03 -08:00
No description
- Lean 100%
| images | ||
| VerifiedCdclDatastructures | ||
| .gitignore | ||
| 8803_final_proj.zip | ||
| Final Report.pdf | ||
| lake-manifest.json | ||
| lakefile.lean | ||
| lean-toolchain | ||
| LICENSE | ||
| proj_pres.md | ||
| proj_pres.pdf | ||
| README.md | ||
| VerifiedCdclDatastructures.lean | ||
Verified CDCL Data Structures
Arjun Bhamra and Cameron Hoechst
As a part of our 8803 Special Topics course on SAT/SMT Solvers, we are aiming to create a verified set of data structures for use in the CDCL SAT Solver algorithm. The data structures we intend to focus on are:
- Conflict/Implication Graph
- (Conflict) Clauses
- Partial (Learned) Clause Database
- Assignment Trail
Later on, we may begin leveraging these data structures to implement CDCL properly.