Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
We introduce a new approach to Boolean satisfiability that combines backtrack search techniques and zero-sup-
 

Summary: 1
Abstract
We introduce a new approach to Boolean satisfiability
that combines backtrack search techniques and zero-sup-
pressed binary decision diagrams (ZBDDs). This approach
implicitly represents satisfiability instances using ZBDDs,
and performs search using an efficient implementation of
unit propagation on the ZBDD structure. We describe how to
perform backtrack search using ZBDDs as the underlying
structure for clause representation. This methodology, which
adapts backtrack search algorithms to such implicit repre-
sentations, allows for a potential exponential increase in the
size of the problems that can be handled. Our experimental
results show consistent speedups over conventional
approaches.
1 Introduction
In the past few years, interest in the direct application of
Boolean Satisfiability (SAT) to various Electronic Design
Automation (EDA) computational tasks [9, 14, 15, 17] has
been on the rise. Several powerful SAT solvers [11, 13, 20]

  

Source: Aloul, Fadi - Department of Computer Engineering, American University of Sharjah

 

Collections: Engineering