CACM logo

Contributed articles

Satisfiability Modulo Theories: Introduction and Applications

[article image]
Credit: HubPages

Checking the satisfiability of logical formulas, SMT solvers scale orders of magnitude beyond custom ad hoc solvers.

The full text of this article is premium content!

sign in

get access

Create a Web Account

If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.

Join the ACM

Become a member to view this article and take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.

Subscribe to Communications of the ACM

Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.

Tools For Readers

Bookmark and Share
Default Font Size Large Font Size X-Large Font Size Text Size

Related ACM Resources

Conferences:

Courses:

  • Word 2003: Working with Tables and Data - In this course, you will increase the complexity of your Microsoft Word 2003 documents by adding components such as customized lists, tables, and charts. You …

In The Digital Library


About Communications | Join ACM External Link | Renew External Link | Subscribe External Link | Sign In | For Authors | For Advertisers External Link | Privacy | Site Map | Help | Contact Us | Mobile Site

Copyright © 2012 by the ACM. All rights reserved.