License
when quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-25081
URL: http://drops.dagstuhl.de/opus/volltexte/2010/2508/

Abraham, Erika ; Loup, Ulrich

SMT-Solving for the First-Order Theory of the Reals

pdf-format:
Dokument 1.pdf (142 KB)


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.

BibTeX - Entry

@InProceedings{abraham_et_al:DSP:2010:2508,
  author =	{Erika Abraham and Ulrich Loup},
  title =	{SMT-Solving for the First-Order Theory of the Reals},
  booktitle =	{Algorithms and Applications for Next Generation SAT Solvers},
  year =	{2010},
  editor =	{Bernd Becker and Valeria Bertacoo and Rolf Drechsler and Masahiro Fujita},
  number =	{09461},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2010/2508},
  annote =	{Keywords: SMT-solving, first-order theory of the reals, verification}
}

Keywords: SMT-solving, first-order theory of the reals, verification
Seminar: 09461 - Algorithms and Applications for Next Generation SAT Solvers
Issue date: 2010
Date of publication: 17.03.2010


DROPS-Home | Fulltext Search | Imprint Published by LZI