On the public citation graph

New Resolution-Based QBF Calculi and Their Proof Complexity

https://doi.org/10.1145/3352155
0 signed · 96 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.1006/inco.1995.1025openalex-snapshot
Resolution for Quantified Boolean Formulas
inferredcites →https://doi.org/10.1007/11527695_5openalex-snapshot
Resolve and Expand
inferredcites →https://doi.org/10.1007/11814948_33openalex-snapshot
Binary Clause Reasoning in QBF
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-09284-3_12openalex-snapshot
QBF Resolution Systems and Their Proof Complexities
inferredcites →https://doi.org/10.1007/978-3-319-40970-2_26openalex-snapshot
On Stronger Calculi for QBFs
inferredcites →https://doi.org/10.1007/978-3-319-40970-2_30openalex-snapshot
Lifting QBF Resolution Calculi to DQBF
inferredcites →https://doi.org/10.1007/978-3-319-40970-2_31openalex-snapshot
Long Distance Q-Resolution with Dependency Schemes
inferredcites →https://doi.org/10.1007/978-3-319-44953-1_7openalex-snapshot
Dependency Schemes in QBF Calculi: Semantics and Soundness
inferredcites →https://doi.org/10.1007/978-3-540-72788-0_21openalex-snapshot
A First Step Towards a Unified Proof Checker for QBF
inferredcites →https://doi.org/10.1007/978-3-540-72788-0_24openalex-snapshot
Bounded Universal Expansion for Preprocessing QBF
inferredcites →https://doi.org/10.1007/978-3-540-89439-1_36openalex-snapshot
Variable Dependencies of Quantified CSPs
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-14186-7_14openalex-snapshot
Integrating Dependency Schemes in Search-Based QBF Solvers
inferredcites →https://doi.org/10.1007/978-3-642-14186-7_9openalex-snapshot
sQueezeBF: An Effective Preprocessor for QBFs Based on Equivalence Reasoning
inferredcites →https://doi.org/10.1007/978-3-642-23786-7_59openalex-snapshot
Variable Independence and Resolution Paths for Quantified Boolean Formulas
inferredcites →https://doi.org/10.1007/978-3-642-39071-5_8openalex-snapshot
Recovering and Utilizing Partial Duality in QBF
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/978-3-642-40627-0_51openalex-snapshot
Primal and Dual Encoding from Applications into Quantified Boolean Formulas
inferredcites →https://doi.org/10.1007/978-3-642-45221-5openalex-snapshot
Logic for Programming, Artificial Intelligence, and Reasoning
inferredcites →https://doi.org/10.1007/978-3-642-45221-5_21openalex-snapshot
Long-Distance Resolution: Proof Generation and Strategy Extraction in Search-Based QBF Solving
inferredcites →https://doi.org/10.1007/978-3-642-45221-5_32openalex-snapshot
On QBF Proofs and Preprocessing
inferredcites →https://doi.org/10.1007/978-3-662-03927-4openalex-snapshot
Introduction to Circuit Complexity
inferredcites →https://doi.org/10.1007/978-3-662-44465-8_8openalex-snapshot
On Unification of QBF Resolution-Based Calculi
inferredcites →https://doi.org/10.1007/bf00058680openalex-snapshot
Learning Decision Lists
inferredcites →https://doi.org/10.1007/bf01744431openalex-snapshot
Parity, circuits, and the polynomial-time hierarchy
inferredcites →https://doi.org/10.1007/s10472-016-9501-2openalex-snapshot
Conformant planning as a case study of incremental QBF solving
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.1007/s10817-008-9114-5openalex-snapshot
Backdoor Sets of Quantified Boolean Formulas
inferredcites →https://doi.org/10.1007/s10817-016-9390-4openalex-snapshot
Solution Validation and Extraction for QBF Preprocessing
inferredcites →https://doi.org/10.1016/j.apal.2011.09.009openalex-snapshot
Towards NP – P via proof complexity and search
inferredcites →https://doi.org/10.1016/j.artint.2016.01.004openalex-snapshot
Solving QBF with counterexample guided refinement
inferredcites →https://doi.org/10.1016/j.ipl.2010.09.007openalex-snapshot
A lower bound for the pigeonhole principle in tree-like Resolution by asymmetric Prover–Delayer games
inferredcites →https://doi.org/10.1016/j.ipl.2013.06.002openalex-snapshot
A characterization of tree-like Resolution size
inferredcites →https://doi.org/10.1016/j.ipl.2018.05.005openalex-snapshot
Relating size and width in variants of Q-resolution
inferredcites →https://doi.org/10.1016/j.jcss.2014.04.014openalex-snapshot
Bounded-width QBF is PSPACE-complete
inferredcites →https://doi.org/10.1016/j.jcss.2016.11.011openalex-snapshot
A game characterisation of tree-like Q-Resolution size
inferredcites →https://doi.org/10.1016/j.tcs.2015.01.048openalex-snapshot
Expansion-based QBF solving versus Q-resolution
inferredcites →https://doi.org/10.1016/j.tcs.2015.10.020openalex-snapshot
Soundness of Q-resolution with dependency schemes
inferredcites →https://doi.org/10.1017/cbo9780511676277openalex-snapshot
Logical Foundations of Proof Complexity
inferredcites →https://doi.org/10.1017/cbo9780511804090openalex-snapshot
Computational Complexity
inferredcites →https://doi.org/10.1137/s0097539799352474openalex-snapshot
On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems
inferredcites →https://doi.org/10.1145/2499937.2499941openalex-snapshot
Parameterized Complexity of DPLL Search Procedures
inferredcites →https://doi.org/10.1145/2840728.2840740openalex-snapshot
Lower Bounds
inferredcites →https://doi.org/10.1145/2933575.2933597openalex-snapshot
Understanding Gentzen and Frege Systems for QBF
inferredcites →https://doi.org/10.1145/3087534openalex-snapshot
Proof Complexity Modulo the Polynomial Hierarchy
inferredcites →https://doi.org/10.1145/3157053openalex-snapshot
Are Short Proofs Narrow? QBF Resolution Is Not So Simple
inferredcites →https://doi.org/10.1145/321250.321253openalex-snapshot
A Machine-Oriented Logic Based on the Resolution Principle
inferredcites →https://doi.org/10.1145/375827.375835openalex-snapshot
Short proofs are narrow—resolution made simple
inferredcites →https://doi.org/10.1145/774572.774637openalex-snapshot
Conflict driven learning in a quantified Boolean Satisfiability solver
inferredcites →https://doi.org/10.2178/bsl/1203350879openalex-snapshot
The Complexity of Propositional Proofs
inferredcites →https://doi.org/10.2307/2273702openalex-snapshot
The relative efficiency of propositional proof systems
inferredcites →https://doi.org/10.2307/2275541openalex-snapshot
Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic
inferredcites →https://doi.org/10.2307/2275583openalex-snapshot
Lower bounds for resolution and cutting plane proofs and monotone computations
inferredcites →https://doi.org/10.3233/978-1-58603-929-5-735openalex-snapshot
Theory of Quantified Boolean Formulas
inferredcites →https://doi.org/10.3233/978-1-58603-929-5-761openalex-snapshot
Reasoning with Quantified Boolean Formulas
inferredcites →https://doi.org/10.3233/sat190050openalex-snapshot
Improved SAT-based Reachability Analysis with Observability Don’t Cares
inferredcites →https://doi.org/10.3233/sat190055openalex-snapshot
QBF-Based Formal Verification: Experience and Perspectives
inferredcites →https://doi.org/10.48550/arxiv.1704.01071openalex-snapshot
An Achilles' Heel of Term-Resolution
inferredcites →https://doi.org/10.5555/1622559.1622569openalex-snapshot
Clause/term resolution and learning in the evaluation of quantified Boolean formulas
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-51825-7_28openalex-snapshot
Strong (D)QBF Dependency Schemes via Tautology-Free Resolution Paths
inferred← citeshttps://doi.org/10.1007/978-3-030-51825-7_29openalex-snapshot
Short Q-Resolution Proofs with Homomorphisms
inferred← citeshttps://doi.org/10.1007/978-3-030-51825-7_30openalex-snapshot
Multi-linear Strategy Extraction for QBF Expansion Proofs via Local Soundness
inferred← citeshttps://doi.org/10.1007/978-3-030-80223-3_28openalex-snapshot
Proof Complexity of Symbolic QBF Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-030-80223-3_3openalex-snapshot
QBFFam: A Tool for Generating QBF Families from Proof Complexity
inferred← citeshttps://doi.org/10.1007/978-3-030-80223-3_5openalex-snapshot
Lower Bounds for QCDCL via Formula Gauge
inferred← citeshttps://doi.org/10.1007/978-3-030-80223-3_8openalex-snapshot
Hardness and Optimality in QBF Proof Systems Modulo NP
inferred← citeshttps://doi.org/10.1007/978-3-031-39784-4_23openalex-snapshot
Subsumption-Linear Q-Resolution for QBF Theorem Proving
inferred← citeshttps://doi.org/10.1007/978-3-031-42753-4_2openalex-snapshot
Never Trust Your Solver: Certification for SAT and QBF
inferred← citeshttps://doi.org/10.1007/978-3-031-42753-4_20openalex-snapshot
True Crafted Formula Families for Benchmarking Quantified Satisfiability Solvers
inferred← citeshttps://doi.org/10.1007/s10817-020-09560-1openalex-snapshot
Building Strategies into QBF Proofs
inferred← citeshttps://doi.org/10.1007/s10817-021-09609-9openalex-snapshot
Proof Complexity of Modal Resolution
inferred← citeshttps://doi.org/10.1007/s10817-023-09683-1openalex-snapshot
Lower Bounds for QCDCL via Formula Gauge
inferred← citeshttps://doi.org/10.1007/s10817-024-09707-4openalex-snapshot
Dependency Schemes in CDCL-Based QBF Solving: A Proof-Theoretic Study
inferred← citeshttps://doi.org/10.1016/j.artint.2024.104194openalex-snapshot
QCDCL with cube learning or pure literal elimination – What is best?
inferred← citeshttps://doi.org/10.1016/j.ipl.2021.106093openalex-snapshot
A simple proof of QBF hardness
inferred← citeshttps://doi.org/10.1145/3373718.3394793openalex-snapshot
Hardness Characterisations and Size-Width Lower Bounds for QBF Resolution
inferred← citeshttps://doi.org/10.1145/3442365openalex-snapshot
Computational and Proof Complexity of Partial String Avoidability
inferred← citeshttps://doi.org/10.1145/3565286openalex-snapshot
Hardness Characterisations and Size-width Lower Bounds for QBF Resolution
inferred← citeshttps://doi.org/10.1145/3638263openalex-snapshot
Hard QBFs for Merge Resolution
inferred← citeshttps://doi.org/10.1145/3672608.3707850openalex-snapshot
Solution Counts of Some Prominent Quantified Boolean Formulas Families
inferred← citeshttps://doi.org/10.1145/3689345openalex-snapshot
Strong (D)QBF Dependency Schemes via Implication-free Resolution Paths
inferred← citeshttps://doi.org/10.1145/3786779openalex-snapshot
Extending Merge Resolution to a Family of QBF-Proof Systems
inferred← citeshttps://doi.org/10.1609/aaai.v39i11.33215openalex-snapshot
Proof Simulation via Round-based Strategy Extraction for QBF
inferred← citeshttps://doi.org/10.1609/aaai.v39i11.33233openalex-snapshot
Computationally Hard Problems Are Hard for QBF Proof Systems Too
inferred← citeshttps://doi.org/10.1613/jair.1.14710openalex-snapshot
Classes of Hard Formulas for QBF Resolution
inferred← citeshttps://doi.org/10.1613/jair.1.15522openalex-snapshot
QCDCL vs QBF Resolution: Further Insights
inferred← citeshttps://doi.org/10.24963/ijcai.2022/245openalex-snapshot
Hierarchical Bilevel Learning with Architecture and Loss Search for Hadamard-based Image Restoration
inferred← citeshttps://doi.org/10.24963/ijcai.2022/248openalex-snapshot
QCDCL with Cube Learning or Pure Literal Elimination - What is Best?
inferred← citeshttps://doi.org/10.3233/sat-231505openalex-snapshot
The Riis Complexity Gap for QBF Resolution
inferred← citeshttps://doi.org/10.46298/lmcs-19(2:2)2023openalex-snapshot
Understanding the Relative Strength of QBF CDCL Solvers and QBF Resolution
inferred← citeshttps://doi.org/10.46298/lmcs-20(1:14)2024openalex-snapshot
Towards Uniform Certification in QBF
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.