Please note that this newsitem has been archived, and may contain outdated information or links.
4 July 2016, 4th International Workshop on Quantified Boolean Formulas (and Beyond) (QBF 2016), Bordeaux, France
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 the theory and practice of QBF solving throughout the past years.
The goal of the International Workshop on Quantified Boolean Formulas (and Beyond) is to bring together researchers working on theoretical and practical aspects of QBF solving and related formalisms involving quantifiers. The workshop addresses theoreticians and practitioners in order to reflect on the state of the art in research and to consolidate on immediate and long-term challenges. As the efforts of extending languages with quantifiers have not only been made for propositional logic in terms of QBFs, but in many other formalism like Constraint Satisfaction Problem (CSP) and Satisfiability Modulo Theories (SMT), QBF 2016 also targets researchers working in these related fields in order to exchange experiences and ideas.
For more information, see http://fmv.jku.at/qbf16/
We solicit paper submissions in the following categories: talk-only papers (presenting work that has been published already, novel unpublished work, or work in progress), full papers (describing novel, unpublished work, including work in progress) and short tutorial presentations (on topics related to the workshop). Deadline for submissions: 8 May 2016.
Please note that this newsitem has been archived, and may contain outdated information or links.