License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagRep.5.11.71
URN: urn:nbn:de:0030-drops-57657
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2016/5765/
Go back to Dagstuhl Reports

Ábrahám, Erika ; Fontaine, Pascal ; Sturm, Thomas ; Wang, Dongming
Weitere Beteiligte (Hrsg. etc.): Erika Ábrahám and Pascal Fontaine and Thomas Sturm and Dongming Wang

Symbolic Computation and Satisfiability Checking (Dagstuhl Seminar 15471)

pdf-format:
dagrep_v005_i011_p071_s15471.pdf (1 MB)

Abstract

The seminar focused on satisfiability checking for combinations of first-order logic and subclasses thereof with arithmetic theories in a very liberal sense, also covering quantifiers and parameters. It gathered members of the two communities of symbolic computation (or computer algebra) and satisfiability checking (including satisfiability modulo theories). Up-to-now, these two communities have been working quite independently. We are confident that the seminar will initiate cross-fertilization of both fields and bring improvements for both satisfiability checking and symbolic computation, and for their applications.

BibTeX - Entry

@Article{brahm_et_al:DR:2016:5765,
  author =	{Erika Ábrah{\'a}m and Pascal Fontaine and Thomas Sturm and Dongming Wang},
  title =	{{Symbolic Computation and Satisfiability Checking (Dagstuhl Seminar 15471)}},
  pages =	{71--89},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2016},
  volume =	{5},
  number =	{11},
  editor =	{Erika Ábrah{\'a}m and Pascal Fontaine and Thomas Sturm and Dongming Wang},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2016/5765},
  URN =		{urn:nbn:de:0030-drops-57657},
  doi =		{10.4230/DagRep.5.11.71},
  annote =	{Keywords: algorithmic algebra, arithmetic, automated reasoning, decision procedures, quantifier elimination, satisfiability checking, SMT solving, symbolic comp}
}

Keywords: algorithmic algebra, arithmetic, automated reasoning, decision procedures, quantifier elimination, satisfiability checking, SMT solving, symbolic comp
Collection: Dagstuhl Reports, Volume 5, Issue 11
Issue Date: 2016
Date of publication: 31.03.2016

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI