Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network

  Advanced Search  

The increasing popularity of SAT and BDD techniques in ver-ification and synthesis encourages the search for additional

Summary: Abstract
The increasing popularity of SAT and BDD techniques in ver-
ification and synthesis encourages the search for additional
speed-ups. Since typical SAT and BDD algorithms are exponen-
tial in the worst-case, the structure of real-world instances is a
natural source of improvements. While SAT and BDD techniques
are often presented as mutually exclusive alternatives, our work
points out that both can be improved via the use of the same
structural properties of instances. Our proposed methods are
based on efficient problem partitioning and can be easily applied
as pre-processing with arbitrary SAT solvers and BDD packages
without source code modifications.
Finding a better variable-ordering is a well recognized prob-
lem for both SAT solvers and BDD packages. Currently, all lead-
ing edge variable-ordering algorithms are dynamic, in the sense
that they are invoked many times in the course of the "host"
algorithm that solves SAT or manipulates BDDs. Examples
include the DLCS ordering for SAT solvers and variable-sifting
during BDD manipulations. In this work we propose a universal
variable-ordering MINCE (MIN Cut Etc.) that pre-processes a


Source: Aloul, Fadi - Department of Computer Engineering, American University of Sharjah
Markov, Igor - Department of Electrical Engineering and Computer Science, University of Michigan


Collections: Computer Technologies and Information Sciences; Engineering