Abstract

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.

Keywords:
Satisfiability Join (topology) Computer science Computation Square (algebra) Focus (optics) Theoretical computer science Symbolic computation Algorithm Mathematics Combinatorics

Metrics

0
Cited By
0.00
FWCI (Field Weighted Citation Impact)
20
Refs
0.03
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Topics

Formal Methods in Verification
Physical Sciences →  Computer Science →  Computational Theory and Mathematics
Logic, programming, and type systems
Physical Sciences →  Computer Science →  Artificial Intelligence
Computability, Logic, AI Algorithms
Physical Sciences →  Computer Science →  Computational Theory and Mathematics
© 2026 ScienceGate Book Chapters — All rights reserved.