On the public citation graph
Preface to the Special Volume on the SAT 2005 Competitions and Evaluations
0 signed · 34 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/11499107_12openalex-snapshot
Diversification and Determinism in Local Search for Satisfiability
inferredcites →https://doi.org/10.1007/11499107_15openalex-snapshot
Random Walk with Continuously Smoothed Variable Weights
inferredcites →https://doi.org/10.1007/11499107_34openalex-snapshot
Cost-Effective Hyper-Resolution for Preprocessing CNF Formulas
inferredcites →https://doi.org/10.1007/11499107_39openalex-snapshot
A New Set of Algebraic Benchmark Problems for SAT Solvers
inferredcites →https://doi.org/10.1007/11499107_5openalex-snapshot
Effective Preprocessing in SAT Through Variable and Clause Elimination
inferredcites →https://doi.org/10.1007/11513988_4openalex-snapshot
SMT-COMP: Satisfiability Modulo Theories Competition
inferredcites →https://doi.org/10.1007/11527695_24openalex-snapshot
UBCSAT: An Implementation and Experimentation Environment for SLS Algorithms for SAT and MAX-SAT
inferredcites →https://doi.org/10.1007/11527695_25openalex-snapshot
Fifty-Five Solvers in Vancouver: The SAT 2004 Competition
inferredcites →https://doi.org/10.1007/11527695_27openalex-snapshot
Zchaff2004: An Efficient SAT Solver
inferredcites →https://doi.org/10.1007/11564751_53openalex-snapshot
Lookahead Saturation with Restriction for SAT
inferredcites →https://doi.org/10.1007/3-540-46135-3_13openalex-snapshot
Recovering and Exploiting Structural Knowledge from CNF Formulas
inferredcites →https://doi.org/10.1007/978-3-540-24605-3_34openalex-snapshot
The Essentials of the SAT 2003 Competition
inferredcites →https://doi.org/10.1016/s1571-0653(04)00318-xopenalex-snapshot
SatEx: A Web-based Framework for SAT Experimentation
inferredcites →https://doi.org/10.1109/date.2004.1268859openalex-snapshot
Exploiting signal unobservability for efficient translation to CNF in formal verification of microprocessors
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11853886_43openalex-snapshot
optsat: A Tool for Solving SAT Related Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-06167-8_5openalex-snapshot
Reasoning with Propositional Logic: From SAT Solvers to Knowledge Compilation
inferred← citeshttps://doi.org/10.1007/978-3-319-27436-2_21openalex-snapshot
Why CP Portfolio Solvers Are (under)Utilized? Issues and Challenges
inferred← citeshttps://doi.org/10.1007/978-3-540-72200-7_3openalex-snapshot
The First Answer Set Programming System Competition
inferred← citeshttps://doi.org/10.1007/978-3-540-79719-7_7openalex-snapshot
Attacking Bivium Using SAT Solvers
inferred← citeshttps://doi.org/10.1007/s10601-010-9095-yopenalex-snapshot
Solving satisfiability problems with preferences
inferred← citeshttps://doi.org/10.1007/s10817-007-9074-1openalex-snapshot
Visualizing SAT Instances and Runs of the DPLL Algorithm
inferred← citeshttps://doi.org/10.1007/s10994-010-5233-4openalex-snapshot
Creating non-minimal triangulations for use in inference in mixed stochastic/deterministic graphical models
inferred← citeshttps://doi.org/10.1109/tevc.2022.3215013openalex-snapshot
Sparkle: Toward Accessible Meta-Algorithmics for Improving the State of the Art in Solving Challenging Problems
inferred← citeshttps://doi.org/10.1145/1185448.1185456openalex-snapshot
A SAT-based solver for Q-ALL SAT
inferred← citeshttps://doi.org/10.15388/informatica.2010.273openalex-snapshot
Formal Correctness Proof for DPLL Procedure
inferred← citeshttps://doi.org/10.1609/aaai.v31i1.11133openalex-snapshot
Phase Transitions for Scale-Free SAT Formulas
inferred← citeshttps://doi.org/10.1613/jair.2808openalex-snapshot
Relaxed Survey Propagation for The Weighted Maximum Satisfiability Problem
inferred← citeshttps://doi.org/10.1613/jair.4016openalex-snapshot
Optimal Implementation of Watched Literals and More General Techniques
inferred← citeshttps://doi.org/10.2168/lmcs-4(4:13)2008openalex-snapshot
Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning
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.