On the public citation graph
Reusing the Assignment Trail in CDCL Solvers
0 signed · 26 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/978-3-540-24605-3_37openalex-snapshot
An Extensible SAT-solver
inferredcites →https://doi.org/10.1007/978-3-540-72788-0_28openalex-snapshot
A Lightweight Component Caching Scheme for Satisfiability Solvers
inferredcites →https://doi.org/10.1007/978-3-642-21581-0_18openalex-snapshot
Between Restarts and Backjumps
inferredcites →https://doi.org/10.1007/bfb0017434openalex-snapshot
Heavy-tailed distributions in combinatorial search
inferredcites →https://doi.org/10.1016/0020-0190(93)90029-9openalex-snapshot
Optimal speedup of Las Vegas algorithms
inferredcites →https://doi.org/10.1109/dac.2001.935565openalex-snapshot
Chaff: engineering an efficient SAT solver
inferredcites →https://doi.org/10.1109/istcs.1993.253477openalex-snapshot
Optimal speedup of Las Vegas algorithms
inferredcites →https://doi.org/10.3233/978-1-58603-929-5-131openalex-snapshot
Conflict-Driven Clause Learning SAT Solvers
inferredcites →https://doi.org/10.48550/arxiv.1402.4413openalex-snapshot
Towards Ultra Rapid Restarts
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_11openalex-snapshot
Speeding Up Assumption-Based SAT
inferred← citeshttps://doi.org/10.1007/978-3-030-51825-7_4openalex-snapshot
Trail Saving on Backtrack
inferred← citeshttps://doi.org/10.1007/978-3-319-11206-0_11openalex-snapshot
CDCL Solver Additions: Local Look-Ahead, All-Unit-UIP Learning and On-the-Fly Probing
inferred← citeshttps://doi.org/10.1007/978-3-319-24318-4_29openalex-snapshot
Evaluating CDCL Variable Scoring Schemes
inferred← citeshttps://doi.org/10.1007/978-3-642-39071-5_21openalex-snapshot
Factoring Out Assumptions to Speed Up MUS Extraction
inferred← citeshttps://doi.org/10.1007/978-3-642-45221-5_33openalex-snapshot
Partial Backtracking in CDCL Solvers
inferred← citeshttps://doi.org/10.1007/s13218-020-00669-4openalex-snapshot
SATPin: Axiom Pinpointing for Lightweight Description Logics Through Incremental SAT
inferred← citeshttps://doi.org/10.1016/j.dam.2024.10.021openalex-snapshot
On enumerating short projected models
inferred← citeshttps://doi.org/10.1109/iscid.2012.254openalex-snapshot
A Heuristic Restart Strategy to Speed Up the Solving of Satisfiability Problem
inferred← citeshttps://doi.org/10.1613/jair.1.16163openalex-snapshot
Satisfiability Modulo User Propagators
inferred← citeshttps://doi.org/10.29007/vgg4openalex-snapshot
Combining Conflict-Driven Clause Learning and Chronological Backtracking for Propositional Model Counting
inferred← citeshttps://doi.org/10.31274/etd-180810-2105openalex-snapshot
Efficient satisfiability solver
inferred← citeshttps://doi.org/10.3390/sym11020197openalex-snapshot
An Adaptive Strategy for Tuning Duplicate Trails in SAT Solvers
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.