By Topic

A Novel Method for All Solutions 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

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

All-solution Boolean satisfiability (SAT) solver has been widely used throughout the EDA industry fields, such as formal verification, circuit synthesis and automatic test pattern generation. Exploiting structure information especially observability donpsilat cares(ODCs) of circuits can improve the efficiency of SAT solvers. The authors converted the ODC property of signal to clauses of CNF formula by adding donpsilat care literals conditions to clauses in the CNF formula. This can reduce the problem scale during the process of variable assigned greatly. In this paper, this new method is used to the all solutions SAT problem and a new all solutions SAT solver is proposed. By experiment, it is proved to be very efficient for finding all solutions of SAT problems in EDA fields.

Published in:

Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, 2008. SNPD '08. Ninth ACIS International Conference on

Date of Conference:

6-8 Aug. 2008