English Satisfiability modulo theories Cited by user Siddharthist on 28 Nov 2023 In computer science and mathematical logic, satisfiability modulo theories (SMT) is the problem of determining whether a mathematical formula is satisfiable.