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.
Type de document :
Communication dans un congrès
Intelligent Computer Mathematics, Jul 2016, Bialystok, Poland. 〈http://www.cicm-conference.org/2016/cicm.php〉
Liste complète des métadonnées

Littérature citée [55 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01377655
Contributeur : Pascal Fontaine <>
Soumis le : vendredi 7 octobre 2016 - 12:32:36
Dernière modification le : lundi 20 novembre 2017 - 15:14:02
Document(s) archivé(s) le : vendredi 3 février 2017 - 18:57:22

Fichier

SCSC-CICM16.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • 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. 〈http://www.cicm-conference.org/2016/cicm.php〉. 〈hal-01377655〉

Partager

Métriques

Consultations de la notice

236

Téléchargements de fichiers

76