Satisfiability Modulo Theories: An Appetizer

@inproceedings{Moura2009SatisfiabilityMT,
  title={Satisfiability Modulo Theories: An Appetizer},
  author={Leonardo Mendonça de Moura and Nikolaj Bj\orner},
  booktitle={SBMF},
  year={2009}
}
Satisfiability Modulo Theories (SMT) is about checking the satisfiability of logical formulas over one or more theories. The problem draws on a combination of some of the most fundamental areas in computer science. It combines the problem of Boolean satisfiability with domains, such as, those studied in convex optimization and termmanipulating symbolic systems. It also draws on the most prolific problems in the past century of symbolic logic: the decision problem, completeness and… CONTINUE READING
Highly Influential
This paper has highly influenced 16 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 140 citations. REVIEW CITATIONS
Recent Discussions
This paper has been referenced on Twitter 5 times over the past 90 days. VIEW TWEETS
90 Citations
25 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 90 extracted citations

140 Citations

0102030'10'12'14'16'18
Citations per Year
Semantic Scholar estimates that this publication has 140 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…