On the public citation graph

qbf2epr: A Tool for Generating EPR Formulas from QBF

https://doi.org/10.29007/2b5d
0 signed · 30 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/11527695_5openalex-snapshot
Resolve and Expand
inferredcites →https://doi.org/10.1007/978-3-540-24605-3_17openalex-snapshot
Comparing Different Prenexing Strategies for Quantified Boolean Formulas
inferredcites →https://doi.org/10.1007/978-3-540-71070-7_24openalex-snapshot
iProver – An Instantiation-Based Theorem Prover for First-Order Logic (System Description)
inferredcites →https://doi.org/10.1007/978-3-540-72788-0_23openalex-snapshot
Backdoor Sets of Quantified Boolean Formulas
inferredcites →https://doi.org/10.1007/978-3-540-73595-3_24openalex-snapshot
Encodings of Bounded LTL Model Checking in Effectively Propositional Logic
inferredcites →https://doi.org/10.1007/978-3-540-75867-9_67openalex-snapshot
On Combining 01X-Logic and QBF
inferredcites →https://doi.org/10.1007/978-3-642-02959-2_14openalex-snapshot
Instantiation-Based Automated Reasoning: From Theory to Practice
inferredcites →https://doi.org/10.1007/978-3-642-14186-7_20openalex-snapshot
The Seventh QBF Solvers Evaluation (QBFEVAL’10)
inferredcites →https://doi.org/10.1007/978-3-642-14186-7_6openalex-snapshot
Automated Testing and Debugging of SAT and QBF Solvers
inferredcites →https://doi.org/10.1007/978-3-642-22438-6_10openalex-snapshot
Blocked Clause Elimination for QBF
inferredcites →https://doi.org/10.1007/s10009-004-0183-4openalex-snapshot
A survey of recent advances in SAT-based formal verification
inferredcites →https://doi.org/10.1007/s10703-012-0156-2openalex-snapshot
Efficiently solving quantified bit-vector formulas
inferredcites →https://doi.org/10.1007/s10817-008-9114-5openalex-snapshot
Backdoor Sets of Quantified Boolean Formulas
inferredcites →https://doi.org/10.1007/s10817-009-9143-8openalex-snapshot
The TPTP Problem Library and Associated Infrastructure
inferredcites →https://doi.org/10.1016/0022-0000(80)90027-6openalex-snapshot
Complexity results for classes of quantificational formulas
inferredcites →https://doi.org/10.1109/swat.1972.29openalex-snapshot
The equivalence problem for regular expressions with squaring requires exponential space
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-031-63498-7_19openalex-snapshot
Booleguru, the Propositional Polyglot (Short Paper)
inferred← citeshttps://doi.org/10.1007/978-3-319-40970-2_26openalex-snapshot
On Stronger Calculi for QBFs
inferred← citeshttps://doi.org/10.1007/978-3-319-40970-2_30openalex-snapshot
Lifting QBF Resolution Calculi to DQBF
inferred← citeshttps://doi.org/10.1007/978-3-319-66167-4_19openalex-snapshot
The Boolean Solution Problem from the Perspective of Predicate Logic
inferred← citeshttps://doi.org/10.1007/978-3-319-94144-8_14openalex-snapshot
Local Soundness for QBF Calculi
inferred← citeshttps://doi.org/10.1007/978-3-642-54013-4_1openalex-snapshot
SAT-Based Synthesis Methods for Safety Specs
inferred← citeshttps://doi.org/10.1007/s10817-018-9482-4openalex-snapshot
Reinterpreting Dependency Schemes: Soundness Meets Incompleteness in DQBF
inferred← citeshttps://doi.org/10.1109/sp63933.2026.00041openalex-snapshot
Towards Practical Zero-Knowledge Proof for PSPACE
inferred← citeshttps://doi.org/10.29007/1s5kopenalex-snapshot
iDQ: Instantiation-Based DQBF Solving
inferred← citeshttps://doi.org/10.29007/ltkkopenalex-snapshot
A Clausal Normal Form Translation for FOOL
inferred← citeshttps://doi.org/10.3233/sat190115openalex-snapshot
The (D)QBF Preprocessor HQSpre – Underlying Theory and Its Implementation1
inferred← citeshttps://doi.org/10.48550/arxiv.1604.06204openalex-snapshot
Satisfiability-Based Methods for Reactive Synthesis from Safety Specifications
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.