8 search results - page 1 / 2 » Stochastic Satisfiability Modulo Theories for Non-linear Ari... |
CPAIOR
2008
Springer
14 years 12 months ago
2008
Springer
Abstract. The stochastic satisfiability modulo theories (SSMT) problem is a generalization of the SMT problem on existential and randomized (aka. stochastic) quantification over di...
110
Voted
CAV
2007
Springer
15 years 2 months ago
2007
Springer
Abstract. Solvers for satisfiability modulo theories (SMT) check the satisfiability of first-order formulas containing operations from various theories such as the Booleans, bit-ve...
96
Voted
CAV
2012
Springer
13 years 19 days ago
2012
Springer
Abstract. A minimum satisfying assignment of a formula is a minimumcost partial assignment of values to the variables in the formula that guarantees the formula is true. Minimum sa...
81
Voted
ICFEM
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We study the problem of generating a database and parameters for a given parameterized SQL query satisfying a given test condition. We introduce a formal background theor...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
We propose a new quantifier elimination algorithm for the theory of linear real arithmetic. This algorithm uses as subroutines satisfiability modulo this theory and polyhedral pro...