Title: A survey of the satisfiability-problems solving algorithms

Authors: Yousef Kilani; Mohammad Bsoul; Ayoub Alsarhan; Ahmad Al-Khasawneh

Addresses: Faculty of Prince Al-Hussein Bin Abdullah II for Information Technology, Hashemite University, Alzarqa, Jordan ' Faculty of Prince Al-Hussein Bin Abdullah II for Information Technology, Hashemite University, Alzarqa, Jordan ' Faculty of Prince Al-Hussein Bin Abdullah II for Information Technology, Hashemite University, Alzarqa, Jordan ' Faculty of Prince Al-Hussein Bin Abdullah II for Information Technology, Hashemite University, Alzarqa, Jordan

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.

Keywords: satisfiability problems; SAT solving methods; stochastic local search; propositional satisfiability; problem solving.

DOI: 10.1504/IJAIP.2013.056447

International Journal of Advanced Intelligence Paradigms, 2013 Vol.5 No.3, pp.233 - 256

Received: 30 Jan 2013
Accepted: 24 Jun 2013
Published online: 30 Jul 2014 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article