International
Workshop on Quantified Boolean Formulas
and Beyond
colocated with the
Federated Logic Conference 2018 (FLoC), Oxford, UK
News
Important Dates
-
May 01: Submission
-
May 15: Notification
-
May 25: Camera-Ready Version
-
July 08: Workshop
Workshop @ FLoC 2018
Oxford, UK
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:
- Directions of Solver Development
- Certificates
- Applications
- Community platform and repository
Important Information
We are looking forward to a successful workshop, and to
seeing you in Oxford!
Contact
qbf18@easychair.org
Acknowledgements
-
The joint session with PC 2018 is partly funded by EPSRC (Doctoral Prize Fellowship of Leroy Chew).
Previous Editions and related events