Efficient subformula orders for real quantifier elimination of non-prenex formulas

DOI10.1007/978-3-319-32859-1_21zbMATH Open1460.68086OpenAlexW2467888180MaRDI QIDQ2807841FDOQ2807841

Authors: Munehiro Kobayashi, Hidenao Iwane, Takuya Matsuzaki, Hirokazu Anai 

Publication date: 25 May 2016

Published in: Mathematical Aspects of Computer and Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-32859-1_21

Recommendations

• Efficient Preprocessing Methods for Quantifier Elimination
• scientific article; zbMATH DE number 1302474
• scientific article; zbMATH DE number 1263423
• Quantifier elimination for real algebra -- the quadratic case and beyond
• Simplification of quantifier-free formulae over ordered fields

zbMATH Keywords

support vector machinereal quantifier eliminationnon-prenex formulas

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Quantifier elimination, model completeness, and related topics (03C10)

Cited In (6)

• Using machine learning to improve cylindrical algebraic decomposition
• Explainable AI insights for symbolic computation: a case study on selecting the variable ordering for cylindrical algebraic decomposition
• Efficient Preprocessing Methods for Quantifier Elimination
• Can an A.I. win a medal in the mathematical olympiad? – Benchmarking mechanized mathematics on pre-university problems1
• Applying Machine Learning to Heuristics for Real Polynomial Constraint Solving
• Improved Cross-Validation for Classifiers that Make Algorithmic Choices to Minimise Runtime Without Compromising Output Correctness

This page was built for publication: Efficient subformula orders for real quantifier elimination of non-prenex formulas

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