February 28, 2006

ANN: SMT Competition 2006 rules are out!

Posted in SAT at 1:05 am by pmatos

The rules for the 2nd SMT Competition 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.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: