The Liouville Generator for Producing Integrable Expressions
Not on the map. Why?
Abstract (arXiv)
There has been a growing need to devise processes that can create comprehensive datasets in the world of Computer Algebra, both for accurate benchmarking and for new intersections with machine learning technology. We present here a method to generate integrands that are guaranteed to be integrable, dubbed the LIOUVILLE method. It is based on Liouville's theorem and the Parallel Risch Algorithm for symbolic integration. We show that this data generation method retains the best qualities of previous data generation methods, while overcoming some of the issues built into that prior work. The LIOUVILLE generator is able to generate sufficiently complex and realistic integrands, and could be used for benchmarking or machine learning training tasks related to symbolic integration.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 7 of its 23 references that are in the map. First posted on arXiv 17 Jun 2024.
Builds on
7 of 23 references.
References · 7
- 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,203
- 2019Deep Learning for Symbolic Mathematicscited by 266
- 2021A Neural Network Solves, Explains, and Generates University Math Problems by Program Synthesis and Few-Shot Learning at Human Levelcited by 96
- 2019Can Neural Networks Learn Symbolic Rewriting?cited by 12
- 2019The Use of Deep Learning for Symbolic Integration: A Review of (Lample and Charton, 2019)cited by 11
- 2023Generating Elementary Integrable Expressionscited by 4
- 2024Symbolic Integration Algorithm Selection with Machine Learning: LSTMs vs Tree LSTMscited by 3
Built on by
Citing papers per year: 2024: 1; 2025: 1.
2 papers.