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 …
Booleguru, the propositional polyglot (short paper)
Recent approaches on verification and reasoning solve SAT and QBF encodings using state-
of-the-art SMT solvers, as it “makes implementation much easier”. The ease-of-use of these …
of-the-art SMT solvers, as it “makes implementation much easier”. The ease-of-use of these …
Towards generalization in QBF solving via machine learning
There are well known cases of Quantified Boolean Formulas (QBFs) that have short winning
strategies (Skolem/Herbrand functions) but that are hard to solve by nowadays solvers. This …
strategies (Skolem/Herbrand functions) but that are hard to solve by nowadays solvers. This …
Structure-aware lower bounds and broadening the horizon of tractability for QBF
The QSAT problem, which asks to evaluate a quantified Boolean formula (QBF), is of
fundamental interest in approximation, counting, decision, and probabilistic complexity and …
fundamental interest in approximation, counting, decision, and probabilistic complexity and …
Progress in certifying hardware model checking results
We present a formal framework to certify k-induction-based model checking results. The key
idea is the notion of ak-witness circuit which simulates the given circuit and has a simple …
idea is the notion of ak-witness circuit which simulates the given circuit and has a simple …
Interpolation-based semantic gate extraction and its applications to QBF preprocessing
We present a new semantic gate extraction technique for propositional formulas based on
interpolation. While known gate detection methods are incomplete and rely on pattern …
interpolation. While known gate detection methods are incomplete and rely on pattern …
Dependency learning for QBF
Quantified Boolean Formulas (QBFs) can be used to succinctly encode problems from
domains such as formal verification, planning, and synthesis. One of the main approaches to …
domains such as formal verification, planning, and synthesis. One of the main approaches to …
Dependency learning for QBF
Abstract Quantified Boolean Formulas (QBFs) can be used to succinctly encode problems
from domains such as formal verification, planning, and synthesis. One of the main …
from domains such as formal verification, planning, and synthesis. One of the main …
Incremental determinization for quantifier elimination and functional synthesis
Quantifier elimination and its cousin functional synthesis are fundamental problems in
automated reasoning that could be used in many applications of formal methods. But …
automated reasoning that could be used in many applications of formal methods. But …
Small unsatisfiable -CNFs with bounded literal occurrence
We obtain the smallest unsatisfiable formulas in subclasses of $ k $-CNF (exactly $ k $
distinct literals per clause) with bounded variable or literal occurrences. Smaller …
distinct literals per clause) with bounded variable or literal occurrences. Smaller …