QBF18: International Workshop on Quantified Boolean Formulas and Beyond |
Website | http://fmv.jku.at/qbf18/ |
Submission link | https://easychair.org/conferences/?conf=qbf18 |
Conference program | https://easychair.org/smart-program/FLoC2018/ |
Abstract registration deadline | May 1, 2018 |
Submission deadline | May 1, 2018 |
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 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.
We are very pleased to announce that QBF 2018 will feature a joint session with the Int. Workshop on Proof Complexity (PC 2018). We cordially invite contributions that are in the intersection of reasoning with quantifiers and proof complexity. Further, we are very pleased to announce that Meena Mahajan will give an invited talk in the joint session.
The joint session with PC 2018 is partly funded by EPSRC (Doctoral Prize Fellowship of Leroy Chew).
Topics of Interest
The workshop is concerned with all aspects of current research on formalisms enriched by quantifiers, in particular QBF. The topics of interest include (but are not limited to):
- Applications, encodings, and benchmarks with quantifiers
- Experimental evaluations of solvers or related tools
- Case studies illustrating the power of quantifiers
- Calculi and decision procedures
- Proof complexity results
- Implementation details of reasoning tools
Submission Guidelines
We invite the submission of extended abstracts on work that has been published already, novel unpublished work, or work in progress.
Submissions of the extended abstracts will be managed via Easychair: https://easychair.org/conferences/?conf=qbf18
The following forms of submissions are solicited:
- Proposals for short tutorial presentations on topics related to the workshop. Tutorial proposals will be reviewed by the PC. The number of accepted tutorials depends on the overall number of accepted papers and talks, with the aim to set up a balanced workshop program.
- Talk abstracts reporting on already published work. Such an abstract should include an outline of the planned talk, and pointers to relevant bibliography.
- 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 which 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.
Each submission should have an overall length of 2-4 pages in LNCS format. Authors may decide to include an appendix with additional material. Appendices will be considered at the reviewers' discretion.
The accepted extended abstracts will be published on the workshop webpage and on the USB stick of FLoC.
Committees
Program Committee
- Florent Capelli
- Leroy Chew
- Mikolas Janota
- Mathias Preiner
- Markus Rabe
- Martin Suda
- Friedrich Slivovsky
Organizing committee
- Hubie Chen
- Florian Lonsing
- Martina Seidl
Venue
Oxford, UK
Contact
All questions about submissions should be emailed to qbf18 AT easychair.org