Satisfiability Modulo Theories (SMT)

Problème SMT ( Satisfiability Modulo Theories ) is a Problème of the decision for the logical formulas in the respect of a theory expressed in first order logic containing the equality. Examples of theories are the theory of the real numbers, the theory of linear entireties, and the theories of a variety of structures of data like the lists, the tables, the vectors of bits, etc

Terminology

Formally, an authority SMT is a free first order formula of quantifier. Problem SMT is of problem to determine if such a formula is satisfiable. In other words, let us imagine an authority of SAT in which the Boolean variables are replaced by predicates. These predicates being classified according to the theory to which they belong.

Solveurs SMT

Solveurs SMT allow to solve problems SMT. The architecture of solveurs SMT is divided as follows: solvor SAT based on algorithm DPLL (solvor SAT) solves the Boolean part of the problem and interacts with the solvor T to propagate his solutions. The solvor T checks the satisfiability of the conjunctions of predicates of theory T. For reasons of effectiveness, it is generally wished that the solvor of theory take part in the propagation and the analysis of conflicts.

Barcelogic
CVC3
Yices
Ergo

External bonds

SMT-LIB: Librarie SMT
SMT-COMP: Competition of solveurs SMT

Random links: