A survey of the satisfiability-problems solving algorithms
by Yousef Kilani; Mohammad Bsoul; Ayoub Alsarhan; Ahmad Al-Khasawneh
International Journal of Advanced Intelligence Paradigms (IJAIP), Vol. 5, No. 3, 2013

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.

Online publication date: Wed, 30-Jul-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Advanced Intelligence Paradigms (IJAIP):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com