Satisfiability Modulo Theories (SMT)
E262229
UNEXPLORED
Satisfiability Modulo Theories (SMT) is a framework in computer science and mathematical logic for deciding the satisfiability of logical formulas with respect to background theories such as arithmetic, bit-vectors, arrays, and data types, widely used in verification, synthesis, and automated reasoning.
Jump to:
Referenced by
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.