On the public citation graph
PMSat: a parallel version of MiniSAT
0 signed · 56 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.1006/jsco.1996.0030openalex-snapshot
PSATO: a Distributed Propositional Prover and its Application to Quasigroup Problems
inferredcites →https://doi.org/10.1007/978-3-540-24605-3_37openalex-snapshot
An Extensible SAT-solver
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/s0020-0190(99)00088-5openalex-snapshot
A constraint-based approach to narrow search trees for satisfiability
inferredcites →https://doi.org/10.1016/s0378-4754(99)00049-xopenalex-snapshot
An object-oriented platform for distributed high-performance symbolic computation
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.1109/dac.2001.935565openalex-snapshot
Chaff: engineering an efficient SAT solver
inferredcites →https://doi.org/10.1145/368273.368557openalex-snapshot
A machine program for theorem-proving
inferredcites →https://doi.org/10.1145/78607.78614openalex-snapshot
Measuring parallel processor performance
inferredcites →https://doi.org/10.1145/800157.805047openalex-snapshot
The complexity of theorem-proving procedures
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-09284-3_14openalex-snapshot
Community Branching for Parallel Portfolio SAT Solvers
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-642-02777-2_47openalex-snapshot
c-sat: A Parallel SAT Solver for Clusters
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-15396-9_22openalex-snapshot
Diversification and Intensification in Parallel SAT Solving
inferred← citeshttps://doi.org/10.1007/978-3-642-31612-8_49openalex-snapshot
An Efficient Method for Solving UNSAT 3-SAT and Similar Instances via Static Decomposition
inferred← citeshttps://doi.org/10.1007/978-3-642-41482-4_3openalex-snapshot
Parallel Tree Search for Satisfiability
inferred← citeshttps://doi.org/10.1007/978-3-642-44973-4_6openalex-snapshot
Sharing Information in Parallel Search with Search Space Partitioning
inferred← citeshttps://doi.org/10.1007/978-3-642-54108-7_5openalex-snapshot
Parallel Bounded Verification of Alloy Models by TranScoping
inferred← citeshttps://doi.org/10.1007/s10462-018-9628-0openalex-snapshot
A comprehensive study and analysis on SAT-solvers: advances, usages and achievements
inferred← citeshttps://doi.org/10.1007/s10601-012-9121-3openalex-snapshot
An overview of parallel SAT solving
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.1080/0952813x.2014.954274openalex-snapshot
CUD@SAT: SAT solving on GPUs
inferred← citeshttps://doi.org/10.1109/access.2020.2999382openalex-snapshot
An Effective SAT Solver Utilizing ACO Based on Heterogenous Systems
inferred← citeshttps://doi.org/10.1109/ase.2013.6693075openalex-snapshot
Ranger: Parallel analysis of alloy models by range partitioning
inferred← citeshttps://doi.org/10.1109/grid.2011.40openalex-snapshot
SAT Over BOINC: An Application-Independent Volunteer Grid Project
inferred← citeshttps://doi.org/10.1109/hpcs.2010.5547119openalex-snapshot
Portfolio-based Parallel SAT solving
inferred← citeshttps://doi.org/10.1109/hpcsim.2009.5195312openalex-snapshot
Comparison of knowledge sharing strategies in a parallel QBF solver
inferred← citeshttps://doi.org/10.1109/icces.2015.7393031openalex-snapshot
On the parallelization of SAT solvers
inferred← citeshttps://doi.org/10.1109/icemi.2011.6037887openalex-snapshot
Improving generation method for test pattern based on BDD learning
inferred← citeshttps://doi.org/10.1109/icices.2014.7033875openalex-snapshot
Overview of sequential and parallel SAT solvers
inferred← citeshttps://doi.org/10.1109/icpp.2013.20openalex-snapshot
A Dynamic Moldable Job Scheduling Based Parallel SAT Solver
inferred← citeshttps://doi.org/10.1109/ictai.2010.56openalex-snapshot
Improving Search Space Splitting for Parallel SAT Solving
inferred← citeshttps://doi.org/10.1109/ictai.2019.00018openalex-snapshot
Memory Efficient Parallel SAT Solving with Inprocessing
inferred← citeshttps://doi.org/10.1109/pdmc-hibi.2010.8openalex-snapshot
Parallel SAT solving [Invited paper abstract]
inferred← citeshttps://doi.org/10.1109/pdp.2017.70openalex-snapshot
Parallel Satisfiability Solver Based on Hybrid Partitioning Method
inferred← citeshttps://doi.org/10.1142/s0218213018500331openalex-snapshot
Revisiting the Learned Clauses Database Reduction Strategies
inferred← citeshttps://doi.org/10.1145/2483760.2483770openalex-snapshot
Parallel bounded analysis in code with rich invariants by refinement of field bounds
inferred← citeshttps://doi.org/10.1145/3102304.3102336openalex-snapshot
The Message-Passing Interface and Parallel SAT-Solvers
inferred← citeshttps://doi.org/10.1145/3485447.3512196openalex-snapshot
SATMargin: Practical Maximal Frequent Subgraph Mining via Margin Space Sampling
inferred← citeshttps://doi.org/10.13016/m28hdb-uounopenalex-snapshot
Leveraging Artificial Intelligence to Advance Problem-Solving with Quantum Annealers
inferred← citeshttps://doi.org/10.1609/aaai.v37i13.27060openalex-snapshot
Dagster: Parallel Structured Search
inferred← citeshttps://doi.org/10.25209/2079-3316-2016-7-1-99-115openalex-snapshot
Non-paradoxical logical consequence and the problem of solving ML-equations
inferred← citeshttps://doi.org/10.2991/icmmct-17.2017.228openalex-snapshot
A Research on Minisat Using Coarse-grained Parallel Technique Based on Multi-core and Multi-platform
inferred← citeshttps://doi.org/10.3233/fi-2011-404openalex-snapshot
Partitioning Search Spaces of a Randomized Search
inferred← citeshttps://doi.org/10.48550/arxiv.1102.3563openalex-snapshot
Parallel algorithms for SAT in application to inversion problems of some discrete functions
inferred← citeshttps://doi.org/10.48550/arxiv.1505.03340openalex-snapshot
HordeSat: A Massively Parallel Portfolio SAT Solver
inferred← citeshttps://doi.org/10.70675/22f799bfz3181z4324z8161zb5470bfc9e34openalex-snapshot
Extensions of tractable classes for propositional satisfiability
inferred← citeshttps://doi.org/10.70675/5732022dzaf3bz44e9zae98z41d4facf3deaopenalex-snapshot
Contributions à la résolution du problème de la Satisfiabilité Propositionnelle
inferred← citeshttps://doi.org/10.70675/cf0edb8dz0512z4aeez99adzaaa58c3e2721openalex-snapshot
Declarative Approaches for Mining Frequent Itemsets over Transactional Databases
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.