QBF Proofs and Certificates (Research Project)
Funding organization: Austrian Science Fund (FWF)
Project number: (ESP 197 ESPRIT-Programm)
Leroy Chew (PI)
Quantified Boolean Formulas (QBF) extends propositional logic. Solving a QBF is theoretically more difficult than solving a propositional SAT (satisfiability) problem. QBFs are canonically PSPACE complete, meaning solving them could be used to solve any PSPACE problem by proxy. In the last decade progress in QBF solving is being undertaken. Proof complexity is the main theoretical framework used to understand SAT and QBF solving. Proof systems use the same logical rules as sound solvers, the proof size can often be a lower bound of running time between proof systems and related solvers. Proof systems can also be used to certify the correctness of solvers. However certification of QBF solvers is not yet a common occurrence.
We wish to further study the landscape of QBF proof complexity, studying the existing QBF proof systems that have emerged to capturing the solvers over the last decade. We also wish to use knowledge of soundness and complexity to make minor and major modifications to QBF proof systems, that could be beneficial to theory and practice. Our hope is that such knowledge will be of use to the QBF solving community.