Corpus ID: 7455246

On Solving Optimization Problems Using Boolean Satisfiability

  title={On Solving Optimization Problems Using Boolean Satisfiability},
  author={Fadi A. Aloul},
The last few years have seen significant advances in Boolean satisfiability (SAT) solving. This has lead to the successful deployment of SAT solvers in a wide range of problems in Engineering and Computer Science. In general, most SAT solvers are applied to Boolean decision problems that are expressed in conjunctive normal form (CNF). While this input format is applicable to some engineering tasks, it poses a significant obstacle to others. One of the main advances in SAT is generalizing SAT… Expand
On the Complexity of the Circuit Obfuscation Problem for Split Manufacturing
Recent work in the area of computer hardware security introduced a number of interesting computational problems in the context of directed acyclic graphs (DAGs). In this thesis, we pick one of theseExpand
SAT based rectilinear steiner tree construction
A novel approach to the minimization of the wire-length of RST specifically used in global routing stage of VLSI design is presented, and a Pseudo Boolean satisfiability (PB-SAT) based model is incorporated here for generating RST satisfying all the given constraints. Expand
Conjunctive Query Programming: A Paradigm for Knowledge Engineering of Optimization Problems in the Semantic Web
  • Thomas Fischer
  • Computer Science
  • 2014 IEEE/WIC/ACM International Joint Conferences on Web Intelligence (WI) and Intelligent Agent Technologies (IAT)
  • 2014
A language paradigm that combines algebraic and logical modelling of constraints and objective functions is outlined, which provides a method for instantiation of optimization and planning problems with Semantic Web background knowledge, by modelling objective functions and restrictions asgebraic and logic expressions of results of conjunctive queries. Expand


Solving Linear Pseudo-Boolean Constraint Problems with Local Search
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
Using CSP Look-Back Techniques to Solve Real-World SAT Instances
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
SAT-Based Verification without State Space Traversal
This paper converts van Eijk's algorithm to use a SAT-solver instead of BDDs, and makes a number of improvements to the original algorithm, such as combining it with recently developed variants of induction. Expand
Efficient conflict driven learning in a Boolean satisfiability solver
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
SATO: An Efficient Propositional Prover
Two techniques that are found eeective to improve SATO performance are discussed, one is about splitting rules; the other is about connict analysis. Expand
GRASP: A Search Algorithm for Propositional Satisfiability
Experimental results obtained from a large number of benchmarks indicate that application of the proposed conflict analysis techniques to SAT algorithms can be extremely effective for aLarge number of representative classes of SAT instances. 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
SATIRE: A new incremental satisfiability engine
SATIRE is introduced, a new satisfiability solver that is particularly suited to verification and optimization problems in electronic design automation, and includes two new features to achieve even higher performance: a facility for incrementally solving sets of related problems, and the ability to handle non-CNF constraints. Expand
Symmetry-Breaking Predicates for Search Problems
This work presents a general scheme whereby symmetries are exploited by adding \symmetry-breaking" predicates to the theory, and discusses methods for generating partial symmetry-breaking predicates, and shows that in several speciic cases asymmetries can be broken either fully or partially using a polynomial number of predicates. Expand
Symbolic model checking using SAT procedures instead of BDDs
This paper applies bounded model checking to equivalence and invariant checking and presents several optimizations that reduce the size of generated propositional formulas in hardware verification. Expand