23rd IEEE International SOC Conference 2010
DOI: 10.1109/socc.2010.5784748
|View full text |Cite
|
Sign up to set email alerts
|

A Folding Strategy for SAT solvers based on Shannon's expansion theorem

Abstract: SAT problem has been an active research subject and many impressive SAT solvers have been proposed. Most of algorithms used in modern SAT solvers are based on tree structured searching strategy, combining with heuristic approaches to reduce the search space. In contrast to most existing solvers, we treat SAT problem as a logical optimization issue which can be solved by a logic minimizer. In this paper, we propose a Folding Strategy (FS) based on the Shannon's expansion theorem such that in every step, one var… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 10 publications
(6 reference statements)
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?