SMT

E904155

SMT is a field in computer science and mathematical logic that studies the satisfiability of logical formulas with respect to background theories such as arithmetic, arrays, and bit-vectors.

All labels observed (1)

Label Occurrences
SMT canonical 1

How this entity was disambiguated

Statements (48)

Predicate Object
instanceOf field of study ⓘ
subfield of computer science ⓘ
subfield of mathematical logic ⓘ
algorithmicTechnique DPLL(T) ⓘ
Nelson–Oppen combination ⓘ
conflict-driven clause learning in theories ⓘ
theory propagation ⓘ
appliesToTheory algebraic datatypes ⓘ
arithmetic ⓘ
arrays ⓘ
bit-vectors ⓘ
data structures ⓘ
floating-point arithmetic ⓘ
linear arithmetic ⓘ
nonlinear arithmetic ⓘ
strings ⓘ
uninterpreted functions ⓘ
extends SAT ⓘ
focusesOn background theories ⓘ
fullName Satisfiability Modulo Theories ⓘ
goal decide satisfiability of formulas in background theories ⓘ
hasApplication automated reasoning ⓘ
bounded model checking ⓘ
constraint-based program analysis ⓘ
optimization modulo theories ⓘ
path feasibility checking ⓘ
symbolic execution ⓘ
hasCommunity SMT-COMP ⓘ
hasStandard SMT-LIB ⓘ
SMT-LIB 2 ⓘ
linked to: SMT-LIB2
hasTool SMT solver ⓘ
relatedTo SAT ⓘ
constraint satisfaction ⓘ
decision procedures ⓘ
propositional satisfiability ⓘ
theorem proving ⓘ
studies satisfiability of logical formulas ⓘ
typicalInput formulas with quantifiers ⓘ
quantifier-free formulas ⓘ
usedIn constraint solving ⓘ
formal verification ⓘ
hardware verification ⓘ
model checking ⓘ
program analysis ⓘ
software verification ⓘ
synthesis ⓘ
test generation ⓘ
uses first-order logic ⓘ

How these facts were elicited

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.

Satisfiability Modulo Theories → abbreviation → SMT ⓘ