Dependency quantified Boolean formulas: An overview of solution methods and applications
C Scholl, R Wimmer - … Conference on Theory and Applications of …, 2018 - Springer
Abstract Dependency quantified Boolean formulas (DQBFs) as a generalization of quantified
Boolean formulas (QBFs) have received considerable attention in research during the last …
Boolean formulas (QBFs) have received considerable attention in research during the last …
HQSpre–an effective preprocessor for QBF and DQBF
We present our new preprocessor HQSpre, a state-of-the-art tool for simplifying quantified
Boolean formulas (QBFs) and the first available preprocessor for dependency quantified …
Boolean formulas (QBFs) and the first available preprocessor for dependency quantified …
[PDF][PDF] iDQ: Instantiation-Based DQBF Solving.
iDQ: Instantiation-Based DQBF Solving Page 1 iDQ: Instantiation-Based DQBF Solving
Andreas Fröhlich1, Gergely Kovásznai2, Armin Biere1, Helmut Veith2 1 Johannes Kepler …
Andreas Fröhlich1, Gergely Kovásznai2, Armin Biere1, Helmut Veith2 1 Johannes Kepler …
Clausal abstraction for DQBF
Dependency quantified Boolean formulas (DQBF) is a logic admitting existential
quantification over Boolean functions, which allows us to elegantly state synthesis problems …
quantification over Boolean functions, which allows us to elegantly state synthesis problems …
Interpolation-based semantic gate extraction and its applications to QBF preprocessing
F Slivovsky - International Conference on Computer Aided …, 2020 - Springer
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 …
[HTML][HTML] Soundness of Q-resolution with dependency schemes
F Slivovsky, S Szeider - Theoretical Computer Science, 2016 - Elsevier
Q-resolution and Q-term resolution are proof systems for quantified Boolean formulas
(QBFs). We introduce generalizations of these proof systems named Q (D)-resolution and Q …
(QBFs). We introduce generalizations of these proof systems named Q (D)-resolution and Q …
Second-order quantified boolean logic
JHR Jiang - Proceedings of the AAAI Conference on Artificial …, 2023 - ojs.aaai.org
Second-order quantified Boolean formulas (SOQBFs) generalize quantified Boolean
formulas (QBFs) by admitting second-order quantifiers on function variables in addition to …
formulas (QBFs) by admitting second-order quantifiers on function variables in addition to …
Solving DQBF through quantifier elimination
We show how to solve dependency quantified Boolean formulas (DQBF) using a quantifier
elimination strategy which yields an equivalent QBF that can be decided using any standard …
elimination strategy which yields an equivalent QBF that can be decided using any standard …
Building strategies into QBF proofs
O Beyersdorff, J Blinkhorn, M Mahajan - Journal of Automated Reasoning, 2021 - Springer
Strategy extraction is of great importance for quantified Boolean formulas (QBF), both in
solving and proof complexity. So far in the QBF literature, strategy extraction has been …
solving and proof complexity. So far in the QBF literature, strategy extraction has been …
Engineering change order for combinational and sequential design rectification
Engineering change order (ECO) becomes a crucial element in VLSI design flow to rectify
function or fix non-functional requirements in late design stages. Even though commercial …
function or fix non-functional requirements in late design stages. Even though commercial …