Explainable AI insights for symbolic computation: a case study on selecting the variable ordering for cylindrical algebraic decomposition
DOI10.1016/j.jsc.2023.102276arXiv2304.12154MaRDI QIDQ6149145
Tereso del Río Almajano, Lynn Pickering, Matthew England, Kelly Cohen
Publication date: 5 February 2024
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2304.12154
computer algebracylindrical algebraic decompositionvariable orderingexplainable AIheuristic development
Symbolic computation and algebraic computation (68W30) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Code optimization in FORM
- On using Lazard's projection in CAD construction
- Real quantifier elimination is doubly exponential
- Partial cylindrical algebraic decomposition for quantifier elimination
- TheoryGuru: a Mathematica package to apply quantifier elimination technology to economics
- Validity proof of Lazard's method for CAD construction
- Using machine learning to improve cylindrical algebraic decomposition
- New heuristic to choose a cylindrical algebraic decomposition variable ordering motivated by complexity analysis
- Identifying the parametric occurrence of multiple steady states for some biological networks
- Comparing machine learning models to choose the variable ordering for cylindrical algebraic decomposition
- Fully incremental cylindrical algebraic decomposition
- Cylindrical algebraic decomposition with equational constraints
- Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. Translation from the German
- Cylindrical algebraic decomposition using validated numerics
- Machine learning the real discriminant locus
- Special issue on algebraic geometry and machine learning
- Efficient Subformula Orders for Real Quantifier Elimination of Non-prenex Formulas
- Open Non-uniform Cylindrical Algebraic Decompositions
- Optimising Problem Formulation for Cylindrical Algebraic Decomposition
- Computing cylindrical algebraic decomposition via triangular decomposition
- Solving Non-linear Arithmetic
- MetiTarski: Past and Future
- Efficient projection orders for CAD
- Improved Cross-Validation for Classifiers that Make Algorithmic Choices to Minimise Runtime Without Compromising Output Correctness
- Advancing mathematics by guiding human intuition with AI
- Variable Ordering Selection for Cylindrical Algebraic Decomposition with Artificial Neural Networks
- A Machine Learning Based Software Pipeline to Pick the Variable Ordering for Algorithms with Polynomial Inputs
- Real World Verification
- Applying Machine Learning to the Problem of Choosing a Heuristic to Select the Variable Ordering for Cylindrical Algebraic Decomposition
This page was built for publication: Explainable AI insights for symbolic computation: a case study on selecting the variable ordering for cylindrical algebraic decomposition
