International Workshop on Quantified Boolean Formulas

colocated with the
16th Int. Conf. on Theory and Applications of Satisfiability Testing


Important Dates

  • Paper Submission: 08.05.2013
  • Notification of Acceptance: 22.05.2013
  • Camera Ready: 15.06.2013
  • Workshop: June 9 2013, 09:00 - 12:30
  • Workshop Report

Workshop @ SAT 2013

Helsinki, Finland


Quantified Boolean formulas (QBF) are an extension of propositional logic which allows for explicit quantification over propositional variables. The decision problem of QBF is PSPACE-complete compared to NP-completeness of the decision problem of propositional logic (SAT).

Many problems from application domains such as model checking, formal verification or synthesis are PSPACE-complete, and hence could be encoded in QBF. Considerable progress has been made in QBF solving throughout the past years. However, in contrast to SAT, QBF is not widely applied to practical problems in industrial settings. For example, the extraction and validation of models of (un)satisfiability of QBFs and has turned out to be challenging.

The goal of the International Workshop on Quantified Boolean Formulas (QBF Workshop) is to bring together researchers working on theoretical and practical aspects of QBF solving. The aim of this workshop is to provide an interactive platform for discussing recent advancements and alternative approaches for solving QSAT. In addition to that, it addresses (potential) users of QBF in order to reflect on the state-of-the-art and to consolidate on immediate and long-term research challenges.

Important Information

We are looking forward to a successful workshop, and to seeing you in Helsinki!