English Satisfiability modulo theories Cited by user RDBrown on 11 Oct 2022 In computer science and mathematical logic, satisfiability modulo theories (SMT) is the problem of determining whether a mathematical formula is satisfiable.