Applying machine learning to heuristics for real polynomial constraint solving
From MaRDI portal
Recommendations
- Applying machine learning to the problem of choosing a heuristic to select the variable ordering for cylindrical algebraic decomposition
- Using machine learning to improve cylindrical algebraic decomposition
- Advances in Artificial Intelligence – SBIA 2004
- A Machine Learning Based Software Pipeline to Pick the Variable Ordering for Algorithms with Polynomial Inputs
- Machine learning for first-order theorem proving
Cites work
- 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
- Efficient subformula orders for real quantifier elimination of non-prenex formulas
- From simplification to a partial theory solver for non-linear real polynomial constraints
- Open non-uniform cylindrical algebraic decompositions
- Polynomial constraints and unsat cores in \textsc{Tarski}
Cited in
(8)- New heuristic to choose a cylindrical algebraic decomposition variable ordering motivated by complexity analysis
- A machine learning method to reveal closed sets of common features of objects using constraint programming
- scientific article; zbMATH DE number 1453041 (Why is no real title available?)
- A Machine Learning Based Software Pipeline to Pick the Variable Ordering for Algorithms with Polynomial Inputs
- Advances in Artificial Intelligence – SBIA 2004
- Levelwise construction of a single cylindrical algebraic cell
- Lessons on datasets and paradigms in machine learning for symbolic computation: a case study on CAD
- A dataset for suggesting variable orderings for cylindrical algebraic decompositions
This page was built for publication: Applying machine learning to heuristics for real polynomial constraint solving
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5041067)