On the public citation graph

Incorporating Clause Learning in Grid-Based Randomized SAT Solving1

https://doi.org/10.3233/sat190069
0 signed · 44 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/jsco.1996.0030openalex-snapshot
PSATO: a Distributed Propositional Prover and its Application to Quasigroup Problems
inferredcites →https://doi.org/10.1007/11499107_5openalex-snapshot
Effective Preprocessing in SAT Through Variable and Clause Elimination
inferredcites →https://doi.org/10.1007/11814948_39openalex-snapshot
A Distribution Method for Solving SAT in Grids
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-85110-3_11openalex-snapshot
Strategies for Solving SAT in Grids by Randomized Search
inferredcites →https://doi.org/10.1007/978-3-540-85776-1_21openalex-snapshot
Incorporating Learning in Grid-Based Randomized SAT Solving
inferredcites →https://doi.org/10.1007/bf02127976openalex-snapshot
A fast parallel SAT-solver — efficient workload balancing
inferredcites →https://doi.org/10.1007/s10817-005-1970-7openalex-snapshot
A Parallelization Scheme Based on Work Stealing for a Class of SAT Solvers
inferredcites →https://doi.org/10.1016/j.dam.2006.04.015openalex-snapshot
A competitive and cooperative approach to propositional satisfiability
inferredcites →https://doi.org/10.1016/j.entcs.2004.10.020openalex-snapshot
Parallel Multithreaded Satisfiability Solver: Design and Implementation
inferredcites →https://doi.org/10.1016/s0004-3702(00)00081-3openalex-snapshot
Algorithm portfolios
inferredcites →https://doi.org/10.1016/s1571-0653(04)00323-3openalex-snapshot
PaSAT — Parallel SAT-Checking with Lemma Exchange: Implementation and Applications
inferredcites →https://doi.org/10.1023/a:1006314320276openalex-snapshot
Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems
inferredcites →https://doi.org/10.1109/12.769433openalex-snapshot
GRASP: a search algorithm for propositional satisfiability
inferredcites →https://doi.org/10.1109/ccgrid.2005.1558680openalex-snapshot
ZetaSAT - Boolean SATisfiability solving on Desktop Grids
inferredcites →https://doi.org/10.1109/dac.2001.935565openalex-snapshot
Chaff: engineering an efficient SAT solver
inferredcites →https://doi.org/10.1109/dac.2007.375231openalex-snapshot
Alembic: An Efficient Algorithm for CNF Preprocessing
inferredcites →https://doi.org/10.1109/iccad.2001.968634openalex-snapshot
Efficient conflict driven learning in a Boolean satisfiability solver
inferredcites →https://doi.org/10.1109/mtv.2005.17openalex-snapshot
PaMira - A Parallel SAT Solver with Knowledge Sharing
inferredcites →https://doi.org/10.1109/tsmcb.2002.805807openalex-snapshot
A Simplifier for Propositional Formulas With Many Binary Clauses
inferredcites →https://doi.org/10.1145/1048935.1050188openalex-snapshot
GridSAT
inferredcites →https://doi.org/10.1145/1278480.1278628openalex-snapshot
Alembic
inferredcites →https://doi.org/10.1145/321033.321034openalex-snapshot
A Computing Procedure for Quantification Theory
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/978-3-319-24318-4_12openalex-snapshot
HordeSat: A Massively Parallel Portfolio SAT Solver
inferred← citeshttps://doi.org/10.1007/978-3-319-24318-4_27openalex-snapshot
Search-Space Partitioning for Parallelizing SMT Solvers
inferred← citeshttps://doi.org/10.1007/978-3-319-43174-1_4openalex-snapshot
Exploiting Logic Properties to Speedup SAT
inferred← citeshttps://doi.org/10.1007/978-3-319-46520-3_27openalex-snapshot
Clause Sharing and Partitioning for Cloud-Based SMT Solving
inferred← citeshttps://doi.org/10.1007/978-3-319-63516-3_6openalex-snapshot
Parallel Theorem Proving
inferred← citeshttps://doi.org/10.1007/978-3-642-10291-2_25openalex-snapshot
Partitioning Search Spaces of a Randomized Search
inferred← citeshttps://doi.org/10.1007/978-3-642-16242-8_27openalex-snapshot
Partitioning SAT Instances for Distributed Solving
inferred← citeshttps://doi.org/10.1007/978-3-642-23786-7_30openalex-snapshot
Grid-Based SAT Solving with Iterative Partitioning and Clause Learning
inferred← citeshttps://doi.org/10.1007/978-3-642-31612-8_17openalex-snapshot
Designing Scalable Parallel SAT Solvers
inferred← citeshttps://doi.org/10.1016/j.dam.2014.05.007openalex-snapshot
On the van der Waerden numbers w(2;3,t)
inferred← citeshttps://doi.org/10.1017/s1471068418000340openalex-snapshot
A review of literature on parallel constraint solving
inferred← citeshttps://doi.org/10.1109/ictai.2014.112openalex-snapshot
Building Portfolios for Parallel Constraint Solving by Varying the Local Consistency Applied
inferred← citeshttps://doi.org/10.1109/isvlsi.2015.18openalex-snapshot
Exploiting Circuit Duality to Speed up SAT
inferred← citeshttps://doi.org/10.1145/2903220.2903228openalex-snapshot
Using Parallelization to Efficiently Exploit the Pruning Power of Strong Local Consistencies
inferred← citeshttps://doi.org/10.1504/ijica.2018.10011774openalex-snapshot
Hybrid algorithms for 3-SAT optimisation using MapReduce on clouds
inferred← citeshttps://doi.org/10.23919/fmcad.2017.8102254openalex-snapshot
Designing parallel PDR
inferred← citeshttps://doi.org/10.3233/fi-2011-404openalex-snapshot
Partitioning Search Spaces of a Randomized Search
inferred← citeshttps://doi.org/10.4204/eptcs.14.5openalex-snapshot
Tarmo: A Framework for Parallelized Bounded Model Checking
inferred← citeshttps://doi.org/10.70675/f8814ffbz8dc8z41eaz95c1z0fd7117320aaopenalex-snapshot
Towards more efficient parallel SAT solving
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.