Loading...
Please wait, while we are loading the content...
Similar Documents
Generic ILP versus Specialized 0-1 ILP: An Update (2002)
| Content Provider | CiteSeerX |
|---|---|
| Author | Aloul, Fadi A. Ramani, Arathi Markov, Igot L. Sakallah, Karem A. |
| Description | 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 In International Conference on Computer-Aided Design |
| File Format | |
| Language | English |
| Publisher Date | 2002-01-01 |
| Access Restriction | Open |
| Subject Keyword | Generic Ilp Solver Integer Linear Programming Boolean Satisfiability Specialized 0-1 Ilp Solver Boolean Nature Pure Cnf Many Application So-called Pseudo-boolean Constraint Software Verification Specialized 0-1 Ilp Sat Solver Conjunctive Normal Form 0-1 Variable Fpga Routing Complex Sat Instance Generic Ilp |
| Content Type | Text |
| Resource Type | Article |
