Paper Info
Title
Satisfiability Checking and Symbolic Computation.
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.
Year
DOI
Venue
2016
10.1145/3055282.3055285
ACM Communications in Computer Algebra
DocType
Volume
Issue
Journal
50
4
ISSN
Citations 
PageRank 
1932-2240
0
0.34
References 
Authors
2
15
Name
Order
Citations
PageRank
Erika Ábrahám183063.17
John Abbott264.15
B. Becker319121.44
Anna Maria Bigatti44414.97
Martin Brain527922.41
Bruno Buchberger6847168.26
Alessandro Cimatti75064323.15
James H. Davenport8844141.40
Matthew England919220.58
Pascal Fontaine1054.88
Stephen Forrest1101.35
Alberto Griggio1262436.37
Daniel Kroening133084187.60
Werner M. Seiler147917.45
Thomas Sturm 00011541.14