A fast and certifying solver for quantified Boolean formulas.
-
Updated
Apr 30, 2024 - C
A fast and certifying solver for quantified Boolean formulas.
A minimal implementation of an expansion-based QBF solver which does not use recursion.
Add a description, image, and links to the qbf-solver topic page so that developers can more easily learn about it.
To associate your repository with the qbf-solver topic, visit your repo's landing page and select "manage topics."