Satisfiability Modulo Theories
Barrett Clark, Sebastiani Roberto, Sanjit A. Seshia, Tinelli Cesare · Frontiers in artificial intelligence and applications · 2009
Applications in artificial intelligence, formal verification, and other areas have greatly benefited from the recent advances in SAT. It is often the case, however, that applications in these fields require determining the satisfiability of formulas in more expressive logics such as first-order logic. Also, these applications typically require not general first-order satisfiability, but rather satisfiability with respect to some background theory, which fixes the interpretations of certain predicate and function symbols.