Satisfiability Checking and Symbolic Computation
E. Abraham, J. Abbott, B. Becker, A.M. Bigatti, M. Brain, B., Buchberger, A. Cimatti, J.H. Davenport, M. England, P. Fontaine, S. Forrest,, A. Griggio, D. Kroening, W.M. Seiler, T. Sturm

TL;DR
This paper introduces the SC-square project to bridge the gap between symbolic computation and satisfiability checking communities, fostering collaboration, shared platforms, and a unified research roadmap.
Contribution
It presents a new initiative to connect two related research areas, promoting interaction, shared tools, and coordinated development of decision procedures.
Findings
Initial activities and collaborations have begun.
A shared platform for research exchange is being developed.
The project aims to unify research efforts in arithmetic decision procedures.
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-square 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
