Satisfiability modulo theories

Known as: CVC3, Satisfiability Modulo Theories problem, CVC4 
In computer science and mathematical logic, the satisfiability modulo theories (SMT) problem is a decision problem for logical formulas with respect… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Process systems engineers have long recognized the importance of both logic and optimization for automated decision-making. But… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2014
2014
Motion planning is an important problem with many applications in robotics. In this paper, we focus on motion planning with… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table I
Is this relevant?
2014
2014
Satisfiability Modulo Theories (SMT) solvers check the satisfiability of firstorder formulas written in a language containing… (More)
  • figure 4
Is this relevant?
Highly Cited
2012
Highly Cited
2012
A key driver of SMT over the past decade has been an interchange format, SMT-LIB, and a growing set of benchmarks sharing this… (More)
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Checking the satisfiability of logical formulas, SMT solvers scale orders of magnitude beyond custom ad hoc solvers. 
  • figure 1
Is this relevant?
2009
2009
A common proof format for solvers for Satisfiability Modulo Theories (SMT) is proposed, based on the Edinburgh Logical Framework… (More)
Is this relevant?
2009
2009
We present a unifying framework for understanding and developing SAT-based decision procedures for Satisfiability Modulo Theories… (More)
  • figure 2
Is this relevant?
Highly Cited
2008
Highly Cited
2008
The problem of computing Craig Interpolants for propositional (SAT) formulas has recently received a lot of interest, mainly for… (More)
  • figure 2
  • figure 3
Is this relevant?
2006
2006
In this paper we present a new progressive cooperating simplifier for deciding the satisfiability of a quantifier-free formula in… (More)
  • table 1
  • figure 1
  • table 2
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2005
Highly Cited
2005
The annual Satisfiability Modulo Theories Competition (SMT-COMP) is held to spur advances in SMT solver implementations on… (More)
  • figure 1
Is this relevant?