Scalable SAT solving in the cloud

DOI10.1007/978-3-030-80223-3_35MaRDI QIDQ2118345zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

• scientific article; zbMATH DE number 5620835 (Why is no real title available?)
• scientific article; zbMATH DE number 3049708 (Why is no real title available?)
• A high-performance, portable implementation of the MPI message passing interface standard
• Algorithms and Data Structures
• Distributed cube and conquer with Paracooba
• HordeSat: a massively parallel portfolio SAT solver
• Job scheduling strategies for parallel processing. IPPS '96 workshop, Honolulu, HI, USA, April 16, 1996. Proceedings
• Lilotane: a lifted SAT-based approach to hierarchical planning
• Local search algorithms for SAT: an empirical evaluation
• Logical cryptanalysis as a SAT problem: Encoding and analysis of the U. S. Data Encryption Standard
• ManySAT: a parallel SAT solver
• Solving SAT in a distributed cloud: a portfolio approach
• YalSAT

Cited in

(3)

• Unsatisfiability proofs for distributed clause-sharing SAT solvers
• Decentralized Online Scheduling of Malleable NP-hard Jobs
• SAT competition 2020

Describes a project that uses

Uses Software

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118345)