Scalable SAT solving in the cloud

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

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

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

Cited In (3)

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

Uses Software

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

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)