Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Generic ILP versus Specialized 0-1 ILP: An Update Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Karem A. Sakallah
 

Summary: CSE-TR-
Generic ILP versus Specialized 0-1 ILP: An Update
Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Karem A. Sakallah
461-02
August 19, 2002
Generic ILP versus Specialized 0-1 ILP: An Update
Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Karem A. Sakallah
Advanced Computer Architecture Laboratory
Department of Electrical Engineering and Computer Science
University of Michigan
Ann Arbor, Michigan 48109-2122
August 19, 2002
Abstract
Optimized solvers for the Boolean Satisfiability (SAT) problem have many applications in areas such as hardware
and software verification, FPGA routing, planning, etc. Further uses are complicated by the need to express
"counting constraints" in conjunctive normal form (CNF). Expressing such constraints by pure CNF leads to more
complex SAT instances. Alternatively, those constraints can be handled by Integer Linear Programming (ILP), but
generic ILP solvers may ignore the Boolean nature of 0-1 variables. Therefore specialized 0-1 ILP solvers extend
SAT solvers to handle these so-called "pseudo-Boolean" constraints.
This work provides an update on the on-going competition between generic ILP techniques and specialized 0-1

  

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

 

Collections: Engineering