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.

  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: The predominance of multicore processors has increased the inter-est in developing parallel Boolean Satisfiability (SAT) solvers. As a result, more parallel SAT solvers are emerging. Even though parallel approaches are known to boost performance, parallel approaches developed for Boolean optimization are scarce. This paper proposes parallel search algorithms for Boolean optimiza-tion and introduces a new parallel solver for Boolean optimization problem in-stances. Using two threads, an unsatisfiability-based algorithm is used to search on the lower bound value of the objective function, while at the same time a linear search is performed on the upper bound value of the objective function. Searching in both directions and exchanging learned clauses between these two orthogonal approaches makes the search more efficient. This idea is further extended for a larger number of threads by dividing the search space considering different local upper values of the objective function. The parallel search on different local up-per values leads to constant updates on the lower and upper bound values, which result in reducing the search space. Moreover, different search strategies are per-formed on the upper bound value, increasing the diversification of the search.
  • Source
    International Conference on Modeling, Simulation, and Applied Optimization; 01/2005
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In mobile radio communication systems using spread spectrum technology, an accurate estimate of the signal propagation delay is needed in order to recover the transmitted data. This process is usually done using a pseudo noise (PN) code acquisition algorithm to search for the correct propagation delay within a window of possible delays. In this paper, we propose a new approach to solving the PN code acquisition problem using advanced Boolean Satisfiability (SAT) techniques. SAT solvers use intelligent search algorithms that can traverse the search space and efficiently prune parts that contain no solutions. These solvers have recently been used to solve many challenging problems in Engineering and Computer Science. In this paper, we show how to formulate the PN code acquisition problem as a SAT instance and evaluate the use of advanced SAT techniques in solving the problem. Our approach is verified by simulation and presented results indicate that the proposed system achieves a detection probability for the correct delay of almost 100% for all practical cases.
    Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference; 04/2009

Full-text (2 Sources)

Available from
May 19, 2014