Seven Challenges in Parallel SAT Solving

Authors

  • Youssef Hamadi Microsoft Research, Cambridge
  • Christoph Wintersteiger Microsoft Research, Cambridge

DOI:

https://doi.org/10.1609/aaai.v26i1.8438

Keywords:

SAT, Algorithms, Parallelism

Abstract

This paper provides a broad overview of the situation in the area of Parallel Search with a specific focus on Parallel SAT Solving. A set of challenges to researchers is presented which, we believe, must be met to ensure the practical applicability of Parallel SAT Solvers in the future. All these challenges are described informally, but put into perspective with related research results, and a (subjective) grading of difficulty for each of them is provided.

Downloads

Published

2021-09-20

How to Cite

Hamadi, Y., & Wintersteiger, C. (2021). Seven Challenges in Parallel SAT Solving. Proceedings of the AAAI Conference on Artificial Intelligence, 26(1), 2120-2125. https://doi.org/10.1609/aaai.v26i1.8438