Conference Paper

Generic ILP versus specialized 0-1 ILP: an update

Dept. of Electr. Eng. & Comput. Sci., Michigan Univ., Ann Arbor, MI, USA
DOI: 10.1109/ICCAD.2002.1167571 Conference: IEEE International Conference on Computer Aided Design (ICCAD), At San Jose, California
Source: IEEE Xplore

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 ILP techniques. To make a fair comparison, we generalize recent ideas for fast SAT-solving to more general 0-1 ILP problems that may include counting constraints and optimization. Another aspect of our comparison is evaluation on 0-1 ILP benchmarks that originate in Electronic Design Automation (EDA), but that cannot be directly solved by a SAT solver. Specifically, we solve instances of the Max-SAT and Max-ONEs optimization problems which seek to maximize the number of satisfied clauses and the "true" values over all satisfying assignments, respectively. Those problems have straightforward applications to SAT-based routing and are additionally important due to reductions from Max-Cut, Max-Clique, and Min Vertex Cover. Our experimental results show that specialized 0-1 techniques tend to outperform generic ILP techniques on Boolean optimization problems as well as on general EDA SAT problems.

Download full-text

Full-text

Available from: Igor L. Markov
  • Source
    • "The created ILP uses only binary decision. These ILPs are also called, 0-1-ILP or a Pseudo-Boolean problem [17]. "
    [Show abstract] [Hide abstract]
    ABSTRACT: Cyber-physical systems (CPSs) provide sophisticated functionality and are controlled by networked electronic control units (ECUs). Nowadays, software engineers use component-based development approaches to develop their software. Moreover, software components have to be allocated to an ECU to be executed. Engineers have to cope with topology-, software-, and timing-dependencies and memory-, scheduling-, and routing-constraints. Currently, engineers use linear programs to specify allocation constraints and to derive a feasible allocation automatically. However, encoding the allocation problem as a linear program is a complex and error-prone task. This paper contributes a model-driven, OCL-based allocation engineering approach for reducing the engineering effort and to avoid failures. We validate our approach with an automotive case study modeled with MechatronicUML. Our validation shows that we can specify allocation constraints with less engineering effort and are able to derive feasible allocations automatically. ... For more information about the tooling and a prototype visit our wiki: https://trac.cs.upb.de/mechatronicuml/wiki/PaperASE2015
    Full-text · Conference Paper · Nov 2015
  • Source
    • "Another key advantage of PB constraints is the ability to express optimization problems which were traditionally handled as ILP problems. Studies have shown that 0–1 SAT-based ILP solvers can compete with the best available generic-based ILP solvers in solving 0–1 ILP problems arising in specific applications [3], [4]. The recent advances in SAT solvers as well as the availability of increasingly affordable high computational power, have allowed larger problem instances to be solved in different applications domains. "
    [Show abstract] [Hide abstract]
    ABSTRACT: Over the course of the last decade, there have been several improvements in the performance of Integer Linear Programming (ILP) and Boolean Satisfiability (SAT) solvers. These improvements have encouraged the application of SAT and ILP techniques in modeling complex engineering prob-lems. One such problem is the Clustering Problem in Mobile Ad-Hoc Networks (MANETs). The Clustering Problem in MANETs consists of selecting the most suitable nodes of a given MANET topology as clusterheads, and ensuring that regular nodes are connected to clusterheads such that the lifetime of the network is maximized. This paper proposes the development of an improved ILP formulation of the Clustering Problem. Addition-ally, various enhancements are implemented in the form of exten-sions to the improved formulation, including the establishment of intra-cluster communication, multihop connections and the enforcement of coverage constraints. The improved formulation and enhancements are implemented in a tool designed to visually create network topologies and cluster them using state-of-the art Generic ILP and SAT solvers. Through this tool, feasibility of using the proposed formulation and enhancements in a real-life practical environment is assessed. It is observed that the Generic ILP solvers, CPLEX, and SCIP, are able to handle large network topologies, while the 0–1 SAT-based ILP solver, BSOLO, is effective at handling the smaller scale networks. It is also observed that while these enhanced formulations enable the generation of complex network solutions, and are suitable for small scale networks, the time taken to generate the corresponding solution does not meet the strict requirements of a practical environment. Index Terms— Boolean satisfiability (SAT), integer linear pro-gramming, mobile ad-hoc networks (MANETs), optimization.
    Full-text · Article · Jun 2013 · IEEE Sensors Journal
  • Source
    • "Another key advantage of PB constraints is the ability to express optimization problems which were traditionally handled as ILP problems. Studies have shown that 0-1 SAT-based ILP solvers can compete with the best available generic-based ILP solvers in solving 0-1 ILP problems arising in specific applications [3] [4]. The recent advances in SAT solvers as well as the availability of increasingly affordable high computational power, have allowed larger problem instances to be solved in different applications domains. "
    [Show abstract] [Hide abstract]
    ABSTRACT: Recently there have been several improvements in the performance of Integer Linear Programming (ILP) and Boolean Satisfiability (SAT) solvers. These improvements have encouraged the modeling of complex engineering problems as ILP problems. One such problem is the Clustering Problem in Mobile Ad-Hoc Networks (MANETs). The Clustering Problem in MANETs consists of selecting the most suitable nodes of a given MANET topology as clusterheads (CH), and ensuring that regular nodes are connected to clusterheads such that the lifetime of the network is maximized. This paper focuses on developing an improved ILP formulation for the Clustering Problem, and assessing the feasibility of using such a formulation, together with state-of-the art Generic ILP and SAT solvers, in a real-life practical environment.
    Full-text · Conference Paper · Jan 2012
Show more