CAQE: a certifying QBF solver
We present a new CEGAR-based algorithm for QBF. The algorithm builds on a
decomposition of QBFs into a sequence of propositional formulas, which we call the clausal …
decomposition of QBFs into a sequence of propositional formulas, which we call the clausal …
Manthan: A data-driven approach for boolean function synthesis
Boolean functional synthesis is a fundamental problem in computer science with wide-
ranging applications and has witnessed a surge of interest resulting in progressively …
ranging applications and has witnessed a surge of interest resulting in progressively …
DepQBF 6.0: A Search-Based QBF Solver Beyond Traditional QCDCL
F Lonsing, U Egly - Automated Deduction–CADE 26: 26th International …, 2017 - Springer
We present the latest major release version 6.0 of the quantified Boolean formula (QBF)
solver DepQBF, which is based on QCDCL. QCDCL is an extension of the conflict-driven …
solver DepQBF, which is based on QCDCL. QCDCL is an extension of the conflict-driven …
Engineering an efficient boolean functional synthesis engine
Given a Boolean specification between a set of inputs and outputs, the problem of Boolean
functional synthesis is to synthesise each output as a function of inputs such that the …
functional synthesis is to synthesise each output as a function of inputs such that the …
Clause elimination for SAT and QSAT
The famous archetypical NP-complete problem of Boolean satisfiability (SAT) and its
PSPACE-complete generalization of quantified Boolean satisfiability (QSAT) have become …
PSPACE-complete generalization of quantified Boolean satisfiability (QSAT) have become …
SAT-based synthesis methods for safety specs
Automatic synthesis of hardware components from declarative specifications is an ambitious
endeavor in computer aided design. Existing synthesis algorithms are often implemented …
endeavor in computer aided design. Existing synthesis algorithms are often implemented …
Incremental determinization
We present a novel approach to solve quantified boolean formulas with one quantifier
alternation (2QBF). The algorithm incrementally adds new constraints to the formula until the …
alternation (2QBF). The algorithm incrementally adds new constraints to the formula until the …
[HTML][HTML] The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17)
After a break of about five years, in 2016 the classical QBFEVAL has been revived.
QBFEVAL is a competitive evaluation of solvers for quantified Boolean formulas (QBF), the …
QBFEVAL is a competitive evaluation of solvers for quantified Boolean formulas (QBF), the …
The first reactive synthesis competition (SYNTCOMP 2014)
We introduce the reactive synthesis competition (SYNTCOMP), a long-term effort intended to
stimulate and guide advances in the design and application of synthesis procedures for …
stimulate and guide advances in the design and application of synthesis procedures for …
A unified proof system for QBF preprocessing
Abstract For quantified Boolean formulas (QBFs), preprocessing is essential to solve many
real-world formulas. The application of a preprocessor, however, prevented the extraction of …
real-world formulas. The application of a preprocessor, however, prevented the extraction of …