HordeSat: A Massively Parallel Portfolio SAT Solver

DOI10.1007/978-3-319-24318-4_12zbMath1471.68237arXiv1505.03340OpenAlexW866331153MaRDI QIDQ3453220

Carsten Sinz, Tomáš Balyo, Peter Sanders

Publication date: 20 November 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1505.03340

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (10)

\texttt{mplrs}: a scalable parallel vertex/facet enumeration code ⋮ Towards better heuristics for solving bounded model checking problems ⋮ Computing Storyline Visualizations with Few Block Crossings ⋮ Automatic construction of parallel portfolios via algorithm configuration ⋮ HordeQBF: A Modular and Massively Parallel QBF Solver ⋮ SAT competition 2020 ⋮ The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17) ⋮ The \textsc{MergeSat} solver ⋮ Scalable SAT solving in the cloud ⋮ The Service-Oriented Multiagent Approach to High-Performance Scientific Computing

Uses Software

• c-sat
• ManySAT
• MiniSat
• GridSAT
• MPI/MPICH
• Chaff
• Plingeling
• GrADSAT
• PMSat
• ZetaSAT
• Treengeling
• HordeSat
• Lingeling

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An overview of parallel SAT solving
• A high-performance, portable implementation of the MPI message passing interface standard
• A parallelization scheme based on work stealing for a class of SAT solvers
• GridSAT: Design and implementation of a computational grid application
• Inprocessing Rules
• Lazy Clause Exchange Policy for Parallel SAT Solvers
• Space/time trade-offs in hash coding with allowable errors
• Computer Aided Verification

This page was built for publication: HordeSat: A Massively Parallel Portfolio SAT Solver