An overview of parallel SAT solving
From MaRDI portal
Publication:487635
DOI10.1007/S10601-012-9121-3zbMATH Open1309.90057OpenAlexW2027282006MaRDI QIDQ487635FDOQ487635
Authors: Ruben Martins, Inês Lynce, Vasco Manquinho 
Publication date: 22 January 2015
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10601-012-9121-3
Recommendations
Cites Work
- ManySAT: a parallel SAT solver
- Theory and Applications of Satisfiability Testing
- PSATO: A distributed propositional prover and its application to quasigroup problems
- BerkMin: A fast and robust SAT-solver
- Title not available (Why is that?)
- Title not available (Why is that?)
- Theory and Applications of Satisfiability Testing
- A Computing Procedure for Quantification Theory
- A machine program for theorem-proving
- Optimal speedup of Las Vegas algorithms
- NP is as easy as detecting unique solutions
- Theory and Applications of Satisfiability Testing
- Adopt: asynchronous distributed constraint optimization with quality guarantees
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the power of clause-learning SAT solvers as resolution engines
- A Generalized Framework for Conflict Analysis
- Theory and Applications of Satisfiability Testing
- On the parallel complexity of discrete relaxation in constraint satisfaction networks
- A distributed arc-consistency algorithm
- A fast parallel SAT-solver -- efficient workload balancing
- Efficient data structures for backtrack search SAT solvers
- Autarky pruning in propositional model elimination reduces failure redundancy
- Investigations on autark assignments
- Parallelizing SATZ using dynamic workload balancing
- PaSAT -- parallel SAT-checking with lemma exchange: Implementation and applications
- Deterministic parallel DPLL
- Cache conscious data structures for Boolean satisfiability solvers
- A Decision-Making Procedure for Resolution-Based SAT-Solvers
- Boosting Distributed Constraint Satisfaction
- Practical algorithms for unsatisfiability proof and core generation in SAT solvers
- Title not available (Why is that?)
- SAT solving with reference points
- Improving Unsatisfiability-Based Algorithms for Boolean Optimization
- Theory and Applications of Satisfiability Testing
- Local Search for Unsatisfiability
- Determinization of Resolution by an Algorithm Operating on Complete Assignments
- A collaborative approach for multi-threaded SAT solving
Cited In (15)
- Solving SAT in a distributed cloud: a portfolio approach
- On Using Incremental Encodings in Unsatisfiability-based MaxSAT Solving
- A review of literature on parallel constraint solving
- HordeSat: A Massively Parallel Portfolio SAT Solver
- FiberSCIP—A Shared Memory Parallelization of SCIP
- Title not available (Why is that?)
- An Expressive Model for Instance Decomposition Based Parallel SAT Solvers
- Large-scale parallelism for constraint-based local search: the costas array case study
- Cooperative parallel SAT local search with path relinking
- Fractal Parallelism: Solving SAT in Bounded Space and Time
- Search-Space Partitioning for Parallelizing SMT Solvers
- Asynchronous Multi-core Incremental SAT Solving
- Using sequential runtime distributions for the parallel speedup prediction of SAT local search
- Learning discrete decomposable graphical models via constraint optimization
- Title not available (Why is that?)
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)
