This chapter discusses advances in SAT algorithm design, including the use of SAT algorithms as theory drivers, classic implementations of SAT solvers, and some theoretical aspects of SAT. Some applications to which SAT solvers have been successfully applied are also presented. The intention is to assist someone interested in applying SAT technology in solving some stubborn class of combinatorial problems.
CITATION STYLE
Franco, J., & Weaver, S. (2013). Algorithms for the satisfiability problem. In Handbook of Combinatorial Optimization (Vol. 1–5, pp. 311–454). Springer New York. https://doi.org/10.1007/978-1-4419-7997-1_31
Mendeley helps you to discover research relevant for your work.