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 for SAT and BDD
 

Summary: 1
IWLS '2001
MINCE: A Static Global Variable-Ordering
for SAT and BDD
Fadi A. Aloul, Igor L. Markov, Karem A. Sakallah
{faloul, imarkov, karem}@umich.edu
Electrical Engineering and Computer Science
University of Michigan
Abstract
Many popular algorithms that work with Boolean functions are
dramatically dependent on the order of variables in input represen-
tations of Boolean functions. Such algorithms include satisfiability
(SAT) solvers that are critical in formal verification and Binary
Decision Diagrams (BDDs) manipulation algorithms that are
increasingly popular in synthesis and verification. Finding better
variable-orderings is a well-recognized problem in each of those
contexts. Currently, all leading-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 DLIS ordering for SAT solvers and

  

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

 

Collections: Engineering