HordeSat: A Massively Parallel Portfolio SAT Solver

@inproceedings{Balyo2015HordeSatAM,
  title={HordeSat: A Massively Parallel Portfolio SAT Solver},
  author={Tom{\'a}s Balyo and P. Sanders and C. Sinz},
  booktitle={SAT},
  year={2015}
}
A simple yet successful approach to parallel satisfiability (SAT) solving is to run several different (a portfolio of) SAT solvers on the input problem at the same time until one solver finds a solution. The SAT solvers in the portfolio can be instances of a single solver with different configuration settings. Additionally the solvers can exchange information usually in the form of clauses. In this paper we investigate whether this approach is applicable in the case of massively parallel SAT… Expand
Tuning Parallel SAT Solvers
Distributed Domain Propagation
Automatic construction of parallel portfolios via algorithm configuration
Dissolve: A Distributed SAT Solver Based on Stalmarck's Method
Memory Efficient Parallel SAT Solving with Inprocessing
  • M. Iser, Tomás Balyo, C. Sinz
  • Computer Science
  • 2019 IEEE 31st International Conference on Tools with Artificial Intelligence (ICTAI)
  • 2019
SAT and CP - Parallelisation and Applications
Design, implementation and evaluation of a distributed CDCL framework
HordeQBF: A Modular and Massively Parallel QBF Solver
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 30 REFERENCES
Designing Scalable Parallel SAT Solvers
ManySAT: a Parallel SAT Solver
An overview of parallel SAT solving
GridSAT: A Chaff-based Distributed SAT Solver for the Grid
Grid-Based SAT Solving with Iterative Partitioning and Clause Learning
A Parallelization Scheme Based on Work Stealing for a Class of SAT Solvers
GrADSAT: A Parallel SAT Solver for the Grid
c-sat: A Parallel SAT Solver for Clusters
Incorporating Clause Learning in Grid-Based Randomized SAT Solving
Parallel SAT Solving on Peer-to-Peer Desktop Grids
...
1
2
3
...