What’s New In QBF Solving? : (Invited Talk)

Quantified Boolean Formulas (QBFs) extend propositional formulas by quantifiers over the Boolean variables. This extension makes the QBF decision problem PSPACE-hard. Therefore, QBFs provide an attractive reasoning framework for many reasoning problems from artificial intelligence, formal verification, and other fields. In this work, we review current advancements in the theory and practice of QBF solving.