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 satisfiability that com-bines backtrack search techniques and zero-suppressed
 

Summary: 1
IWLS '2001
Abstract
We introduce a new approach to satisfiability that com-
bines backtrack search techniques and zero-suppressed
binary decision diagrams (ZBDDs). This approach implicitly
represents satisfiability problems using ZBDDs, and per-
forms search using operations on this representation. This
methodology which adapts backtrack search algorithms to
such implicit representations should allow for a potential
exponential increase in the size of problems that can be han-
dled. We describe how to perform backtrack search and con-
flict diagnosis with ZBDDs used as an underlying structure
for clause representation. We also report on our initial
experiments with this approach.
1 Introduction
Boolean Satisfiability (SAT) serves as an underlying
model for a wide range of applications in Computer Science,
Artificial Intelligence and Electrical Engineering, to name a
few. Over the years, this problem has been extensively inves-

  

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

 

Collections: Engineering