Sciweavers

58 search results - page 5 / 12
» Abstract DPLL and Abstract DPLL Modulo Theories
Sort
View
79
Voted
ICFEM
2009
Springer
15 years 4 months ago
Symbolic Query Exploration
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...
Margus Veanes, Pavel Grigorenko, Peli de Halleux, ...
CPAIOR
2008
Springer
14 years 11 months ago
Stochastic Satisfiability Modulo Theories for Non-linear Arithmetic
Abstract. The stochastic satisfiability modulo theories (SSMT) problem is a generalization of the SMT problem on existential and randomized (aka. stochastic) quantification over di...
Tino Teige, Martin Fränzle
SAT
2009
Springer
113views Hardware» more  SAT 2009»
15 years 4 months ago
Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
Abstract. We offer a new understanding of some aspects of practical SAT-solvers that are based on DPLL with unit-clause propagation, clause-learning, and restarts. On the theoreti...
Albert Atserias, Johannes Klaus Fichte, Marc Thurl...
TACAS
2010
Springer
255views Algorithms» more  TACAS 2010»
14 years 7 months ago
Satisfiability Modulo the Theory of Costs: Foundations and Applications
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...
Alessandro Cimatti, Anders Franzén, Alberto...
CADE
2009
Springer
15 years 10 months ago
veriT: An Open, Trustable and Efficient SMT-Solver
Abstract. This article describes the first public version of the satisfiability modulo theory (SMT) solver veriT. It is open-source, proof-producing, and complete for quantifier-fr...
David Déharbe, Diego Caminha B. de Oliveira...