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.
Document type :
Journal articles
Liste complète des métadonnées

Cited literature [3 references]  Display  Hide  Download

https://hal.inria.fr/hal-01648695
Contributor : Thomas Sturm <>
Submitted on : Wednesday, November 29, 2017 - 7:50:44 PM
Last modification on : Tuesday, February 19, 2019 - 3:40:04 PM

Links full text

Identifiers

Collections

Citation

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

Share

Metrics

Record views

521