Lessons on datasets and paradigms in machine learning for symbolic computation: a case study on CAD

DOI10.1007/S11786-024-00591-0MaRDI QIDQ6653101zbMATH OpenFDO

Authors Tereso del Río, Matthew England

Publication date 16 December 2024

Published in Mathematics in Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S11786-024-00591-0

zbMATH Keywords

classificationcylindrical algebraic decompositiondata augmentationmachine learningregressionsymbolic computation

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Symbolic computation and algebraic computation (68W30)

Cites work

• Advancing mathematics by guiding human intuition with AI
• An augmented MetiTarski dataset for real quantifier elimination using machine learning
• Applied predictive modeling
• Applying machine learning to heuristics for real polynomial constraint solving
• Applying machine learning to the problem of choosing a heuristic to select the variable ordering for cylindrical algebraic decomposition
• Comparing machine learning models to choose the variable ordering for cylindrical algebraic decomposition
• Cylindrical algebraic decomposition in the RegularChains library
• Efficient projection orders for CAD
• Explainable AI insights for symbolic computation: a case study on selecting the variable ordering for cylindrical algebraic decomposition
• Good pivots for small sparse matrices
• scientific article; zbMATH DE number 3497890 (Why is no real title available?)
• scientific article; zbMATH DE number 1273640 (Why is no real title available?)
• Identifying the parametric occurrence of multiple steady states for some biological networks
• Improved Cross-Validation for Classifiers that Make Algorithmic Choices to Minimise Runtime Without Compromising Output Correctness
• Improved projection for cylindrical algebraic decomposition
• Machine learning the real discriminant locus
• MetiTarski: past and future
• Neurons on amoebae
• New heuristic to choose a cylindrical algebraic decomposition variable ordering motivated by complexity analysis
• Optimising problem formulation for cylindrical algebraic decomposition
• Real quantifier elimination is doubly exponential
• Satisfiability modulo theories
• SATzilla: portfolio-based algorithm selection for SAT
• Symbolic integration algorithm selection with machine learning: LSTMs vs tree LSTMs
• The complexity of quantifier elimination and cylindrical algebraic decomposition
• Using machine learning to improve cylindrical algebraic decomposition
• Variable ordering selection for cylindrical algebraic decomposition with artificial neural networks

This page was built for publication: Lessons on datasets and paradigms in machine learning for symbolic computation: a case study on CAD

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6653101)