Hardware accelerated SAT solvers—A survey

Abstract Boolean Satisfiability (SAT) is a problem that holds great importance both theoretically and in practical applications. Although the general SAT problem is NP-complete, advancements in solver algorithms and heuristics have meant that many industrial problems can be quickly and efficiently solved. Much of this progress has been made in the field of sequential SAT solvers; however, there have been significant recent contributions to the field of hardware SAT accelerators. This paper offers a short overview of the current state of SAT solvers in general and surveys recent contributions to hardware accelerated SAT solvers. This paper also aims to analyze the trends, challenges, and open questions facing reconfigurable SAT solvers in an extremely competitive application area.