Refinement-Based Enumeration of QBF Solutions

Download PDF
Open Webpage

Andreas Plank, Clemens Hofstadler, Maximilian Heisinger, Martina Seidl

Published: 2025, Last Modified: 26 May 2026JELIA (2) 2025EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: Counting the number of solutions of true and false quantified Boolean formulas (QBFs) has received increased interest in recent years. However, the explicit enumeration of all solutions for a QBF is almost unexplored so far. For QBF solution counting, it has been shown that enumeration-based counting as employed in SAT is not complete for QBF. Solution enumeration runs into the same problem.