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.
Type de document :
Article dans une revue
ACM Communications in Computer Algebra, Association for Computing Machinery (ACM), 2016, 50 (4), pp.145-147. 〈10.1145/3055282.3055285〉
Liste complète des métadonnées

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

https://hal.inria.fr/hal-01648695
Contributeur : Thomas Sturm <>
Soumis le : mercredi 29 novembre 2017 - 19:50:44
Dernière modification le : jeudi 20 septembre 2018 - 07:54:02

Lien texte intégral

Identifiants

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〉

Partager

Métriques

Consultations de la notice

358