Applying Machine Learning to the Problem of Choosing a Heuristic to Select the Variable Ordering for Cylindrical Algebraic Decomposition

DOI10.1007/978-3-319-08434-3_8zbMath1304.68224arXiv1404.6369OpenAlexW3098430291WikidataQ57382551 ScholiaQ57382551MaRDI QIDQ5495916

Zongyan Huang, James P. Bridge, Matthew England, David J. Wilson, Lawrence Charles Paulson, James H. Davenport

Publication date: 7 August 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1404.6369

zbMATH Keywords

symbolic computationcylindrical algebraic decompositionmachine learningsupport vector machineproblem formulation

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

Applying Machine Learning to Heuristics for Real Polynomial Constraint Solving, A Machine Learning Based Software Pipeline to Pick the Variable Ordering for Algorithms with Polynomial Inputs, Recent Advances in Real Geometric Reasoning, Learning a performance metric of Buchberger's algorithm, Explainable AI insights for symbolic computation: a case study on selecting the variable ordering for cylindrical algebraic decomposition, Computing with Tarski formulas and semi-algebraic sets in a web browser, Using machine learning to improve cylindrical algebraic decomposition, Identifying the parametric occurrence of multiple steady states for some biological networks, Truth table invariant cylindrical algebraic decomposition, Need Polynomial Systems Be Doubly-Exponential?, Fully incremental cylindrical algebraic decomposition, Cylindrical algebraic decomposition with equational constraints, The Complexity of Cylindrical Algebraic Decomposition with Respect to Polynomial Degree, Choosing better variable orderings for cylindrical algebraic decomposition via exploiting chordal structure, Improved Cross-Validation for Classifiers that Make Algorithmic Choices to Minimise Runtime Without Compromising Output Correctness

Uses Software

• Maple
• MetiTarski
• QEPCAD
• SVMlight
• REDLOG
• LIBSVM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• MetiTarski: An automatic theorem prover for real-valued special functions
• Partial cylindrical algebraic decomposition for quantifier elimination
• Multilayer feedforward networks are universal approximators
• Machine learning for first-order theorem proving
• Cylindrical algebraic decomposition using validated numerics
• Algorithmic methods for investigating equilibria in epidemic modeling
• Optimising Problem Formulation for Cylindrical Algebraic Decomposition
• Computing cylindrical algebraic decomposition via triangular decomposition
• Solving Non-linear Arithmetic
• An effective implementation of a symbolic-numeric cylindrical algebraic decomposition for quantifier elimination
• Cylindrical algebraic decompositions for boolean combinations
• Efficient projection orders for CAD
• QEPCAD B
• A repository for CAD examples
• Cylindrical Algebraic Decomposition I: The Basic Algorithm
• Solving polynomial systems over semialgebraic sets represented by cylindrical algebraic formulas
• A logical calculus of the ideas immanent in nervous activity
• Improved projection for cylindrical algebraic decomposition