Abstract
Symbolic Computation and Satisfiability Checking are viewed as individual research areas, but they
share common interests in the development, implementation and application of decision procedures for
arithmetic theories. Despite these commonalities, the two communities are currently only weakly connected.
We introduce a new project SC2 to build a joint community in this area, supported by a newly
accepted EU (H2020-FETOPEN-CSA) project of the same name. We aim to strengthen the connection
between these communities by creating common platforms, initiating interaction and exchange, identifying
common challenges, and developing a common roadmap. This abstract and accompanying poster
describes the motivation and aims for the project, and reports on the first activities.
Original language | English |
---|---|
Pages (from-to) | 145-147 |
Journal | ACM Communications in Computer Algebra |
Volume | 50 |
Issue number | 4 |
DOIs | |
Publication status | Published - 1 Dec 2016 |
Event | International Symposium on Symbolic and Algebraic Computation - Wilfrid Laurier University, Waterloo, Canada Duration: 20 Jul 2016 → 22 Jul 2016 http://www.issac-conference.org/2016/ |
Bibliographical note
© ACM, 2016. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in ACM Communications in Computer Algebra, {50, 4, (2016)}http://doi.acm.org/10.1145/3055282.3055285