The cylindrical algebraic covering method was originally proposed to decide the satisfiability of a set of non-linear real arithmetic constraints. We reformulate and extend the cylindrical algebraic covering method to allow for checking the truth of arbitrary non-linear arithmetic formulas, adding support for both quantifiers and Boolean structure. Furthermore, we also propose a variant to perform quantifier elimination on such formulas. After introducing the algorithm, we elaborate on various extensions, optimizations and heuristics. Finally, we present an experimental evaluation of our implementation and provide a comparison with state-of-the-art SMT solvers and quantifier elimination tools.
Extensions of the Cylindrical Algebraic Covering Method for Quantifiers. // Bulletin of Materials Science. – 2026. – DOI: 10.1007/s11786-025-00623-3. – URL: https://link.springer.com/article/10.1007/s11786-025-00623-3
(2026). Extensions of the Cylindrical Algebraic Covering Method for Quantifiers. Bulletin of Materials Science. https://doi.org/10.1007/s11786-025-00623-3
“Extensions of the Cylindrical Algebraic Covering Method for Quantifiers.” Bulletin of Materials Science, 2026. doi:10.1007/s11786-025-00623-3.
@article{article34442,
title = {Extensions of the Cylindrical Algebraic Covering Method for Quantifiers},
journal = {Bulletin of Materials Science},
year = {2026},
doi = {10.1007/s11786-025-00623-3},
url = {https://link.springer.com/article/10.1007/s11786-025-00623-3}
}
A multivariate polynomial $f$ is decomposable if $f$ is a composition $f=u\circ h$, where $u$ is a univariate polynomial of degree greater than one and $h$ is a multivariate polynomial. We consider the problem of computing the nearest...
Cancer is a major cause of mortality, yet the mechanisms governing its growth, progression, and elimination remain incompletely understood. Mathematical modeling not only clarifies these complex processes but also provides clinicians...
Residue number systems based on pairwise relatively prime moduli are a powerful tool for accelerating integer computations via the Chinese Remainder Theorem. We study a structured family of moduli of the form $2^{n} - 2^{k} + 1$,...
This work is devoted to the symbolic computation of centralizers of ordinary differential operators (ODOs), in the ring of differential operators. Starting with an operator $L$ of order $n$ and the order $\mathfrak{m}$ of a non-trivial...
In this work, we address the problem of expressing sequences of $d$-orthogonal polynomials in terms of either orthogonal polynomials or the canonical basis. We derive a general recurrence relation that enables the symbolic recursive...