International Workshop on Quantified Boolean Formulas (and Beyond)

colocated with the
19th Int. Conf. on Theory and Applications of Satisfiability Testing

News

  • 20.4.2016: Deadline extension
    until May 08!
  • 2.2.2016: PC announced
  • Webpage online

Important Dates

  • May 08: Submission
  • May 29: Notification
  • June 20: Camera-Ready Version
  • July 04: Workshop

Workshop @ SAT 2016

Bordeaux, France

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.

This year, the QBF workshop broadens its scope. Apart from topics related to QBF, topics of interest include the theory and practice of quantification in other formalisms like quantified constraint satisfaction problems (QCSP), satisfiability modulo theories (SMT) or theorem proving.

Invited Speaker

Important Information

We are looking forward to a successful workshop, and to seeing you in Bordeaux!

Contact

qbf2016@easychair.org

Previous Editions and related events