Quantifie d Boolean formulas (QBF) are an extension of propo sitional logic which allows for explicit quantific ation over propositional variables. Many problems from application domains such as model checking, f ormal 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 wide ly applied to practical problems in academic or in dustrial settings. The goal of the International W orkshop on Quantified Boolean Formulas and Beyond (QBF 2019) is to bring together researchers workin g on theoretical and practical aspects of QBF solv ing.
\n\nIn addition to that, it addresses (potential) users of QBF in order to reflect on t he state-of-the-art and to consolidate on immediat e and long-term research challenges. The workshop also welcomes work on reasoning with quantifiers i n related problems, such as dependency QBF (DQBF), quantified constraint satisfaction problems (QCSP ), and satisfiability modulo theories (SMT) with q uantifiers.
\nSubmissions of
extended abstracts are invited and will be managed
via Easychair. The following forms of submissions
are solicited:
\n - Proposals for short tutor
ial presentations on topics related to the worksho
p.
\n - Talk abstracts reporting on already pu
blished work.
\n - Talk proposals presenting w
ork that is unpublished or in progress.