Recent Developments in Real Quantifier Elimination and Cylindrical Algebraic Decomposition
<|reference_start|>Recent Developments in Real Quantifier Elimination and Cylindrical Algebraic Decomposition: This extended abstract accompanies an invited talk at CASC 2024, which surveys recent developments in Real Quantifier Elimination (QE) and Cylindrical Algebraic Decomposition (CAD). After introducing these concepts we will first consider adaptations of CAD inspired by computational logic, in particular the algorithms which underpin modern SAT solvers. CAD theory has found use in collaboration with these via the Satisfiability Modulo Theory (SMT) paradigm; while the ideas behind SAT/SMT have led to new algorithms for Real QE. Second we will consider the optimisation of CAD through the use of Machine Learning (ML). The choice of CAD variable ordering has become a key case study for the use of ML to tune algorithms in computer algebra. We will also consider how explainable AI techniques might give insight for improved computer algebra software without any reliance on ML in the final code.<|reference_end|>
@article{england2024recent,
    title={Recent Developments in Real Quantifier Elimination and Cylindrical
  Algebraic Decomposition},
    author={Matthew England},
    journal={F. Boulier, C. Mou, T.M. Sadykov, and E.V. Vorozhtsov, eds.
  Computer Algebra in Scientific Computing (Proc. CASC '24), pp. 1-10. (Lecture
  Notes in Computer Science, vol 14938). Springer International, 2024},
    year={2024},
    doi={10.1007/978-3-031-69070-9_1},
    archivePrefix={arXiv},
    eprint={2407.19781},
    primaryClass={cs.SC}
}