HOME

SCSS 2024, August 28-30, Tokyo

SCSS 2024 will be held
at Tokyo University of Science Kagurazaka Campus, Tokyo, Japan

SCSS 2024 is the 10th International Symposium on Symbolic Computation in Software Science. It aims to promote research on theoretical and practical aspects of symbolic computation in software science, combined with modern artificial intelligence techniques.

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 significant 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 software construction and analysis.

Scope

The topics of the symposium include, but are not limited to, the following:

• program synthesis, transformation, and verification by AI methods 
• automated reasoning and knowledge management
• theorem proving methods and techniques
• formal verification of AI and machine learning algorithms
• formal methods for the analysis of security
• symbolic methods for computational geometry and image processing 
• symbolic methods for semantic web and cloud computing
• query languages for symbolic data

Latest News

[4/11/23: First call for papers was sent ], pdf

[1/3/24: Deadline was Extended], pdf

[23/6/24: PhD session is open], here

[24/6/24: Registration is open], here

[24/7/18: Program is open], here

SUBMISSION

Important Dates

2024-03-15: regular paper title and abstract. (Extended)
2024-03-22: regular paper full submission. (Extended)
2024-05-01: regular paper notification.
2024-06-20: regular paper camera-ready submission deadline. (Extended)
2024-06-21: work-in-progress papers submission deadline. (Extended)
2024-06-28: work-in-progress papers notification. (Extended)
2024-07-23: Deadline for abstract of the PhD session
2024-07-30: notification of the PhD session
2024-08-28: conference begins.

Submission Instructions

Original submissions are invited in two categories: regular research papers and work-in-progress papers.

Regular research papers must not exceed 15 pages in LNCS format including references and appendices. It is planned for the accepted papers to be published in a proceedings in the Springer LNAI series. Shorter papers on tools may be considered in this category and should include a URL from which the tool can be downloaded or accessed on-line.

Work-in-progress papers need not be original. Concurrent submission to another conference or a journal is allowed. Papers in this category are limited in length to 6 pages in the EPTCS format. The accepted ones will be presented at the symposium and will be included in a CoRR proceedings.

Papers and abstracts are submitted via the EasyChair submission page:

https://www.easychair.org/conferences/?conf=scss2024

COMMITTEES

Organization

General Chair:
Tetsuo Ida (University of Tsukuba)

Program Committee Chair: 
Stephen Watt (University of Waterloo)

Local Arrangements Chair:
Katsusuke Nabeshima (Tokyo University of Science)

Program Committee
Stephen Watt (University of Waterloo) (chair)
David Cerna (Czech Academy of Sciences, Institute of Computer Science)
Changbo Chen (Chinese Academy of Sciences)
Rachid Echahed (CNRS and University of Grenoble)
David Jeffrey (University of Western Ontario)
Cezary Kaliszyk (University of Innsbruck)
Yukiyoshi Kameyama (University of Tsukuba)
Laura Kovacs (TU Wien)
Temur Kutsia (RISC, Johannes Kepler University)
Christopher Lynch (Clarkson University)
Yasuhiko Minamide (Tokyo Institute of Technology)
Julien Narboux (LSIIT, CNRS and Université de Strasbourg)
Wolfgang Schreiner (RISC, Johannes Kepler University)
Sofiene Tahar (Concordia University)
Lihong Zhi (KLMM, Chinese Academy of Sciences)

Ph.D. student session Committee
Xavier Dahan (Tohoku University)

 Local Arrangements Committee
Katsusuke Nabeshima (Tokyo University of Science) (chair)
Yuki Ishihara (Nihon University)
Hiroshi Sekigawa (Tokyo University of Science)
Akira Terui (University of Tsukuba)
Yosuke Sato (Tokyo University of Science)

Invited Speaker

  • Wenshin Lee (University of Stirling)
    Title: From computer algebra to signal processing
    Abstract:
    In 1795, the French mathematician de Prony published a method to fit a realvalued exponential model to some uniformly collected samples. This classical method in approximation theory is based on a linear recurrence relation among the data. After two centuries, in the field of computer algebra, Ben-Or and Tiwari presented an algorithm for interpolating sparse multivariate polynomials. Interestingly, these two methods are closely related. The cross-fertilization between these two has led to a series of exciting developments in exponential analysis and its applications in signal processing, including a multivariate exponential analysis method that does not suffer from the well-known curse of dimensionality, a validated exponential analysis approach based on subsampling, and the breaking of the Nyquist constraint that has underpinned almost all digital signal applications so far.

  • Stephen Wolfram (Wolfram Research)
    Title: Relating Symbolic Computation to the Foundations of Science
    Abstract:
    It started with a breakthrough in fundamental physics in 2020. And now it’s becoming clear that the foundations of science are deeply connected to ideas in symbolic computation. The result is emerging unification that relates term rewriting to black holes, metamathematical space to SETI, biological evolution undecidability, and much more. This talk will discuss both new theoretical perspectives and results, and some of their practical implications, notably in emerging features of the Wolfram Language.

  • Kazuhiro Yokoyama (Rikkyo University) 
    Title: Operations on Parametric Ideals
    Abstract:
    We deal with ideals generated by polynomials with parametric coefficients, and introduce the notion of stabilities on ideal structures based on stability of forms of Gröbner bases. For these computations, we can apply comprehensive Gröbner systems effectively. Then, we consider stabilities on basic operations on ideals, such as intersection, quotient, saturation, and radical, and show that those are computable with help of comprehensive Gröbner systems. Moreover, as an advanced operation, we consider primary decomposition and discuss its computational tractability.

  • Masahiko Sato (Kyoto University)
    Title: Proof Assistants and Foundations of Mathematics
    Abstract:
    Reflecting on the history of the developments of mathematics and proof
    assistants, I will propose a design principle of a new proof assistant which provides an environment where mathematcics and metamathematics can be developed simultaneously in a seemless manner.