Abstract
AbstractWe lift the problem of enumerative solution counting to quantified Boolean formulas (QBFs) at the second quantifier block. In contrast to the well-explored model counting problem for SAT (#SAT), where models are simply assignments to the Boolean variables of a formula, we are now dealing with tree (counter-)models reflecting the dependencies between the variables of the first and the second quantifier block. It turns out that enumerative counting on the second level does not give the complete solution count and more fine-grained view is necessary. We present a level-2 solution counting approach that works for true and false formulas. We implemented the presented approach in a counting tool exploiting state-of-the-art QBF solving technology. We present several kinds of benchmarks for testing our implementation and show that even with this very basic approach of solution enumeration the solution counts of challenging benchmarks can be found.
Funder
Johannes Kepler University Linz
Publisher
Springer Science and Business Media LLC
Reference25 articles.
1. Shukla, A., Biere, A., Pulina, L., & Seidl, M. (2019). A survey on applications of quantified Boolean formulas. In Proc. of the Int. Conf. on Tools with Artificial Intelligence (pp. 78–84). IEEE, USA.
2. Beyersdorff, O., Mikolás, J., Lonsing, F., & Seidl, M. (2021). Quantified Boolean Formulas. Handbook of Satisfiability (Vol. 336, pp. 1177–1221). Amsterdam, Netherlands: IOS Press.
3. Pulina, L., & Seidl, M. (2019). The 2016 and 2017 QBF solvers evaluations (QBFEVAL’16 and QBFEVAL’17). Artificial Intelligence, 274, 224–248.
4. Ladner, R. E. (1989). Polynomial space counting problems. SIAM Journal on Computing, 18(6), 1087–1097.
5. Gomes, C. P., Sabharwal, A., & Selman, B. (2021). Model counting. In Handbook of Satisfiability (pp. 993–1014). IOS Press, Amsterdam, Netherlands.