DagRep.5.11.71.pdf
- Filesize: 1.09 MB
- 19 pages
Document
Symbolic Computation and Satisfiability Checking (Dagstuhl Seminar 15471)
Authors and all authors of the abstracts in this report
-
Part of:
Issue:
Dagstuhl Reports, Volume 5, Issue 11
Volume: Dagstuhl Reports, Volume 5
Journal: Dagstuhl Reports (DagRep) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2016-03-31
Cite AsGet 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
https://doi.org/10.4230/DagRep.5.11.71
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.
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)
0PDF Downloads