News for hackers. Stuff that matters.
Re:Z3: A high-performance theorem prover from Microsoft Rese... by dons on Monday September 16, 2013 @03:37AM (#6392062)
http://www.csl.sri.com/users/rushby/slides/jaist07.pdf

See "SMT Solvers: Disruptive Innovation in Theorem Proving", Rushby, 2007.

> SAT solving is the quintessential NP-complete problem. But now amazingly fast in practice (most of the time)

> SMT ... generalizes SAT solving by adding the ability to handle arithmetic and other decidable theories

There are no comments on this comment yet.