[Publicity] 2nd CfP: SCSS 2021

Tanja Gutenbrunner Tanja.Gutenbrunner at risc.jku.at
Tue Mar 30 16:01:47 CEST 2021

SCSS 2021
The 9th International Symposium on Symbolic Computation in Software Science
   -- In the era of Computational and Artificial Intelligence  --

September 8--10, 2021, virtual

Organized by RISC, Johannes Kepler University Linz, Austria

Symbolic Computation is the science of computing with symbolic objects 
(terms, formulae, programs, representations of algebraic objects, etc.). 
Powerful algorithms have been developed during the past decades for the 
major subareas of symbolic computation: computer algebra and 
computational logic. These algorithms and methods are successfully 
applied in various fields, including software science, which covers a 
broad range of topics about software construction and analysis.

Meanwhile, artificial intelligence methods and machine learning 
algorithms are widely used nowadays in various domains and, in 
particular, combined with symbolic computation. Several approaches mix 
artificial intelligence and symbolic methods and tools deployed over 
large corpora to create what is known as cognitive systems. Cognitive 
computing focuses on building systems that interact with humans 
naturally by reasoning, aiming at learning at scale.

The purpose of SCSS 2021 is to promote research on theoretical and 
practical aspects of symbolic computation in software science, combined 
with modern artificial intelligence techniques.

SCSS 2021 solicits submissions on all aspects of symbolic computation 
and their applications in software science, in combination with 
artificial intelligence and cognitive computing techniques. The topics 
of the symposium include, but are not limited to the following:

- automated reasoning, knowledge reasoning, common-sense reasoning and 
reasoning in science
- algorithm (program) synthesis and/or verification, alignment and joint 
processing of formal, semi-formal, and informal libraries.
- formal methods for the analysis of network and system security
- termination analysis and complexity analysis of algorithms (programs)
- extraction of specifications from algorithms (programs)
- theorem proving methods and techniques, collaboration between 
automated and interactive theorem proving
- proof carrying code
- generation of inductive assertion for algorithm (programs)
- algorithm (program) transformations
- combinations of linguistic/learning-based and semantic/reasoning methods
- formalization and computerization of knowledge (maths, medicine, 
economy, etc.)
- methods for large-scale computer understanding of mathematics and science
- artificial intelligence, machine learning and big-data methods in 
theorem proving and mathematics
- formal verification of artificial intelligence and machine learning 
algorithms, explainable artificial intelligence, symbolic artificial 
- cognitive computing, cognitive vision, perception systems and 
artificial reasoners for robotics
- component-based programming
- computational origami
- query languages (in particular for XML documents)
- semantic web and cloud computing

Important Dates
May 18: title and single-paragraph abstract submission deadline.
May 25: paper submission deadline.
July 12: notification deadline.
July 30: final paper submission deadline.
September 8-10, 2021: the symposium dates (virtual).

Keynote speaker
Bruno Buchberger (RISC, Johannes Kepler University Linz, Austria)

Invited Speakers
Tateaki Sasaki (University of Tsukuba, Japan)
Martina Seidl (Johannes Kepler University Linz, Austria)
Stephen M. Watt (University of Waterloo, Canada)

General Chairs
Adel Bouhoula (Arabian Gulf University, Bahrain)
Tetsuo Ida (University of Tsukuba, Japan)

Program Chair
Temur Kutsia (Johannes Kepler University, Austria)

Program Committee
David Cerna (Czech Academy of Sciences, Czech Republic,
              and Johannes Kepler University Linz, Austria)
Changbo Chen (Chinese Academy of Sciences, China)
Rachid Echahed (CNRS, Grenoble, France)
Seyed Hossein Haeri (UC Louvain, Belgium)
Mohamed-Bécha Kaâniche (Sup'Com, Carthage University, Tunisia)
Cezary Kaliszyk (University of Innsbruck, Austria)
Yukiyoshi Kameyama (University of Tsukuba, Japan)
Michael Kohlhase (University of Erlangen-Nuremberg, Germany)
Laura Kovacs (Vienna University of Technology, Austria)
Temur Kutsia (Johannes Kepler University Linz, Austria) (Chair)
Zied Lachiri (ENIT, University of Tunis El Manar, Tunisia)
Christopher Lynch (Clarkson University, USA)
Mircea Marin (West University of Timisoara, Romania)
Yasuhiko Minamide (Tokyo Institute of Technology, Japan)
Yoshihiro Mizoguchi (Kyushu University, Japan)
Julien Narboux (Strasbourg University, France)
Michaël Rusinowitch (INRIA, France)
Wolfgang Schreiner (Johannes Kepler University Linz, Austria)
Sofiane Tahar (Concordia University, Canada)
Dongming Wang (CNRS, Paris, France)

Submission is via EasyChair:


Original submissions are invited in two categories: regular research 
papers and tool papers. We recommend using the EPTCS Class format to 
prepare manuscripts. Regular research papers must not exceed 12 pages 
with up to 3 additional pages for technical appendices. Tool papers must 
not exceed 6 pages. They should include information about a URL from 
where the tool can be downloaded or accessed on-line.

The proceedings of SCSS 2021 will be published in the Electronic 
Proceedings in Theoretical Computer Science (EPTCS).

A special issue of Annals of Mathematics and Artificial Intelligence 
(AMAI) will be organized after the symposium. Submitted full-length 
papers will be refereed according to the usual standards of the journal.

If you do not wish to receive announcements from the
Research Institute for Symbolic Computation (RISC),
please send an e-mail to the following address:
secretary at risc.jku.at

More information about the Publicity mailing list