QBF 2014 - 2nd International Workshop on Quantified Boolean Formulas (QBF 2014)
Topics/Call fo Papers
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
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
Other CFPs
- All about Proofs, Proofs for All (APPA 2014)
- 4th International Workshop on the Cross-Fertilization Between CSP and SAT (CSPSAT 2014)
- 2nd Workshop on the Parameterized Complexity of Computational Reasoning (PCCR 2014)
- Workshop on Parallel Methods for Search Optimization (ParSearchOpt 2014)
- 4th International Workshop on Logic and Search (LaSh 2014)
Last modified: 2014-03-21 16:31:39