On the public citation graph
Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
0 signed · 90 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/3-540-46135-3_21openalex-snapshot
Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics
inferredcites →https://doi.org/10.1007/978-3-642-02777-2_13openalex-snapshot
Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
inferredcites →https://doi.org/10.1007/978-3-642-04244-7_51openalex-snapshot
On the Power of Clause-Learning SAT Solvers with Restarts
inferredcites →https://doi.org/10.1007/978-3-642-14186-7_4openalex-snapshot
Lower Bounds for Width-Restricted Clause Learning on Small Width Formulas
inferredcites →https://doi.org/10.1016/j.jcss.2007.06.025openalex-snapshot
A combinatorial characterization of resolution width
inferredcites →https://doi.org/10.1109/sfcs.2001.959895openalex-snapshot
Resolution is not automatizable unless W[P] is tractable
inferredcites →https://doi.org/10.1109/sfcs.2002.1181983openalex-snapshot
Satisfiability, branch-width and Tseitin tautologies
inferredcites →https://doi.org/10.1137/060668250openalex-snapshot
Narrow Proofs May Be Spacious:Separating Space and Width in Resolution
inferredcites →https://doi.org/10.1145/375827.375835openalex-snapshot
Short proofs are narrow—resolution made simple
inferredcites →https://doi.org/10.1613/jair.1410openalex-snapshot
Towards Understanding and Harnessing the Potential of Clause Learning
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_12openalex-snapshot
On CDCL-Based Proof Systems with the Ordered Decision Strategy
inferred← citeshttps://doi.org/10.1007/978-3-030-51825-7_14openalex-snapshot
Simplified and Improved Separations Between Regular and General Resolution by Lifting
inferred← citeshttps://doi.org/10.1007/978-3-030-51825-7_17openalex-snapshot
Towards a Complexity-Theoretic Understanding of Restarts in SAT Solvers
inferred← citeshttps://doi.org/10.1007/978-3-030-51825-7_25openalex-snapshot
Taming High Treewidth with Abstraction, Nested Dynamic Programming, and Database Technology
inferred← citeshttps://doi.org/10.1007/978-3-030-58475-7_15openalex-snapshot
Treewidth-Aware Quantifier Elimination and Expansion for QCSP
inferred← citeshttps://doi.org/10.1007/978-3-030-80223-3_22openalex-snapshot
On Dedicated CDCL Strategies for PB Solvers
inferred← citeshttps://doi.org/10.1007/978-3-031-33271-5_26openalex-snapshot
Generating Random Instances of Weighted Model Counting
inferred← citeshttps://doi.org/10.1007/978-3-031-89610-1_7openalex-snapshot
Bounded Henkin Quantifiers and the Exponential Time Hierarchy
inferred← citeshttps://doi.org/10.1007/978-3-319-09284-3_10openalex-snapshot
Long Proofs of (Seemingly) Simple Formulas
inferred← citeshttps://doi.org/10.1007/978-3-319-18008-3_15openalex-snapshot
BDD-Guided Clause Generation
inferred← citeshttps://doi.org/10.1007/978-3-319-21810-6_5openalex-snapshot
From CSP to SAT: width restrictions
inferred← citeshttps://doi.org/10.1007/978-3-319-40970-2_11openalex-snapshot
Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers
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-53925-6_28openalex-snapshot
An Upper Bound for Resolution Size: Characterization of Tractable SAT Instances
inferred← citeshttps://doi.org/10.1007/978-3-319-94144-8_18openalex-snapshot
In Between Resolution and Cutting Planes: A Study of Proof Systems for Pseudo-Boolean SAT Solving
inferred← citeshttps://doi.org/10.1007/978-3-319-96142-2_18openalex-snapshot
The Proof Complexity of SMT Solvers
inferred← citeshttps://doi.org/10.1007/978-3-319-98334-9_30openalex-snapshot
Learning-Sensitive Backdoors with Restarts
inferred← citeshttps://doi.org/10.1007/978-3-642-31612-8_5openalex-snapshot
An Improved Separation of Regular Resolution from Pool Resolution and Clause Learning
inferred← citeshttps://doi.org/10.1007/978-3-642-33558-7_14openalex-snapshot
On Computing Minimal Equivalent Subformulas
inferred← citeshttps://doi.org/10.1007/978-3-642-33558-7_25openalex-snapshot
Relating Proof Complexity Measures and Practical Hardness of SAT
inferred← citeshttps://doi.org/10.1007/978-3-642-39071-5_1openalex-snapshot
The Proof-Search Problem between Bounded-Width Resolution and Bounded-Degree Semi-algebraic Proofs
inferred← citeshttps://doi.org/10.1007/978-3-642-39206-1_58openalex-snapshot
The Complexity of Proving That a Graph Is Ramsey
inferred← citeshttps://doi.org/10.1007/s00453-016-0228-6openalex-snapshot
Strong ETH and Resolution via Games and the Multiplicity of Strategies
inferred← citeshttps://doi.org/10.1007/s00493-015-3193-9openalex-snapshot
The complexity of proving that a graph is Ramsey
inferred← citeshttps://doi.org/10.1007/s10601-016-9257-7openalex-snapshot
What is answer set programming to propositional satisfiability
inferred← citeshttps://doi.org/10.1007/s10817-024-09694-6openalex-snapshot
Should Decisions in QCDCL Follow Prefix Order?
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.1007/s10817-025-09745-6openalex-snapshot
Runtime vs. Extracted Proof Size: An Exponential Gap for CDCL on QBFs
inferred← citeshttps://doi.org/10.1007/s10817-026-09757-wopenalex-snapshot
The Relative Strength of #SAT Proof Systems
inferred← citeshttps://doi.org/10.1016/j.artint.2014.07.011openalex-snapshot
Algorithms for computing minimal equivalent subformulas
inferred← citeshttps://doi.org/10.1016/j.artint.2021.103552openalex-snapshot
Propositional proof systems based on maximum satisfiability
inferred← citeshttps://doi.org/10.1016/j.artint.2021.103651openalex-snapshot
Treewidth-aware reductions of normal ASP to SAT – Is normal ASP harder than SAT after all?
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.artint.2025.104470openalex-snapshot
Using execution logs for improving Pseudo-Boolean propagation
inferred← citeshttps://doi.org/10.1016/j.dam.2023.05.003openalex-snapshot
Are hitting formulas hard for resolution?
inferred← citeshttps://doi.org/10.1016/j.ipl.2012.03.009openalex-snapshot
A note on SAT algorithms and proof complexity
inferred← citeshttps://doi.org/10.1016/j.ipl.2018.04.014openalex-snapshot
A note about k -DNF resolution
inferred← citeshttps://doi.org/10.1017/9781108242066.006openalex-snapshot
Quantified Propositional Calculus
inferred← citeshttps://doi.org/10.1017/9781108242066.008openalex-snapshot
Algebraic and Geometric Proof Systems
inferred← citeshttps://doi.org/10.1017/9781108242066.010openalex-snapshot
Basic Example of the Correspondence between Theories and Proof Systems
inferred← citeshttps://doi.org/10.1017/9781108242066.011openalex-snapshot
The Two Worlds of Bounded Arithmetic
inferred← citeshttps://doi.org/10.1017/9781108242066.012openalex-snapshot
Up to EF via the 〈. . .〉 Translation
inferred← citeshttps://doi.org/10.1017/9781108242066.013openalex-snapshot
Examples of Upper Bounds and p-Simulations
inferred← citeshttps://doi.org/10.1017/9781108242066.014openalex-snapshot
Beyond EF via the || . . . || Translation
inferred← citeshttps://doi.org/10.1017/9781108242066.016openalex-snapshot
LKd+1/2 and Combinatorial Restrictions
inferred← citeshttps://doi.org/10.1017/9781108242066.017openalex-snapshot
Fd and Logical Restrictions
inferred← citeshttps://doi.org/10.1017/9781108242066.018openalex-snapshot
Algebraic and Geometric Proof Systems
inferred← citeshttps://doi.org/10.1017/9781108242066.019openalex-snapshot
Feasible Interpolation: A Framework
inferred← citeshttps://doi.org/10.1017/9781108242066.020openalex-snapshot
Feasible Interpolation: Applications
inferred← citeshttps://doi.org/10.1017/9781108242066.022openalex-snapshot
Model Theory and Lower Bounds
inferred← citeshttps://doi.org/10.1017/9781108242066.024openalex-snapshot
The Nature of Proof Complexity
inferred← citeshttps://doi.org/10.1109/focs.2012.48openalex-snapshot
On the Complexity of Finding Narrow Proofs
inferred← citeshttps://doi.org/10.1109/icmisi61517.2024.10580520openalex-snapshot
Quantum Answer Set Programming Solver Using Amplitude Amplification
inferred← citeshttps://doi.org/10.1109/tbdata.2025.3640025openalex-snapshot
Generation of Hard SAT Instances and Its Application in Negative Databases for Privacy Enhancement
inferred← citeshttps://doi.org/10.1137/120895950openalex-snapshot
Space Complexity in Polynomial Calculus
inferred← citeshttps://doi.org/10.1371/journal.pone.0272967openalex-snapshot
Too much information: Why CDCL solvers need to forget learned clauses
inferred← citeshttps://doi.org/10.1515/itit-2023-0004openalex-snapshot
Advanced tools and methods for treewidth-based problem solving
inferred← citeshttps://doi.org/10.3233/aic-180769openalex-snapshot
New stochastic local search approaches for computing preferred extensions of abstract argumentation
inferred← citeshttps://doi.org/10.3233/sat-231507openalex-snapshot
Proof Complexity of Propositional Model Counting
inferred← citeshttps://doi.org/10.3390/math13050868openalex-snapshot
Research on Abstraction-Based Search Space Partitioning and Solving Satisfiability Problems
inferred← citeshttps://doi.org/10.4204/eptcs.364.18openalex-snapshot
Proceedings 38th International Conference on Logic Programming
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.70675/41a21d4bz191ez4409za183z754a7064aeafopenalex-snapshot
Raisonnement à partir de contraintes pseudo-booléennes et compilation
inferred← citeshttps://doi.org/10.70675/4a8859a0z611ez41eezbcd9zacdf7026c150openalex-snapshot
Optimisation booléenne multiobjectif : complexité sous contraintes compilées et résolution via SAT
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.