February 28, 2006
ANN: SMT Competition 2006 rules are out!
What is SMT?
SMT is an acronym for SAT Modulo Theories, where SAT is the well-known SATisfiability (NP-Complete) problem from Computation. SMT uses SAT to solve formulas which might span multiple theories. Current logics range from Linear Integer Arithmetic (LIA), Linear Real Arithmetic (LRA), Integer Difference Logic (IDL), Real Difference Logic (RDL) to Uninterpreted Functions (UF). More information can be found at the SMT-LIB site.