A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Symbolic Computation and Satisfiability Checking : Report of Dagstuhl Seminar 15471
2016
Preserved Fulltext
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
doi:10.18154/rwth-2017-01217
fatcat:5aaxyhouqrdcfhhvek76vkdwjm