Abstract
The propositional satisfiability problem (SAT) is one of the fundamental problems in theoretical computer science, but it also has many practical applications. Parallel algorithms for the SAT problem have been proposed and implemented since the 1990s. This chapter provides an overview of current approaches and their evolution over recent decades towards efficiently solving hard combinatorial problems on multi-core computers and clusters.
Cite
CITATION STYLE
APA
Balyo, T., & Sinz, C. (2018). Parallel satisfiability. In Handbook of Parallel Constraint Reasoning (pp. 3–29). Springer International Publishing. https://doi.org/10.1007/978-3-319-63516-3_1
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free