Satisfiability Modulo Theories (SMT) is a decision problem for logical formulas with respect to combinations of background theories expressed in classical logic. It extends the Boolean satisfiability problem (SAT) by incorporating various theories such as arithmetic, arrays, and bit-vectors, enabling more expressive power in verifying and reasoning about software and hardware systems.