A fast parallel SAT-solver -- efficient workload balancing

DOI10.1007/BF02127976MaRDI QIDQ1380435zbMATH OpenOpenAlexFDO

Authors Max Böhm, Ewald Speckenmeyer

Publication date 4 March 1998

Published in Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02127976

zbMATH Keywords

MIMD machineSAT-solver

Mathematics Subject Classification ID

Recommendations

• A parallelization scheme based on work stealing for a class of SAT solvers
• Parallelizing SATZ using dynamic workload balancing
• ManySAT: a parallel SAT solver
• scientific article; zbMATH DE number 5510692
• PSATO: A distributed propositional prover and its application to quasigroup problems

Cites work

• A Computing Procedure for Quantification Theory
• Analysis of Two Simple Heuristics on a Random Instance ofk-sat
• Approximating the unsatisfiability threshold of random formulas
• Elimination of Infrequent Variables Improves Average Case Performance of Satisfiability Algorithms
• scientific article; zbMATH DE number 4178775 (Why is no real title available?)
• scientific article; zbMATH DE number 1113993 (Why is no real title available?)
• scientific article; zbMATH DE number 1149403 (Why is no real title available?)
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• Solving satisfiability in less than \(2^ n\) steps
• The complexity of theorem-proving procedures
• The intractability of resolution

Cited in

(23)

• Linear CNF formulas and satisfiability
• Solving satisfiability problems using elliptic approximations -- effective branching rules
• The Multi-SAT algorithm
• Fast and parallel decomposition of constraint satisfaction problems
• PSATO: A distributed propositional prover and its application to quasigroup problems
• XSAT and NAE-SAT of linear CNF classes
• Parallelizing SATZ using dynamic workload balancing
• PaSAT -- parallel SAT-checking with lemma exchange: Implementation and applications
• Fractal Parallelism: Solving SAT in Bounded Space and Time
• scientific article; zbMATH DE number 1002950 (Why is no real title available?)
• DPLL: the core of modern satisfiability solvers
• HordeSat: a massively parallel portfolio SAT solver
• Search-space partitioning for parallelizing SMT solvers
• scientific article; zbMATH DE number 5510692 (Why is no real title available?)
• An overview of parallel SAT solving
• Challenges in Constraint-Based Analysis of Hybrid Systems
• Parallelizing local search for CNF satisfiability using vectorization and PVM
• Distributed bounded model checking
• A parallelization scheme based on work stealing for a class of SAT solvers
• Backjumping for quantified Boolean logic satisfiability
• A collaborative approach for multi-threaded SAT solving
• A competitive and cooperative approach to propositional satisfiability
• The SAT-based approach to separation logic

This page was built for publication: A fast parallel SAT-solver -- efficient workload balancing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1380435)