SC 2 : Satisfiability Checking meets Symbolic Computation (Project Paper)

Abstract : Symbolic Computation and Satisfiability Checking are two research areas, both having their individual scientific focus but sharing also common interests in the development, implementation and application of decision procedures for arithmetic theories. Despite their commonalities, the two communities are rather weakly connected. The aim of our newly accepted SC 2 project (H2020-FETOPEN-CSA) is to strengthen the connection between these communities by creating common platforms, initiating interaction and exchange, identifying common challenges, and developing a common roadmap from theory along the way to tools and (industrial) applications. In this paper we report on the aims and on the first activities of this project, and formalise some relevant challenges for the unified SC 2 community.
Document type :
Conference papers
Complete list of metadatas

Cited literature [55 references]  Display  Hide  Download

https://hal.inria.fr/hal-01377655
Contributor : Pascal Fontaine <>
Submitted on : Friday, October 7, 2016 - 12:32:36 PM
Last modification on : Wednesday, July 3, 2019 - 10:34:21 AM
Long-term archiving on : Friday, February 3, 2017 - 6:57:22 PM

File

SCSC-CICM16.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01377655, version 1

Collections

Citation

Eriká Abrahám, John Abbott, Bernd Becker, Anna Bigatti, Martin Brain, et al.. SC 2 : Satisfiability Checking meets Symbolic Computation (Project Paper). Intelligent Computer Mathematics, Jul 2016, Bialystok, Poland. ⟨hal-01377655⟩

Share

Metrics

Record views

525

Files downloads

143