By Topic

Local search for satisfiability (SAT) problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Jun Gu ; Dept. of Electr. Eng., Calgary Univ., Alta., Canada

The satisfiability problem (SAT) is a fundamental problem in mathematical logic, constraint satisfaction, VLSI engineering, and computing theory. Methods to solve the satisfiability problem play an important role in the development of computing theory and systems. Traditional methods treat the SAT problem as a constrained decision problem. During past research, the number of unsatisfiable clauses as the value of an objective function was formulated. This transforms the SAT problem into a search problem-an unconstrained optimization problem to the objective function. A variety of iterative optimization techniques can be used to solve this optimization problem. In this paper, the author shows how to use the local search techniques to solve the satisfiability problem. The average time complexity analysis and numerous real algorithm executions were performed. They indicate that the local search algorithms are much more efficient than the existing SAT algorithms for certain classes of conjunctive normal form (CNF) formulas

Published in:

Systems, Man and Cybernetics, IEEE Transactions on  (Volume:23 ,  Issue: 4 )