An overview of parallel SAT solving
From MaRDI portal
Publication:487635
Recommendations
Cites work
- scientific article; zbMATH DE number 5613972 (Why is no real title available?)
- scientific article; zbMATH DE number 5510691 (Why is no real title available?)
- scientific article; zbMATH DE number 5620835 (Why is no real title available?)
- scientific article; zbMATH DE number 2080328 (Why is no real title available?)
- scientific article; zbMATH DE number 956863 (Why is no real title available?)
- A Computing Procedure for Quantification Theory
- A Decision-Making Procedure for Resolution-Based SAT-Solvers
- A Generalized Framework for Conflict Analysis
- A collaborative approach for multi-threaded SAT solving
- A distributed arc-consistency algorithm
- A fast parallel SAT-solver -- efficient workload balancing
- A machine program for theorem-proving
- Adopt: asynchronous distributed constraint optimization with quality guarantees
- Autarky pruning in propositional model elimination reduces failure redundancy
- BerkMin: A fast and robust SAT-solver
- Boosting Distributed Constraint Satisfaction
- Cache conscious data structures for Boolean satisfiability solvers
- Deterministic parallel DPLL
- Determinization of Resolution by an Algorithm Operating on Complete Assignments
- Efficient data structures for backtrack search SAT solvers
- Improving Unsatisfiability-Based Algorithms for Boolean Optimization
- Investigations on autark assignments
- Local Search for Unsatisfiability
- ManySAT: a parallel SAT solver
- NP is as easy as detecting unique solutions
- On the parallel complexity of discrete relaxation in constraint satisfaction networks
- On the power of clause-learning SAT solvers as resolution engines
- Optimal speedup of Las Vegas algorithms
- PSATO: A distributed propositional prover and its application to quasigroup problems
- PaSAT -- parallel SAT-checking with lemma exchange: Implementation and applications
- Parallelizing SATZ using dynamic workload balancing
- Practical algorithms for unsatisfiability proof and core generation in SAT solvers
- SAT solving with reference points
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
Cited in
(16)- Fractal Parallelism: Solving SAT in Bounded Space and Time
- Handbook of parallel constraint reasoning
- Cooperative parallel SAT local search with path relinking
- Search-space partitioning for parallelizing SMT solvers
- An expressive model for instance decomposition based parallel SAT solvers
- HordeSat: a massively parallel portfolio SAT solver
- On using incremental encodings in unsatisfiability-based MaxSAT solving
- Using sequential runtime distributions for the parallel speedup prediction of SAT local search
- FiberSCIP—A Shared Memory Parallelization of SCIP
- A review of literature on parallel constraint solving
- Learning discrete decomposable graphical models via constraint optimization
- scientific article; zbMATH DE number 5620835 (Why is no real title available?)
- Large-scale parallelism for constraint-based local search: the costas array case study
- Solving SAT in a distributed cloud: a portfolio approach
- Asynchronous Multi-core Incremental SAT Solving
- scientific article; zbMATH DE number 5510692 (Why is no real title available?)
Describes a project that uses
Uses Software
This page was built for publication: An overview of parallel SAT solving
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q487635)
