Satisfiability Checking and Symbolic Computation - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles ACM Communications in Computer Algebra Year : 2016

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 SC 2 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.

Dates and versions

hal-01648695 , version 1 (29-11-2017)

Identifiers

Cite

Thomas Sturm, Erika Abraham, John A. Abbott, Bern W. Becker, Anna Maria Bigatti, et al.. Satisfiability Checking and Symbolic Computation. ACM Communications in Computer Algebra, 2016, 50 (4), pp.145-147. ⟨10.1145/3055282.3055285⟩. ⟨hal-01648695⟩
390 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More