By Topic

Hybrid SAT Solver Considering Circuit Observability

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

3 Author(s)
Xiuqin Wang ; Comput. Sci. & Technol. Inst., Harbin Eng. Univ., Harbin ; Hao Wang ; Guangsheng Ma

Boolean satisfiability is a NP-hard problem in computer theoretic science. There are two types of SAT solvers, random local solver and DPLL-based complete solver. Some people have proposed hybrid SAT solvers that combined the advantage of them both. They have successfully applied them to solve large or hard random SAT problems and circuit related problems. However, these solvers often find over-satisfying assignments when solving some circuit related problems. In this paper, circuit observability is considered in hybrid SAT solver, which helps reduce the overhead caused by over-satisfying and prune the searching space. The experimental results show that our hybrid SAT solver is more efficient than other solvers for large and hard circuits.

Published in:

Young Computer Scientists, 2008. ICYCS 2008. The 9th International Conference for

Date of Conference:

18-21 Nov. 2008