Efficient Explaining CSPs with Unsatisfiable Subset Optimization
-
Updated
Jul 2, 2025 - Jupyter Notebook
Efficient Explaining CSPs with Unsatisfiable Subset Optimization
Verifies SAT solver output. Uses drat-trim proof checker for UNSAT instances.
Survey results about active and open applications for unstisfiable subsets
Add a description, image, and links to the unsat topic page so that developers can more easily learn about it.
To associate your repository with the unsat topic, visit your repo's landing page and select "manage topics."