Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
MINCE: A Static Global Variable-Ordering Heuristic for SAT Search and BDD Manipulation
 

Summary: MINCE: A Static Global Variable-Ordering Heuristic for
SAT Search and BDD Manipulation
Fadi A. Aloul
(American University of Sharjah, U.A.E.
faloul@ausharjah.edu)
Igor L. Markov
(University of Michigan, U.S.A.
imarkov@umich.edu)
Karem A. Sakallah
(University of Michigan, U.S.A.
karem@umich.edu)
Abstract: The increasing popularity of SAT and BDD techniques in formal hardware verifica-
tion and automated synthesis of logic circuits encourages the search for additional speedups.
Since typical SAT and BDD algorithms are exponential 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 effi-
cient problem partitioning and can be easily applied as pre-processing with arbitrary SAT solv-
ers and BDD packages without modifying the source code of SAT/BDD tools.
Finding a better variable ordering is a well recognized problem for both SAT solvers and

  

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

 

Collections: Engineering