Document Open Access Logo

Symbolic Computation and Satisfiability Checking (Dagstuhl Seminar 15471)

Authors Erika Ábrahám, Pascal Fontaine, Thomas Sturm, Dongming Wang and all authors of the abstracts in this report

PDF

File

Thumbnail PDF
PDF
DagRep.5.11.71.pdf
  • Filesize: 1.09 MB
  • 19 pages

Document Identifiers

Subject Classification

Keywords
  • algorithmic algebra
  • arithmetic
  • automated reasoning
  • decision procedures
  • quantifier elimination
  • satisfiability checking
  • SMT solving
  • symbolic comp

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

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.

Cite As Get BibTex

Erika Ábrahám, Pascal Fontaine, Thomas Sturm, and Dongming Wang. Symbolic Computation and Satisfiability Checking (Dagstuhl Seminar 15471). In Dagstuhl Reports, Volume 5, Issue 11, pp. 71-89, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016) https://doi.org/10.4230/DagRep.5.11.71

Author Details

Erika Ábrahám
Pascal Fontaine
Thomas Sturm
Dongming Wang
and all authors of the abstracts in this report
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact