Efficient Explaining CSPs with Unsatisfiable Subset Optimization
-
Updated
Jul 2, 2025 - Jupyter Notebook
#
unsat
Here are 8 public repositories matching this topic...
Verifies SAT solver output. Uses drat-trim proof checker for UNSAT instances.
-
Updated
May 25, 2020 - C
-
Updated
Aug 9, 2020 - Python
Counts minimally unsatisfiable (MU) k-SAT formulas via brute-force enumeration, and via a closed-form formula for 2-SAT. An MU formula is an unsatisfiable CNF where removing any single clause restores satisfiability — equivalently, a formula that is its own Minimal Unsatisfiable Subset (MUS).
-
Updated
Feb 14, 2026 - C#
Improve this page
Add a description, image, and links to the unsat topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the unsat topic, visit your repo's landing page and select "manage topics."