# From Propositional Satisfiability to Satisfiability Modulo Theories

@inproceedings{Sheini2006FromPS, title={From Propositional Satisfiability to Satisfiability Modulo Theories}, author={Hossein M. Sheini and Karem A. Sakallah}, booktitle={SAT}, year={2006} }

In this paper we present a review of SAT-based approaches for building scalable and efficient decision procedures for quantifier-free first-order logic formulas in one or more decidable theories, known as Satisfiability Modulo Theories (SMT) problems. As applied to different system verification problems, SMT problems comprise of different theories including fragments of elementary theory of numbers, the theory of arrays, the theory of list structures, etc. In this paper we focus on different…

## 32 Citations

### Lazy Satisability Modulo Theories

- Computer ScienceJ. 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.

### A system for CSP solving through satisfiability Modulo theories

- Computer Science
- 2009

The utility and interest of Simply is twofold: on the one hand, it serves as a benchmark generator for CSP solving with different state-of-the-art SMT solvers and, on the other hand, the system aims at taking advantage of the highly increasing performance of these solvers.

### A System for Solving Constraint Satisfaction Problems with SMT

- Computer ScienceSAT
- 2010

A tool for translating FlatZinc (MiniZinc intermediate code) instances of constraint satisfaction problems to the standard SMT-LIB language is introduced and it is suggested that SMT can be effectively used to solve CSPs.

### Solving constraint satisfaction problems with SAT modulo theories

- Computer ScienceConstraints
- 2012

This paper introduces a tool for translating FLATZINC (MINIZINC intermediate code) instances of CSPs to the standard SMT-LIB language and provides extensive performance comparisons between state-of-the-art SMT solvers and most of the available FLatZINC solvers on standard FLATzINC problems.

### Reformulation of constraint models into SMT

- Computer Science
- 2015

This thesis presents two systems developed to reformulate constraint satisfaction problems (CSP) into SMT (fzn2smt and WSimply) and an incremental optimization algorithm based on using Binary Decision Diagrams (BDD) to solve WCSPs.

### Don’t care in SMT: building flexible yet efficient abstraction/refinement solvers

- Computer ScienceInternational Journal on Software Tools for Technology Transfer
- 2009

This paper describes a method for combining “off-the-shelf” SAT and constraint solvers for building an efficient Satisfiability Modulo Theories (SMT) solver for a wide range of theories and shows that it results in considerably smaller and less complex constraint problems.

### Don’t care in SMT—Building flexible yet efficient abstraction/refinement solvers1

- Computer Science
- 2007

This paper describes a method for combining “off-the-shelf ” SAT and constraint solvers for building an efficient Satisfiability Modulo Theories (SMT) solver for a wide range of theories and shows that for many benchmarks and real-world problems, it results in considerably smaller and less complex constraint problems.

### Don ’ t care in SMT — Building flexible yet efficient abstraction / refinement solvers 1

- Computer Science
- 2007

This paper describes a method for combining “off-the-shelf ” SAT and constraint solvers for building an efficient Satisfiability Modulo Theories (SMT) solver for a wide range of theories and shows that for many benchmarks and real-world problems, it results in considerably smaller and less complex constraint problems.

### Improved Bounded Model Checking for the Universal Fragment of CTL

- Computer ScienceJournal of Computer Science and Technology
- 2009

An improved BMC approach for ACTL based on Penczek's method is presented and is compared with the original one by applying both to two well known examples, mutual exclusion and dining philosophers, showing the advantages of the improved approach with respect to the efficiency of model checking.

### On memoryless provers and insincere verifiers

- Computer ScienceJ. Exp. Theor. Artif. Intell.
- 2009

This article establishes that each instance of a BBCSP admits a coin-flipping Turing machine that halts in time polynomial in the size of the input and establishes the existence of a simple, randomised algorithm for BBCSPs.

## References

SHOWING 1-10 OF 38 REFERENCES

### An Incremental and Layered Procedure for the Satisfiability of Linear Arithmetic Logic

- Computer ScienceTACAS
- 2005

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.

### A DPLL-Based Calculus for Ground Satisfiability Modulo Theories

- Mathematics, Computer ScienceJELIA
- 2002

DPLL(T), a parametric calculus for proving the satisfiability of ground formulas in a logical theory T, can be used as the formal basis for novel and efficient implementations of satisfiability checkers for theories with decidable ground consequences.

### A Scalable Method for Solving Satisfiability of Integer Linear Arithmetic Logic

- Computer ScienceSAT
- 2005

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.

### The Quest for Efficient Boolean Satisfiability Solvers

- Computer ScienceCAV
- 2002

This paper examines some of the main ideas along this passage that have led to the current capabilities of the basic DPLL search framework, and focuses on techniques with consistent demonstrated efficiency in available solvers.

### DPLL(T) with Exhaustive Theory Propagation and Its Application to Difference Logic

- Computer ScienceCAV
- 2005

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.

### DPLL( T): Fast Decision Procedures

- Computer ScienceCAV
- 2004

This work proposes a new approach, namely a general DPLL(X) engine, whose parameter X can be instantiated with a specialized solver Solver T for a given theory T, thus producing a systemDPLL(T).

### A SAT-Based Decision Procedure for Mixed Logical/Integer Linear Problems

- Computer ScienceCPAIOR
- 2005

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.

### GRASP: A Search Algorithm for Propositional Satisfiability

- Computer ScienceIEEE Trans. Computers
- 1999

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.

### Deciding Equality Formulas by Small Domains Instantiations

- Computer ScienceCAV
- 1999

It is shown that significantly smaller domains can be algorithmically found, by analyzing the structure of the formula, and an upper bound for the state-space is shown based on this analysis.

### An Online Proof-Producing Decision Procedure for Mixed-Integer Linear Arithmetic

- Computer ScienceTACAS
- 2003

This work augments CVC with a decision procedure for the theory of mixed integer linear arithmetic based on the Omega-test extended to be online and proof producing and these extensions are the most important and challenging part of the work.