Applying machine learning to the problem of choosing a heuristic to select the variable ordering for cylindrical algebraic decomposition
Not on the map. Why?
Abstract (arXiv)
Cylindrical algebraic decomposition(CAD) is a key tool in computational algebraic geometry, particularly for quantifier elimination over real-closed fields. When using CAD, there is often a choice for the ordering placed on the variables. This can be important, with some problems infeasible with one variable ordering but easy with another. Machine learning is the process of fitting a computer model to a complex function based on properties learned from measured data. In this paper we use machine learning (specifically a support vector machine) to select between heuristics for choosing a variable ordering, outperforming each of the separate heuristics.
Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). First posted on arXiv 25 Apr 2014.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 1; 2023: 3; 2024: 3; 2025: 0; 2026: 2.
10 papers.
- 2023Explainable AI Insights for Symbolic Computation: A case study on selecting the variable ordering for cylindrical algebraic decompositioncited by 7
- 2023Generating Elementary Integrable Expressionscited by 4
- 2024Symbolic Integration Algorithm Selection with Machine Learning: LSTMs vs Tree LSTMscited by 3
- 2023Data Augmentation for Mathematical Objectscited by 2
- 2024Lessons on Datasets and Paradigms in Machine Learning for Symbolic Computation: A Case Study on CADcited by 2
- 2021Learning a performance metric of Buchberger's algorithmcited by 1
- 2024Constrained Neural Networks for Interpretable Heuristic Creation to Optimise Computer Algebra Systemscited by 1
- 2022SC-Square: Future Progress with Machine Learning?cited by 0
- 2026Breaking the Data Barrier in Learning Symbolic Computation: A Case Study on Variable Ordering Suggestion for Cylindrical Algebraic Decompositioncited by 0
- 2026Learning Fast Monomial Orders for Gr"obner Basis Computationscited by 0
- 2026Learning Fast Monomial Orders for Gr"obner Basis Computations3 Feb 2026
- 2026Breaking the Data Barrier in Learning Symbolic Computation: A Case Study on Variable Ordering Suggestion for Cylindrical Algebraic Decomposition20 Jan 2026
- 2024Constrained Neural Networks for Interpretable Heuristic Creation to Optimise Computer Algebra Systems26 Apr 2024
- 2024Symbolic Integration Algorithm Selection with Machine Learning: LSTMs vs Tree LSTMs23 Apr 2024
- 2024Lessons on Datasets and Paradigms in Machine Learning for Symbolic Computation: A Case Study on CAD24 Jan 2024
- 2023Data Augmentation for Mathematical Objects13 Jul 2023
- 2023Generating Elementary Integrable Expressions27 Jun 2023
- 2023Explainable AI Insights for Symbolic Computation: A case study on selecting the variable ordering for cylindrical algebraic decomposition24 Apr 2023
- 2022SC-Square: Future Progress with Machine Learning?9 Sep 2022
- 2021Learning a performance metric of Buchberger's algorithm7 Jun 2021