Satisfiability Modulo Theories (SMT)

SMT is the problem of determining if a mathematical formula is satisfiable. It is a generalization of the Boolean satisfiability problem (SAT).

ROAM_REFS: https://en.wikipedia.org/wiki/Satisfiability_modulo_theories