International
Workshop on Quantified Boolean Formulas
colocated with the
18th Int. Conf. on Theory and Applications of Satisfiability Testing
News
Important Dates
-
Submission Deadline: July 20 2015
-
Author Notification: August 12 2015
-
Workshop: September 23 2015
Workshop @ SAT 2015
Austin, Texas, USA
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.
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 to 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.
Important Information
We are looking forward to a successful workshop, and to
seeing you in Austin!
Contact
qbf2015@easychair.org
Previous Editions