On the public citation graph
On Conflicts and Strategies in QBF
0 signed · 40 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/11532231_27openalex-snapshot
sKizzo: A Suite to Evaluate and Certify QBFs
inferredcites →https://doi.org/10.1007/3-540-46135-3_14openalex-snapshot
Towards a Symmetric Treatment of Satisfaction and Conflicts in Quantified Boolean Formula Evaluation
inferredcites →https://doi.org/10.1007/978-3-319-24318-4_25openalex-snapshot
QELL: QBF Reasoning with Extended Clause Learning and Levelized SAT Solving
inferredcites →https://doi.org/10.1007/978-3-540-30201-8_34openalex-snapshot
Symbolic Decision Procedures for QBF
inferredcites →https://doi.org/10.1007/978-3-540-79719-7_19openalex-snapshot
Nenofex: Expanding NNF for QBF Solving
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-21581-0_19openalex-snapshot
Abstraction-Based Algorithm for 2QBF
inferredcites →https://doi.org/10.1007/978-3-642-22438-6_10openalex-snapshot
Blocked Clause Elimination for QBF
inferredcites →https://doi.org/10.1007/978-3-642-31612-8_10openalex-snapshot
Solving QBF with Counterexample Guided Refinement
inferredcites →https://doi.org/10.1007/978-3-642-39071-5_9openalex-snapshot
Efficient Clause Learning for Quantified Boolean Formulas via QBF Pseudo Unit Propagation
inferredcites →https://doi.org/10.1007/s10703-012-0152-6openalex-snapshot
Unified QBF certification and its applications
inferredcites →https://doi.org/10.1007/s10817-007-9067-0openalex-snapshot
Boolean Functions as Models for Quantified Boolean Formulas
inferredcites →https://doi.org/10.1016/j.artint.2016.04.002openalex-snapshot
The QBF Gallery: Behind the scenes
inferredcites →https://doi.org/10.1109/12.769433openalex-snapshot
GRASP: a search algorithm for propositional satisfiability
inferredcites →https://doi.org/10.1109/fmcad.2015.7542263openalex-snapshot
CAQE: A Certifying QBF Solver
inferredcites →https://doi.org/10.1109/iccad.2002.1167570openalex-snapshot
Conflict driven learning in a quantified Boolean satisfiability solver
inferredcites →https://doi.org/10.1145/774572.774637openalex-snapshot
Conflict driven learning in a quantified Boolean Satisfiability solver
inferredcites →https://doi.org/10.1609/aaai.v29i1.9750openalex-snapshot
Efficient Extraction of QBF (Counter)models from Long-Distance Resolution Proofs
inferredcites →https://doi.org/10.1613/jair.1959openalex-snapshot
Clause/Term Resolution and Learning in the Evaluation of Quantified Boolean Formulas
inferredcites →https://doi.org/10.3233/978-1-58603-929-5-131openalex-snapshot
Conflict-Driven Clause Learning SAT Solvers
inferredcites →https://doi.org/10.3233/978-1-58603-929-5-761openalex-snapshot
Reasoning with Quantified Boolean Formulas
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
inferredcites →https://doi.org/10.4230/lipics.stacs.2015.76openalex-snapshot
Proof Complexity of Resolution-based QBF Calculi
inferredcites →https://doi.org/10.48550/arxiv.2608.14274openalex-snapshot
Solving QBF by Clause Selection
inferredcites →https://doi.org/10.5555/2485288.2485484openalex-snapshot
Bridging the gap between dual propagation and CNF-based QBF solving
inferredcites →https://doi.org/10.5591/978-1-57735-516-8/ijcai11-099openalex-snapshot
A uniform approach for generating proofs and strategies for both true and false QBF formulas
inferredcites →https://doi.org/10.7873/date.2013.172openalex-snapshot
Bridging the Gap between Dual Propagation and CNF-based QBF Solving
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-030-24258-9_23openalex-snapshot
Proof Complexity of Fragments of Long-Distance Q-Resolution
inferred← citeshttps://doi.org/10.1007/978-3-031-76554-4_16openalex-snapshot
PyQBF: A Python Framework for Solving Quantified Boolean Formulas
inferred← citeshttps://doi.org/10.1007/978-3-319-94144-8_14openalex-snapshot
Local Soundness for QBF Calculi
inferred← citeshttps://doi.org/10.1145/3779651openalex-snapshot
PyQBF: A Python Framework for Solving Quantified Boolean Formulas
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.1.14710openalex-snapshot
Classes of Hard Formulas for QBF Resolution
inferred← citeshttps://doi.org/10.48550/arxiv.1906.10357openalex-snapshot
Partial Quantifier Elimination With Learning
inferred← citeshttps://doi.org/10.48550/arxiv.2003.09667openalex-snapshot
Partial Quantifier Elimination By Certificate Clauses
inferred← citeshttps://doi.org/10.48550/arxiv.2107.09320openalex-snapshot
QRAT Polynomially Simulates Merge Resolution
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.