A survey of the satisfiability-problems solving algorithms

Abstract

The propositional satisfiability (SAT) problem is one of the most fundamental problems in computer science. SAT solvers have been successfully applied to a wide range of practical applications, including hardware model checking, software model finding, equivalence checking, and planning, among many others. Empirical research has been very fruitful for the development of efficient methods for SAT problems, such as classical Davis-Putnam method, greedy SAT (GSAT) method and neural network SAT method. This paper gives a survey about the methods used for solving the SAT problems with an emphasis on surveying the local search algorithms.