SCSS 2024 is the 10th edition of the 10th International Symposium on Symbolic Computation in Software Science. The symposium aims to promote research on the theoretical and practical aspects of symbolic computation in software science in the context of modern computational and artificial intelligence techniques. It will be held in Tokyo from August 28 to 30. The symposium has three main types of presentations: • the keynote and invited talks • formal full papers • works in progress.
SCSS Steering Committee as of August 2023 SCSS 2024 Organizing Committee
Laura Kovács Temur Kutsia Mohamed Mosbah Michael Rusinowitch Masahiko Sato Carsten Schneider Dongming Wang
Changbo Chen Rachid Echahed David Jefrey Cezary Kaliszyk Yukiyoshi Kameyama Laura Kovács Temur Kutsia Christopher Lynch Yasuhiko Minamide Julien Narboux Wolfgang Schreiner Sofiène Tahar Stephen Watt (chair) Lihong Zhi
RISC Johannes Kepler University, Austria North Carolina State University, USA University of Tsukuba, Japan TU Wien, Austria RISC Johannes Kepler University, Austria LABRI, France INRIA, France Kyoto University, Japan RISC Johannes Kepler University, Austria Beihang University, China, and CNRS, France
Chinese Academy of Sciences, China CNRS and University of Grenoble, France University of Western Ontario, Canada University of Innsbruck, Austria University of Tsukuba, Japan TU Wien, Austria RISC Johannes Kepler University, Austria Clarkson University, USA Tokyo Institute of Technology CNRS and Université de Strasbourg, France RISC Johannes Kepler University, Austria Concordia University, Canada
University of Waterloo, Canada AMSS Chinese Academy of Sciences, China
Katsusuke Nabeshima (chair) Yosuke Sato Hiroshi Sekigawa Akira Terui
Tokyo University of Science, Japan Tokyo University of Science, Japan Tokyo University of Science, Japan University of Tsukuba, Japan
SCSS 2024 gratefully acknowledges the support of our sponsors, the Kayamori foundation of informational science advancement and Maplesoft. Improving LLM-based code completion using LR parsing-based candidates
Atique, Choi, Sasano, Moon . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 Faster bivariate lexicographic Groebner bases modulo
Dahan . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 Some applications of Chinese Remainder Theorem codes with error-correction
Elliott, Schost . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 Functional decomposition of sparse polynomials (short talk abstract)
Giesbrecht . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19 Towards trajectory planning of a robot manipulator with computer algebra using Bézier curves for obstacle avoidance
Hatakeyama, Terui, Mikawa . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21 Algebraic (non) relations among polyzetas
Hoang Ngoc Minh . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 28 An e-origami artwork of a big wing crane
Ida . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34 The geometry of -body orbits and the DFT (extended abstract)
Ion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 46 Gröbner basis computation via learning
Kera, Ishihara, Vaccon, Yokoyama . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 51 Solving estimation problems using minimax polynomials and Gröbner bases
Kuramochi, Terui, Mikawa . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 57 First-order theorem proving with power maps in semigroups
Lin, Padmanabhan, Zhang . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 63 Software for indefinite integration
Norman, Jefrey . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 74 Towards trajectory planning for a 6-degree-of-freedom robot manipulator considering the orientation of the end-efector Using computer algebra
Okazaki, Terui, Mikawa . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 84 Methods for solving the Post correspondence problem and certificate generation
Omori, Minamide . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 92 A stable computation of multivariarte apporximate GCD based on SVD and lifting technique
Sanuki . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 99 An optimized path planning of manipulator with spline curves using real quantifier elimination based on comprehensive Gröbner systems
Shirato, Oka, Terui, Mikawa . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 105 Reasoning about the embedded shape of a qualitatively represented curve
Takahashi . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 113