ScalaSMT: satisfiability modulo theory in Scala (tool paper)
Franck Cassez, Anthony M. Sloane · 2017
Satisfiability modulo theory (SMT) consists of determining the satisfiability of logical formulas. It can reason in various formal theories, e.g., in linear integer or real arithmetic, first-order logic, or logics of arrays. An SMT solver is a program that implements the corresponding algorithms to automatically determine whether a logical formula is satisfiable.