SC2: Satisfiability Checking meets Symbolic Computation (Project Paper)

Erika Abraham, John Abbott, Bernd Becker, Anna M. Bigatti, Martin Brain, Bruno Buchberger, Alessandro Cimatti, James Davenport, Matthew England, Pascal Fontaine, Stephen Forrest, Alberto Griggio, Daniel Kroening, Werner Seiler, Thomas Sturm

Research output: Chapter or section in a book/report/conference proceedingChapter in a published conference proceeding

29 Citations (SciVal)


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 SC2 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 SC2 community.
Original languageEnglish
Title of host publicationIntelligent Computer Mathematics
Subtitle of host publication9th International Conference, CICM 2016, Bialystok, Poland, July 25-29, 2016, Proceedings
EditorsM. Kohlhase, M. Johansson, B. Miller, L. de Moura, F. Tompa
PublisherSpringer International Publishing
ISBN (Print)9783319425467
Publication statusPublished - 12 Jul 2016

Publication series

NameLecture Notes in Artificial Intelligence


Dive into the research topics of 'SC2: Satisfiability Checking meets Symbolic Computation (Project Paper)'. Together they form a unique fingerprint.

Cite this