SC2: Satisfiability Checking Meets Symbolic Computation (Project Paper)

Symbolic Computationand Satisfiability Checking are two research areas, both having their individual scientific focus but sharing also commoninterests 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 commonplatforms, initiating interaction and exchange, identifying commonchallenges, and developing a commonroadmap 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.