On the public citation graph
Using SAT in QBF
0 signed · 56 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.1006/inco.1995.1025openalex-snapshot
Resolution for Quantified Boolean Formulas
inferredcites →https://doi.org/10.1007/11499107_2openalex-snapshot
A Symbolic Search Based Approach for Quantified Boolean Formulas
inferredcites →https://doi.org/10.1007/3-540-45616-3_12openalex-snapshot
Lemma and Model Caching in Decision Procedures for Quantified Boolean Formulas
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/3-540-46135-3openalex-snapshot
Principles and Practice of Constraint Programming - CP 2002
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/3-540-46135-3_25openalex-snapshot
Beyond NP: Arc-Consistency for Quantified Constraints
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-39724-3_31openalex-snapshot
Convergence Testing in Term-Level Bounded Model Checking
inferredcites →https://doi.org/10.1007/978-3-540-45193-8_24openalex-snapshot
Using Stochastic Local Search to Solve Quantified Boolean Formulae
inferredcites →https://doi.org/10.1007/978-3-642-40537-2openalex-snapshot
Automated Reasoning with Analytic Tableaux and Related Methods
inferredcites →https://doi.org/10.1007/b100482openalex-snapshot
Principles and Practice of Constraint Programming – CP 2004
inferredcites →https://doi.org/10.1007/b13743openalex-snapshot
Principles and practice of constraint programming - CP 2003 : 9th International Conference, CP 2003, Kinsale, Ireland, September 29 - October 3, 2003 : proceedings
inferredcites →https://doi.org/10.1007/s10817-005-0981-8openalex-snapshot
An Effective Algorithm for the Futile Questioning Problem
inferredcites →https://doi.org/10.1016/s0004-3702(02)00373-9openalex-snapshot
Backjumping for Quantified Boolean Logic satisfiability
inferredcites →https://doi.org/10.1109/lics.2003.1210053openalex-snapshot
The complexity of resolution refinements
inferredcites →https://doi.org/10.1145/321033.321034openalex-snapshot
A Computing Procedure for Quantification Theory
inferredcites →https://doi.org/10.1145/366696.366767openalex-snapshot
The generalized important event technique
inferredcites →https://doi.org/10.1145/368273.368557openalex-snapshot
A machine program for theorem-proving
inferredcites →https://doi.org/10.1145/800125.804029openalex-snapshot
Word problems requiring exponential time(Preliminary Report)
inferredcites →https://doi.org/10.1613/jair.1410openalex-snapshot
Towards Understanding and Harnessing the Potential of Clause Learning
inferredcites →https://doi.org/10.1613/jair.591openalex-snapshot
Constructing Conditional Plans by a Theorem-Prover
inferredcites →https://doi.org/10.21236/ada461050openalex-snapshot
Convergence Testing in Term-Level Bounded Model Checking
inferredcites →https://doi.org/10.5555/777092.777192openalex-snapshot
Learning for quantified boolean logic satisfiability
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-24318-4_25openalex-snapshot
QELL: QBF Reasoning with Extended Clause Learning and Levelized SAT Solving
inferred← citeshttps://doi.org/10.1007/978-3-319-40970-2_27openalex-snapshot
Q-Resolution with Generalized Axioms
inferred← citeshttps://doi.org/10.1007/978-3-319-44953-1_7openalex-snapshot
Dependency Schemes in QBF Calculi: Semantics and Soundness
inferred← citeshttps://doi.org/10.1007/978-3-319-66263-3_17openalex-snapshot
Shortening QBF Proofs with Dependency Schemes
inferred← citeshttps://doi.org/10.1007/978-3-540-72788-0_21openalex-snapshot
A First Step Towards a Unified Proof Checker for QBF
inferred← citeshttps://doi.org/10.1007/978-3-540-72788-0_22openalex-snapshot
Dynamically Partitioning for Solving QBF
inferred← citeshttps://doi.org/10.1007/978-3-540-72788-0_24openalex-snapshot
Bounded Universal Expansion for Preprocessing QBF
inferred← citeshttps://doi.org/10.1007/978-3-540-75867-9_67openalex-snapshot
On Combining 01X-Logic and QBF
inferred← citeshttps://doi.org/10.1007/978-3-540-92701-3_15openalex-snapshot
A Unified Framework for Certificate and Compilation for QBF
inferred← citeshttps://doi.org/10.1007/978-3-642-14186-7_6openalex-snapshot
Automated Testing and Debugging of SAT and QBF Solvers
inferred← citeshttps://doi.org/10.1007/978-3-642-21581-0_21openalex-snapshot
Failed Literal Detection for QBF
inferred← citeshttps://doi.org/10.1007/978-3-642-31612-8_10openalex-snapshot
Solving QBF with Counterexample Guided Refinement
inferred← citeshttps://doi.org/10.1007/s10817-018-9482-4openalex-snapshot
Reinterpreting Dependency Schemes: Soundness Meets Incompleteness in DQBF
inferred← citeshttps://doi.org/10.1016/j.artint.2016.01.004openalex-snapshot
Solving QBF with counterexample guided refinement
inferred← citeshttps://doi.org/10.1016/s1574-6526(07)03002-7openalex-snapshot
Chapter 2 Satisfiability Solvers
inferred← citeshttps://doi.org/10.1109/aswec.2006.36openalex-snapshot
Model-based runtime analysis of distributed reactive systems
inferred← citeshttps://doi.org/10.1109/ised.2017.8303924openalex-snapshot
Towards lightweight satisfiability solvers for self-verification
inferred← citeshttps://doi.org/10.1109/mtv.2006.3openalex-snapshot
Advanced SAT-Techniques for Bounded Model Checking of Blackbox Designs
inferred← citeshttps://doi.org/10.1109/scc.2007.128openalex-snapshot
Verifying Semantic Business Process Models in Inter-operation
inferred← citeshttps://doi.org/10.1109/sips.2016.46openalex-snapshot
Design Kernel Exploration Using QBF-Based Boolean Matching
inferred← citeshttps://doi.org/10.1109/tc.2010.74openalex-snapshot
Robust QBF Encodings for Sequential Circuits with Applications to Verification, Debug, and Test
inferred← citeshttps://doi.org/10.1109/tc.2010.79openalex-snapshot
A Microeconomic Model for Hierarchical Bandwidth Sharing in Dynamic Spectrum Access Networks
inferred← citeshttps://doi.org/10.1145/3087534openalex-snapshot
Proof Complexity Modulo the Polynomial Hierarchy
inferred← citeshttps://doi.org/10.1145/3355995openalex-snapshot
Dynamic QBF Dependencies in Reduction and Expansion
inferred← citeshttps://doi.org/10.1145/3378665openalex-snapshot
Reasons for Hardness in QBF Proof Systems
inferred← citeshttps://doi.org/10.3233/aic-2009-0445openalex-snapshot
Structure-based satisfiability checking
inferred← citeshttps://doi.org/10.3233/sat190055openalex-snapshot
QBF-Based Formal Verification: Experience and Perspectives
inferred← citeshttps://doi.org/10.3929/ethz-a-006707337openalex-snapshot
Termination Analysis for Bit-Vector Programs
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.