Please note that this newsitem has been archived, and may contain outdated information or links.
7 July 2019, International Workshop on Quantified Boolean Formulas and Beyond (QBF 2019), Lisbon, Portugal
Quantified Boolean formulas (QBF) are an extension of propositional logic which allows for explicit quantification over propositional variables. Many problems from application domains such as model checking, formal verification or synthesis can be encoded as a QBF in a natural way. Considerable progress has been made in QBF solving throughout the past years. However, in contrast to SAT, QBF is not yet widely applied to practical problems in academic or industrial settings. The goal of the International Workshop on Quantified Boolean Formulas and Beyond (QBF 2019) 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. The workshop also welcomes work on reasoning with quantifiers in related problems, such as dependency QBF (DQBF), quantified constraint satisfaction problems (QCSP), and satisfiability modulo theories (SMT) with quantifiers.
Submissions of extended abstracts are invited and will be managed via Easychair. The following forms of submissions are solicited:
- Proposals for short tutorial presentations on topics related to the workshop.
- Talk abstracts reporting on already published work.
- Talk proposals presenting work that is unpublished or in progress.
Submissions which describe novel applications of QBF or related formalisms in various domains are particularly welcome. Additionally, this call comprises known applications that have been shown to be hard for QBF solvers in the past as well as new applications for which present QBF solvers might lack certain features still to be identified.
Please note that this newsitem has been archived, and may contain outdated information or links.