Carview!

CARVIEW

MOTORHOMES

Select Language

HTTP/2 302 content-type: text/html; charset=utf-8 location: //fmv.jku.at/qbf18/ vary: Origin x-request-id: 01KEWXFV9367Q717S9V62KJ87B content-length: 42 date: Wed, 14 Jan 2026 00:11:34 GMT HTTP/2 200 accept-ranges: bytes cache-control: max-age=600 content-type: text/html; charset=utf-8 etag: "6eb996eab52cf1ece84e8bcdf0c9098455aa98f8d4214cdc612732cacd3708a8" expires: Wed, 14 Jan 2026 01:21:34 CET last-modified: Thu, 25 Sep 2025 14:33:37 GMT vary: Origin x-request-id: 01KEWXFVDMJVEXXJNVRNWMYW6T content-length: 5726 date: Wed, 14 Jan 2026 00:11:34 GMT International Workshop on Quantified Boolean Formulas

Skip to navigation
Skip to content

International Workshop on Quantified Boolean Formulas and Beyond

colocated with the
Federated Logic Conference 2018 (FLoC), Oxford, UK

News

Abstracts are online!
Program is online!
Invited talk by Meena Mahajan in joint session with PC 2018
Joint session with PC 2018
QBF accepted as FLoC 2018 workshop

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

The workshop is scheduled for July 8, 2018.
There will be a joint session with the Workshop on Proof Complexity (PC).

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

Original Source | Taken Source

Navigation