International Workshop on Quantified Boolean Formulas and Beyond

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

News

Important Dates

  • May 25: Submission
  • June 5: Notification
  • June 15: Camera-Ready Version
  • July 7: Workshop

Overview

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. 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.

In particular, the following topics shall be considered at the workshop:

  1. Directions of Solver Development
  2. Certificates
  3. Applications
  4. Community platform and repository
    1. Contact

      qbf19@easychair.org

      Previous Editions and Related Events