On the public citation graph

A Clause-Based Heuristic for SAT Solvers

https://doi.org/10.1007/11499107_4
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.
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.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/3-540-48159-1_5openalex-snapshot
The Impact of Branching Heuristics in Propositional Satisfiability Algorithms
inferredcites →https://doi.org/10.1007/978-3-540-24605-3_37openalex-snapshot
An Extensible SAT-solver
inferredcites →https://doi.org/10.1007/bf01531077openalex-snapshot
Solving propositional satisfiability problems
inferredcites →https://doi.org/10.1007/s10009-004-0183-4openalex-snapshot
A survey of recent advances in SAT-based formal verification
inferredcites →https://doi.org/10.1109/12.769433openalex-snapshot
GRASP: a search algorithm for propositional satisfiability
inferredcites →https://doi.org/10.1109/date.2002.998262openalex-snapshot
BerkMin: A fast and robust SAT-solver
inferredcites →https://doi.org/10.1145/368273.368557openalex-snapshot
A machine program for theorem-proving
inferredcites →https://doi.org/10.1145/378239.379017openalex-snapshot
Chaff

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11814948_5openalex-snapshot
A Scalable Algorithm for Minimal Unsatisfiable Core Extraction
inferred← citeshttps://doi.org/10.1007/11916277_33openalex-snapshot
Boolean Rings for Intersection-Based Satisfiability
inferred← citeshttps://doi.org/10.1007/978-3-319-50349-3_16openalex-snapshot
Parallelizing Constraint Solvers for Hard RCPSP Instances
inferred← citeshttps://doi.org/10.1007/978-3-540-71070-7_35openalex-snapshot
Deciding Effectively Propositional Logic Using DPLL and Substitution Sets
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-79719-7_19openalex-snapshot
Nenofex: Expanding NNF for QBF Solving
inferred← citeshttps://doi.org/10.1007/978-3-642-02777-2_46openalex-snapshot
PaQuBE: Distributed QBF Solving with Advanced Knowledge Sharing
inferred← citeshttps://doi.org/10.1007/978-3-642-14186-7_35openalex-snapshot
Assignment Stack Shrinking
inferred← citeshttps://doi.org/10.1007/978-3-642-14186-7_7openalex-snapshot
Rewriting (Dependency-)Quantified 2-CNF with Arbitrary Free Literals into Existential 2-HORN
inferred← citeshttps://doi.org/10.1007/978-3-642-21581-0_23openalex-snapshot
Generating Diverse Solutions in SAT
inferred← citeshttps://doi.org/10.1007/s10817-009-9156-3openalex-snapshot
On Modern Clause-Learning Satisfiability Solvers
inferred← citeshttps://doi.org/10.1109/iaeac50856.2021.9391059openalex-snapshot
A Bi-directional LSTM Ship Trajectory Prediction Method based on Attention Mechanism
inferred← citeshttps://doi.org/10.1109/iccad.2010.5654209openalex-snapshot
Reduction of interpolants for logic synthesis
inferred← citeshttps://doi.org/10.1109/ipdpsw.2012.57openalex-snapshot
SMPP: Generic SAT Solver over Reconfigurable Hardware Accelerator
inferred← citeshttps://doi.org/10.1109/synasc.2013.30openalex-snapshot
Bound Propagation for Arithmetic Reasoning in Vampire
inferred← citeshttps://doi.org/10.1109/vlsisoc.2006.313213openalex-snapshot
A Fast SAT Solver Strategy Based on Negated Clauses
inferred← citeshttps://doi.org/10.1145/1150343.1150380openalex-snapshot
A fast SAT solver algorithm best suited to reconfigurable hardware
inferred← citeshttps://doi.org/10.1145/1177352.1177354openalex-snapshot
Propositional Satisfiability and Constraint Programming
inferred← citeshttps://doi.org/10.14236/ewic/vocs2008.8openalex-snapshot
A Hardware Relaxation Paradigm for Solving NP-Hard Problems
inferred← citeshttps://doi.org/10.1609/socs.v8i1.18422openalex-snapshot
Boost SAT Solver with Hybrid Branching Heuristic
inferred← citeshttps://doi.org/10.3233/sat190061openalex-snapshot
HaifaSat: a SAT solver based on an Abstraction/Refinement model
inferred← citeshttps://doi.org/10.48550/arxiv.1110.5867openalex-snapshot
From Total Assignment Enumeration to Modern SAT Solver
inferred← citeshttps://doi.org/10.5555/1998496.1998537openalex-snapshot
Boosting minimal unsatisfiable core extraction
inferred← citeshttps://doi.org/10.5555/2133429.2133556openalex-snapshot
Reduction of interpolants for logic synthesis
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.