Generic ILP versus Specialized 0-1 ILP: An Update (2002)
Cached
Download Links
- [www.eecs.umich.edu]
- [www.aloul.net]
- [www.eecs.umich.edu]
- [www.aloul.net]
- DBLP
Other Repositories/Bibliography
| Venue: | IN INTERNATIONAL CONFERENCE ON COMPUTER-AIDED DESIGN |
| Citations: | 61 - 19 self |
BibTeX
@INPROCEEDINGS{Aloul02genericilp,
author = {Fadi A. Aloul and Arathi Ramani and Igot L. Markov and Karem A. Sakallah},
title = {Generic ILP versus Specialized 0-1 ILP: An Update},
booktitle = {IN INTERNATIONAL CONFERENCE ON COMPUTER-AIDED DESIGN},
year = {2002},
pages = {450--457},
publisher = {}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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
