Generic ILP versus specialized 0-1 ILP: an update

@inproceedings{Aloul2002GenericIV,
  title={Generic ILP versus specialized 0-1 ILP: an update},
  author={F. Aloul and A. Ramani and I. Markov and K. Sakallah},
  booktitle={ICCAD 2002},
  year={2002}
}
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… Expand

Figures and Tables from this paper

Pseudo-Boolean Heuristics for 0-1 Integer Linear Programming
Many Integer Linear Programming (ILP) problems contain significant subproblems exclusively composed of 0-1 (binary) variables. Much effort has gone in to special solvers for 0-1 ILP, as well asExpand
Dynamic symmetry-breaking for Boolean satisfiability
TLDR
This work proposes several new techniques that treat objective functions differently from CNF/PB constraints and accelerate Boolean optimization in many practical cases, and introduces a new objective function, Localized Bit Selection (LBS), that can be used to specify a preference for bit values in formal verification applications. Expand
A fast pseudo-Boolean constraint solver
  • D. Chai, A. Kuehlmann
  • Computer Science, Mathematics
  • IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
  • 2005
TLDR
This paper reviews how recent advances in satisfiability search can be extended for pseudo-Boolean constraints and describes a new LPB solver that is based on generalized constraint propagation and conflict-based learning and presents a comparison with other, state-of-the-art LPBsolvers. Expand
A fast pseudo-Boolean constraint solver
  • D. Chai, A. Kuehlmann
  • Mathematics, Computer Science
  • IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.
  • 2005
TLDR
This paper reviews how recent advances in satisfiability search can be extended for pseudo-Boolean constraints and describes a new LPB solver that is based on generalized constraint propagation and conflict-based learning and presents a comparison with other, state-of-the-art LPBsolvers. Expand
Solving Multi-objective Pseudo-Boolean Problems
TLDR
Three different algorithms for solving multi-objective Pseudo-Boolean problems with multiple objective functions which have to be optimized simultaneously, resulting in general in a set of optimal solutions are proposed. Expand
Generalized Totalizer Encoding for Pseudo-Boolean Constraints
TLDR
GTE is proposed, which is an arc-consistency preserving extension of the Totalizer encoding to pseudo-Boolean constraints, which shows the superiority of GTE with respect to other encodings when large pseudo- Boolean constraints have low number of distinct coefficients. Expand
Counting Models in Integer Domains
This paper addresses the problem of counting models in integer linear programming (ILP) using Boolean Satisfiability (SAT) techniques, and proposes two approaches to solve this problem. The firstExpand
Study of efficient techniques for implementing a Pseudo-Boolean solver based on cutting planes
Most modern SAT solvers are based on resolution and CNF representation. The performance of these has improved a great deal in the past decades. But still they have some drawbacks such as the slowExpand
Solving Pseudo-Boolean Problems with SCIP
Pseudo-Boolean problems generalize SAT problems by allowing linear constraints and a linear objective function. Different solvers, mainly having their roots in the SAT domain, have been proposed andExpand
Breaking instance-independent symmetries in exact graph coloring
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Naturally-occurring instances of suchExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 36 REFERENCES
Solving difficult SAT instances in the presence of symmetry
TLDR
An improved construction of symmetry-breaking clauses is proposed and applied to achieve significant speed-ups over current state-of-the-art in Boolean satisfiability and it is shown that in structured SAT instances difficulty may be associated with large numbers of symmetries. Expand
Using CSP Look-Back Techniques to Solve Real-World SAT Instances
TLDR
The results show that incorporating CSP look-back techniques renders easy many problems which otherwise are beyond DP's reach, and recommend that such techniques be included as options in implementations of DP, just as they are in systematic algorithms for the more general constraint satisfaction problem. Expand
A comparative study of two Boolean formulations of FPGA detailed routing constraints
TLDR
It is demonstrated that the route-based formulation of Boolean SAT-based routing yields an easier-to-evaluate and more scalable routability Boolean function than the track-based method, providing empirical evidence that a smart/efficient Boolean formulation can achieve significant performance improvement in real-world applications. Expand
Solving Linear Pseudo-Boolean Constraint Problems with Local Search
TLDR
It is shown that domain-independent local search for satisfiability (Walksat) can be generalized to handle systems of linear pseudo-Boolean (0-1 integer) constraints, a representation that is widely used in operations research. Expand
On using satisfiability-based pruning techniques in covering algorithms
TLDR
Experimental results indicate that the proposed search pruning techniques provide significant performance gains for different classes of instances, particularly the ability to backtrack non-chronologically to exploit the actual formulation of covering problems. Expand
Faster SAT and smaller BDDs via common function structure
  • F. Aloul, I. Markov, K. Sakallah
  • Computer Science
  • IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281)
  • 2001
TLDR
This work points out that SAT and BDD techniques can be improved via the use of the same structural properties of instances, and proposes methods based on efficient problem partitioning that often outperforms existing techniques by a factor of two or more. Expand
Combinational test generation using satisfiability
TLDR
The algorithm, Test Generation Using Satisfiability (TEGUS), solves a simplified test set characteristic equation using straightforward but powerful greedy heuristics, ordering the variables using depth-first search and selecting a variable from the next unsatisfied clause at each branching point. Expand
Efficient conflict driven learning in a Boolean satisfiability solver
TLDR
This paper generalizes various conflict driven learning strategies in terms of different partitioning schemes of the implication graph to re-examine the learning techniques used in various SAT solvers and propose an array of new learning schemes. Expand
A Davis-Putnam based enumeration algorithm for linear pseudo-Boolean optimization
The Davis-Putnam enumeration method (DP) has recently become one of the fastest known methods for solving the clausal satis ability problem of propositional calculus. We present a generalization ofExpand
SATO: An Efficient Propositional Prover
TLDR
Two techniques that are found eeective to improve SATO performance are discussed, one is about splitting rules; the other is about connict analysis. Expand
...
1
2
3
4
...