Satisfiability Modulo Theories

See: Constraint Programming, Mathematical Logic, Decision Problem, Theory (Mathematical Logic), First-Order Logic, Real Numbers, Integers, Data Structure, List (Computing), Array Data Structure, Bit Vector.

References

(Wikipedia, 2017) ⇒ https://en.wikipedia.org/wiki/satisfiability_modulo_theories Retrieved:2017-12-30.
- In computer science and mathematical logic, the satisfiability modulo theories (SMT) problem is a decision problem for logical formulas with respect to combinations of background theories expressed in classical first-order logic with equality. Examples of theories typically used in computer science are the theory of real numbers, the theory of integers, and the theories of various data structures such as lists, arrays, bit vectors and so on. SMT can be thought of as a form of the constraint satisfaction problem and thus a certain formalized approach to constraint programming.