Download PDFOpen PDF in browser

SC-square: when Satisfiability Checking and Symbolic Computation join forces

5 pagesPublished: November 8, 2017


Symbolic Computation and Satisfiability Checking are two research areas, both having their individual scientific focus but with common interests, e.g., 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 the SC-square initiative 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.

Keyphrases: automated reasoning, computer algebra, satisfiability checking, symbolic computation

In: Giles Reger and Dmitriy Traytel (editors). ARCADE 2017. 1st International Workshop on Automated Reasoning: Challenges, Applications, Directions, Exemplary Achievements, vol 51, pages 6--10

Download PDFOpen PDF in browser