Satisfiability Checking and Symbolic Computation

We are delighted to announce a forthcoming Topical Collection for the 2022 SC² and 2023 SC² International Workshops on Satisfiability Checking and Symbolic Computation.

Symbolic Computation is concerned with the efficient algorithmic determination of exact solutions to complicated mathematical problems. Satisfiability Checking has recently started to tackle similar problems but with different algorithmic and technological solutions.

The two communities share many central interests, but researchers from these two communities rarely interact. Also, the lack of common or compatible interfaces for tools is an obstacle to their fruitful combination. Bridges between the communities in the form of common platforms and road-maps are necessary to initiate an exchange, and to support and direct their interaction. The aim of this workshop is to provide an opportunity to discuss, share knowledge and experience across both communities.

The topics of interest include but are not limited to:

- Satisfiability Checking for Symbolic Computation

- Symbolic Computation for Satisfiability Checking

- Applications relying on both Symbolic Computation and Satisfiability Checking

- Combination of Symbolic Computation and Satisfiability Checking tools

- Quantifier elimination and decision procedures and their embedding into computer algebra software and logic provers, including but not limited to SMT solvers

We call for submissions that are either extensions of SC-Square 2022/2023 proceedings papers with at least 30% novel content, or which present other novel work, not yet submitted or published elsewhere.