An overview of parallel SAT solving
From MaRDI portal
Publication:487635
DOI10.1007/s10601-012-9121-3zbMath1309.90057OpenAlexW2027282006MaRDI QIDQ487635
Inês Lynce, Ruben Martins, Vasco M. 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
Related Items (11)
HordeSat: A Massively Parallel Portfolio SAT Solver ⋮ Search-Space Partitioning for Parallelizing SMT Solvers ⋮ A review of literature on parallel constraint solving ⋮ An Expressive Model for Instance Decomposition Based Parallel SAT Solvers ⋮ FiberSCIP—A Shared Memory Parallelization of SCIP ⋮ Using sequential runtime distributions for the parallel speedup prediction of SAT local search ⋮ Learning discrete decomposable graphical models via constraint optimization ⋮ Solving SAT in a distributed cloud: a portfolio approach ⋮ Cooperative parallel SAT local search with path relinking ⋮ Large-scale parallelism for constraint-based local search: the costas array case study ⋮ On Using Incremental Encodings in Unsatisfiability-based MaxSAT Solving
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the power of clause-learning SAT solvers as resolution engines
- Optimal speedup of Las Vegas algorithms
- A collaborative approach for multi-threaded SAT solving
- NP is as easy as detecting unique solutions
- 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
- PSATO: A distributed propositional prover and its application to quasigroup problems
- Adopt: asynchronous distributed constraint optimization with quality guarantees
- On the parallel complexity of discrete relaxation in constraint satisfaction networks
- BerkMin: A fast and robust SAT-solver
- A Generalized Framework for Conflict Analysis
- A Decision-Making Procedure for Resolution-Based SAT-Solvers
- Boosting Distributed Constraint Satisfaction
- Practical algorithms for unsatisfiability proof and core generation in SAT solvers
- SAT Solving with Reference Points
- Improving Unsatisfiability-Based Algorithms for Boolean Optimization
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- A Computing Procedure for Quantification Theory
- A machine program for theorem-proving
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Local Search for Unsatisfiability
- Determinization of Resolution by an Algorithm Operating on Complete Assignments
This page was built for publication: An overview of parallel SAT solving
