A Progressive Simplifier for Satisfiability Modulo Theories

  title={A Progressive Simplifier for Satisfiability Modulo Theories},
  author={Hossein M. Sheini and Karem A. Sakallah},
In this paper we present a new progressive cooperating simplifier for deciding the satisfiability of a quantifier-free formula in the first-order theory of integers involving combinations of sublogics, referred to as Satisfiability Modulo Theories (SMT). Our approach, given an SMT problem, replaces each non-propositional theory atom with a Boolean indicator variable yielding a purely propositional formula to be decided by a SAT solver. Starting with the most abstract representation (the Boolean… 
Lazy Satisability Modulo Theories
  • R. Sebastiani
  • Computer Science
    J. Satisf. Boolean Model. Comput.
  • 2007
An extensive survey of SMT, with particular focus on the lazy approach, survey, classify and analyze from a theory-independent perspective the most effective techniques and optimizations which are of interest for lazy SMT and which have been proposed in various communities.
Satisfiability Modulo Theories
This chapter provides a brief overview of SMT together with references to the relevant literature for a deeper study and an alternative approach in which a SAT solver is integrated with a separate decision procedure for conjunctions of literals in the background theory.
Ario: A Linear Integer Arithmetic Logic Solver
The unique feature of this solver is its simultaneous adoption of both a congruence-closure equality solver and a transitive-closure UTVPI solver to find a satisfiable set of atoms within a SAT solver.
Handbook of satisfiability
A collection of papers on all theoretical and practical aspects of SAT solving will be extremely useful to both students and researchers and will lead to many further advances in the field.
Application mapping on multiprocessor hardware platforms using genetic algorithms
This thesis addresses the problem of mapping a Homogeneous Synchronous Dataflow graph onto a multiprocessor platform with the objective of maximizing system throughput.
Handbook of Satisfiability
The number of particles in the solution is likely to increase, but the amount of particles bound to cover the solution will not increase as much as previously thought.


Efficient Satisfiability Modulo Theories via Delayed Theory Combination
A new approach to SMT, called Delayed Theory Combination, is proposed, which does not require a decision procedure for T1∪T2, but only individual decision procedures for T 1 and T2, which are directly integrated into the boolean model enumerator.
An Incremental and Layered Procedure for the Satisfiability of Linear Arithmetic Logic
A new decision procedure for the satisfiability of Linear Arithmetic Logic (LAL), i.e. boolean combinations of propositional variables and linear constraints over numerical variables, based on the well known integration of a propositional SAT procedure with theory deciders enhanced in the following ways.
SMT-COMP: Satisfiability Modulo Theories Competition
Of particular recent interest are solvers for Satisfiability Modulo Theories (SMT), which decide logical satisfiability (or dually, validity) with respect to a background theory in classical first-order logic with equality.
A Scalable Method for Solving Satisfiability of Integer Linear Arithmetic Logic
This paper presents a novel method for encoding linear constraints into the SAT solver through binary “indicator” variables and solves the hybrid SAT problem using a SAT search procedure in close collaboration with the UTVPI solver.
DPLL(T) with Exhaustive Theory Propagation and Its Application to Difference Logic
The resulting very simple DPLL(T) system importantly outperforms the existing techniques for this logic and has very good scaling properties: especially on the larger problems it gives improvements of orders of magnitude w.r.t. the existing state-of-the-art tools.
The SMT-LIB Format: An Initial Proposal
This paper is a first proposal for a common format for the Satisfiability Modulo Theories Library, or SMT-LIB, and believes that having a library of benchmarks will greatly facilitate the evaluation and the comparison of these systems, and advance the state of the art in the field.
An Extensible SAT-solver
This article presents a small, complete, and efficient SAT-solver in the style of conflict-driven learning, as exemplified by Chaff, and includes among other things a mechanism for adding arbitrary boolean constraints.
A SAT-Based Decision Procedure for Mixed Logical/Integer Linear Problems
A method for solving Mixed Logical/ Integer Linear Programming (MLILP) problems that integrates a polynomial-time ILP solver for the special class of Unit-Two-Variable-Per-Inequality constraints of the form ax + by ≤ d into generic Boolean SAT solvers.
Efficient conflict-based learning in an RTL circuit constraint solver
A new algorithm is described that extends the conflict-based unique-implication point learning in Boolean SAT (satisfiability) solvers to hybrid Boolean-integer domains in HDPLL in order to improve search in a hybrid Davis-Putnam-Logemann-Loveland based constraint solver for RTL circuits.
Proof-Producing Congruence Closure
An incremental congruence closure algorithm that has an additional $\mathit{Explain}$ operation is introduced, where a k-step proof can be recovered in almost optimal time (quasi-linear in k), without increasing the overall O(n log n) runtime of the fastest known congruent closure algorithms.