SC2: Satisfiability checking meets symbolic computation

Conference item

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.

Authors: Ábrahám, E; Abbott, J; Becker, B; Bigatti, A; Brain, M

• Publication status: Published
• Peer review status: Peer reviewed
• Publisher: Springer
• Host title: 9th Conference on Intelligent Computer Mathematics
• Journal: 9th Conference on Intelligent Computer Mathematics
• Volume: LNCS 9791
• Pages: 28-43
• Publication date: 2016-07-01
• Acceptance date: 2016-06-06
• DOI: 10.1007/978-3-319-42547-4_3
• ISSN: 0302-9743, 1611-3349
• ISBN: 9783319425467
• Keywords: Computer Algebra Systems; Satisfiability Checking; Symbolic Computation; Satisfiability Modulo Theories; Logical Problems