Scalable SAT solving in the cloud

DOI10.1007/978-3-030-80223-3_35OpenAlexW3184472707MaRDI QIDQ2118345

Dominik Schreiber, Peter Sanders

Publication date: 22 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-80223-3_35

zbMATH Keywords

distributed computingparallel SAT solvingmalleable load balancing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational aspects of satisfiability (68R07)

Related Items (1)

SAT competition 2020

Uses Software

• ManySAT
• MPI
• PaMiraXT
• Plingeling
• Treengeling
• HordeSat
• PaInleSS
• Splatz
• Lingeling
• YalSAT
• CaDiCaL
• Paracooba
• Kissat

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• YalSAT
• A high-performance, portable implementation of the MPI message passing interface standard
• Local search algorithms for SAT: an empirical evaluation
• Job scheduling strategies for parallel processing. IPPS '96 workshop, Honolulu, HI, USA, April 16, 1996. Proceedings
• Logical cryptanalysis as a SAT problem: Encoding and analysis of the U. S. Data Encryption Standard
• Solving SAT in a distributed cloud: a portfolio approach
• Distributed cube and conquer with Paracooba
• HordeSat: A Massively Parallel Portfolio SAT Solver
• Lilotane: A Lifted SAT-based Approach to Hierarchical Planning
• Algorithms and Data Structures

This page was built for publication: Scalable SAT solving in the cloud