DagSemProc.09461.3.pdf
- Filesize: 141 kB
- 7 pages
Document
SMT-Solving for the First-Order Theory of the Reals
Authors
-
Part of:
Volume:
Dagstuhl Seminar Proceedings, Volume 9461
Series: Dagstuhl Seminar Proceedings (DagSemProc) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2010-03-17
Cite As Get BibTex
Erika Abraham and Ulrich Loup. SMT-Solving for the First-Order Theory of the Reals. In Algorithms and Applications for Next Generation SAT Solvers. Dagstuhl Seminar Proceedings, Volume 9461, pp. 1-7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
https://doi.org/10.4230/DagSemProc.09461.3
Abstract
SAT-solving is a highly actual research area with increasing success and plenty of industrial applications. SMT-solving, extending SAT with theories, has its main focus on linear real constrains. However, there are only few solvers going further to more expressive but still decidable logics like the first-order theory of the reals with addition and multiplication. The main requests on theory solvers that must be fulfilled for their efficient embedding into an SMT solver are (a) incrementality, (b) the efficient computation of minimal infeasible subsets, and (c) the support of backtracking. For the first-order theory of the reals we are not aware of any solver offering those functionalities. In this work we address the possibilities to extend existing theory solving algorithms to come up with a theory solver suited for SMT.
Subject Classification
Keywords
- SMT-solving
- first-order theory of the reals
- verification
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads