2024
A Top-Down Tree Model Counter for Quantified Boolean Formulas
IJCAI 2024poster
This paper addresses the challenge of solution counting for Quantified Boolean Formulas (QBFs), a task distinct from the well-established model counting problem for SAT (\#SAT). Unlike SAT, where models are straightforward assignments to Boolean variables, QBF solution counting involves tree models…