4 papers · 1 filter
Tree-Based Deep Learning for Ranking Symbolic Integration Algorithms
Rashid Barket, Matthew England, Jürgen Gerhard
Symbolic indefinite integration in Computer Algebra Systems such as Maple involves selecting the most effective algorithm from multiple available methods. Not all methods will succ…
Recent Developments in Real Quantifier Elimination and Cylindrical Algebraic Decomposition
Matthew England
This extended abstract accompanies an invited talk at CASC 2024, which surveys recent developments in Real Quantifier Elimination (QE) and Cylindrical Algebraic Decomposition (CAD)…
The Liouville Generator for Producing Integrable Expressions
Rashid Barket, Matthew England, Jürgen Gerhard
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…
Constrained Neural Networks for Interpretable Heuristic Creation to Optimise Computer Algebra Systems
Dorian Florescu, Matthew England
We present a new methodology for utilising machine learning technology in symbolic computation research. We explain how a well known human-designed heuristic to make the choice of…