Logic List Mailing Archive

CfP [extended deadline]: SC-square 2024: The 9th International Workshop on Satisfiability Checking and Symbolic Computation, 1 - 6 July 2024. Nancy (France)

                   CALL FOR PAPERS and deadline extension


9th International Workshop on Satisfiability Checking and Symbolic Computation

                            SC-Square 2024

                       July 2, 2024, Nancy France

************************************************************************************ 



The 9th SC-Square Workshop is a satellite event of IJCAR, held at the Inria Nancy research center and LORIA in Nancy, France, from July 1 to July 6, 2024.

Main conference website:
https://merz.gitlabpages.inria.fr/2024-ijcar/

SC-Square Workshop website:
http://www.sc-square.org/CSA/workshop9.html

=== Keynote Speakers ===

We are pleased to announce our keynote speakers:

- Manuel Kauers (Johannes Kepler University, Austria)
- Lawrence Paulson (University of Cambridge, UK)

=== Key Dates ===

Submission deadline: April 19, 2024
ISSAC Fast-Track Deadline*: May 3, 2024
Notification: May 17, 2024
Final version: May 31, 2024
Workshop date: July 2, 2024

*This year, considering the rather tight schedule between the ISSAC conference authors notification (April 30) and the workshop (July 2), we will allow an ISSAC fast track for papers, i.e.,
(1) papers that do not make it to ISSAC on topics related to SC-Square will have the opportunity to be submitted late to SC-Square as full papers;
(2) papers that do make it to ISSAC on topics related to SC-Square will have the opportunity to be submitted late to SC-Square as presentation-only papers.


=== Scope ===

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.


=== Submitting to the Workshop ===

The workshop series has emerged from an H2020 FETOPEN CSA project "SC-Square", which ran from 2016 to 2018. It has been continued aiming at building bridges between Satisfiability Checking and Symbolic Computation. It is open for submission and participation to everyone interested in the topics, whether or not they were members or associates of the original project.

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 logic provers, including but not limited to SMT solvers, and computer algebra software

==== Submission guidelines ====

Submissions should be in English, formatted in Springer LNCS style and submitted via EasyChair using this link:
https://easychair.org/conferences/?conf=scsquare2024

We invite three types of submissions:

(1) FULL PAPERS on research, case studies or tool development should present unpublished work not submitted elsewhere (with a limit of 16 pages, not counting
references)
(2) EXTENDED ABSTRACTS on research, case studies or tool development should present unpublished (potentially ongoing) work not submitted elsewhere
(2–4 pages, not counting references)
(3) PRESENTATION-ONLY submissions on already published work, work to be published elsewhere, or work in progress on SC-Square related open problems or future challenges. Please submit an abstract for approval by the PC (with a limit of 2 pages).

To receive the appropriate level of peer review, please declare your category of your submission by prefixing the title on the EasyChair form with "FP", "EA" or "PO" accordingly.

For consistency, all submissions must use the LNCS style. Current llncs latex files are available from " LaTeX2e Proceedings Templates download" at:
https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines 


We plan to publish the proceedings of the workshop digital form, hosted 
with
CEUR-WS (see http://ceur-ws.org/). Authors may opt out of this, should they
prefer to publish the material elsewhere.

People from industry and business are warmly invited to submit papers to
describe their problems, challenges, goals, and expectations for the 
SC-square
community.


=== Workshop Co-Chairs ===

Daniela Kaufmann (TU Wien, AT)
Chris Brown (U. S. Naval Academy, USA)

=== Program Committee ===

Erika Abraham (RWTH Aachen University, DE)
Haniel Barbosa (Universidade Federal de Minas Gerais, BR)
Armin Biere (University of Freiburg, DE)
Anna Bigatti (University of Genova, IT)
Martin Brain (City University of London, UK)
Curtis Bright (University of Waterloo, CA)
David Cerna (Institute of Computer Science, Czech Academy of Sciences, CZ)
James H. Davenport (University of Bath, UK)
Matthew England (Coventry University, UK)
Pascal Fontaine (University of Liege, BE)
Alberto Griggio (Fondazione Bruno Kessler, IT)
Mikolas Janota (Czech Technical University in Prague, CZ)
Konstantin Korovin (The University of Manchester, UK)
Ilias Kotsireas (Wilfrid Laurier University, CA & Maplesoft)
Gereon Kremer (Certora, IL)
Alex Ozdemir (Stanford University, US)
Stefan Ratschan (Institute of Computer Science, Czech Academy of 
Sciences, CZ)
Christoph Scholl (University of Freiburg, DE)
Thomas Sturm (CNRS, FR & MPI Informatics, DE)
Bican Xia (Peking University, CN)
--
[LOGIC] mailing list, provided by DLMPST
More information (including information about subscription management) can
be found here: http://dlmpst.org/pages/logic-list.php