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.
Read more about Satisfiability Modulo Theories: Basic Terminology, Expressive Power of SMT, SMT Solver Approaches, SMT For Undecidable Theories, SMT Solvers, See Also
Famous quotes containing the word theories:
“The real trouble about women is that they must always go on trying to adapt themselves to men’s theories of women, as they always have done. When a woman is thoroughly herself, she is being what her type of man wants her to be. When a woman is hysterical it’s because she doesn’t quite know what to be, which pattern to follow, which man’s picture of woman to live up to.”
—D.H. (David Herbert)