On the public citation graph
Bridging the Gap between Dual Propagation and CNF-based QBF Solving
0 signed · 36 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/11814948_35openalex-snapshot
QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency
inferredcites →https://doi.org/10.1007/3-540-45744-5_27openalex-snapshot
QuBE: A System for Deciding Quantified Boolean Formulas Satisfiability
inferredcites →https://doi.org/10.1007/978-3-642-14186-7_12openalex-snapshot
A Non-prenex, Non-clausal QBF Solver with Game-State Learning
inferredcites →https://doi.org/10.1007/978-3-642-22438-6_10openalex-snapshot
Blocked Clause Elimination for QBF
inferredcites →https://doi.org/10.1007/s10601-008-9055-yopenalex-snapshot
A solver for QBFs in negation normal form
inferredcites →https://doi.org/10.1016/s0747-7171(86)80028-1openalex-snapshot
A Structure-preserving Clause Form Translation
inferredcites →https://doi.org/10.1109/iccad.2007.4397272openalex-snapshot
A performance-driven QBF-based iterative logic array representation with applications to verification, debug and test
inferredcites →https://doi.org/10.1609/aaai.v24i1.7548openalex-snapshot
Exploiting QBF Duality on a Circuit Representation
inferredcites →https://doi.org/10.3233/sat190055openalex-snapshot
QBF-Based Formal Verification: Experience and Perspectives
inferredcites →https://doi.org/10.3233/sat190077openalex-snapshot
DepQBF: A Dependency-Aware QBF Solver
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-319-40970-2_25openalex-snapshot
On Q-Resolution and CDCL QBF Solving
inferred← citeshttps://doi.org/10.1007/978-3-319-40970-2_31openalex-snapshot
Long Distance Q-Resolution with Dependency Schemes
inferred← citeshttps://doi.org/10.1007/978-3-319-63516-3_4openalex-snapshot
Parallel Solving of Quantified Boolean Formulas
inferred← citeshttps://doi.org/10.1007/978-3-319-65340-2_55openalex-snapshot
An Achilles’ Heel of Term-Resolution
inferred← citeshttps://doi.org/10.1007/978-3-319-94144-8_12openalex-snapshot
Circuit-Based Search Space Pruning in QBF
inferred← citeshttps://doi.org/10.1007/978-3-319-94144-8_13openalex-snapshot
Symmetries of Quantified Boolean Formulas
inferred← citeshttps://doi.org/10.1007/978-3-642-39071-5_8openalex-snapshot
Recovering and Utilizing Partial Duality in QBF
inferred← citeshttps://doi.org/10.1007/978-3-662-48899-7_29openalex-snapshot
Enhancing Search-Based QBF Solving by Dynamic Blocked Clause Elimination
inferred← citeshttps://doi.org/10.1007/s10601-015-9195-9openalex-snapshot
Quantified maximum satisfiability
inferred← citeshttps://doi.org/10.1007/s10817-018-9467-3openalex-snapshot
Long-Distance Q-Resolution with Dependency Schemes
inferred← citeshttps://doi.org/10.1016/j.artint.2016.04.002openalex-snapshot
The QBF Gallery: Behind the scenes
inferred← citeshttps://doi.org/10.1109/fmcad.2014.6987611openalex-snapshot
Turbo-charging Lemmas on demand with don't care reasoning
inferred← citeshttps://doi.org/10.1109/iccad51958.2021.9643520openalex-snapshot
An Efficient Two-phase Method for Prime Compilation of Non-clausal Boolean Formulae
inferred← citeshttps://doi.org/10.1109/ictai.2018.00111openalex-snapshot
Dualizing Projected Model Counting
inferred← citeshttps://doi.org/10.1109/lics56636.2023.10175675openalex-snapshot
Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF
inferred← citeshttps://doi.org/10.1109/synasc.2016.038openalex-snapshot
A Duality-Aware Calculus for Quantified Boolean Formulas
inferred← citeshttps://doi.org/10.1145/3352155openalex-snapshot
New Resolution-Based QBF Calculi and Their Proof Complexity
inferred← citeshttps://doi.org/10.1609/aaai.v32i1.12208openalex-snapshot
Towards Generalization in QBF Solving via Machine Learning
inferred← citeshttps://doi.org/10.1613/jair.4694openalex-snapshot
Clause Elimination for SAT and QSAT
inferred← citeshttps://doi.org/10.29007/vgg4openalex-snapshot
Combining Conflict-Driven Clause Learning and Chronological Backtracking for Propositional Model Counting
inferred← citeshttps://doi.org/10.3233/sat190121openalex-snapshot
CAQE and QuAbS: Abstraction Based QBF Solvers
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.