SMTdominated
SMTdominated is a term used in discussions of formal methods and automated reasoning to describe a problem, workload, or solution approach in which Satisfiability Modulo Theories (SMT) solvers provide the primary means of deciding satisfiability of a set of constraints. In an SMTdominated setting, the proportion of solving time, or the success rate, attributable to SMT-based techniques exceeds that of alternative constraint-solving approaches such as pure SAT solving or constraint programming.
Contexts and characteristics: Problems with rich background theories such as linear arithmetic, arrays, bit-vectors, uninterpreted functions,
Practice and implications: SMTdominated workflows involve encoding constraints into SMT-LIB, using incremental solving, and leveraging features
Limitations and alternatives: When constraints lie outside supported theories, or when nonlinear arithmetic or heavy quantifier
See also: Satisfiability Modulo Theories; SAT solver; Constraint programming; Formal verification; Model checking.