Partitioning SAT Instances for Distributed Solving

DOI10.1007/978-3-642-16242-8_27zbMath1306.68146OpenAlexW1594033426MaRDI QIDQ4933318

Antti E. J. Hyvärinen, Tommi Junttila, Ilkka Niemelä

Publication date: 12 October 2010

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-16242-8_27

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Distributed algorithms (68W15)

Related Items

On black-box optimization in divide-and-conquer SAT solving ⋮ On the van der Waerden numbers \(\mathrm{w}(2; 3, t)\) ⋮ An Expressive Model for Instance Decomposition Based Parallel SAT Solvers ⋮ Finding Effective SAT Partitionings Via Black-Box Optimization

Uses Software

• ManySAT
• March_eq
• MiniSat
• PSATO
• SATO
• Plingeling
• PrecoSAT