A Variant of Non-uniform Cylindrical Algebraic Decomposition for Real Quantifier Elimination

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Nalbach, Jasper, Ábrahám, Erika
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866909716163067904
author Nalbach, Jasper
Ábrahám, Erika
author_facet Nalbach, Jasper
Ábrahám, Erika
contents The Cylindrical Algebraic Decomposition (CAD) method is currently the only complete algorithm used in practice for solving real-algebraic problems. To ameliorate its doubly-exponential complexity, different exploration-guided adaptations try to avoid some of the computations. The first such adaptation named NLSAT was followed by Non-uniform CAD (NuCAD) and the Cylindrical Algebraic Covering (CAlC). Both NLSAT and CAlC have been developed and implemented in SMT solvers for satisfiability checking, and CAlC was recently also adapted for quantifier elimination. However, NuCAD was designed for quantifier elimination only, and no complete implementation existed before this work. In this paper, we present a novel variant of NuCAD for both real quantifier elimination and SMT solving, provide an implementation, and evaluate the method by experimentally comparing it to CAlC.
format Preprint
id arxiv_https___arxiv_org_abs_2508_00505
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle A Variant of Non-uniform Cylindrical Algebraic Decomposition for Real Quantifier Elimination
Nalbach, Jasper
Ábrahám, Erika
Symbolic Computation
The Cylindrical Algebraic Decomposition (CAD) method is currently the only complete algorithm used in practice for solving real-algebraic problems. To ameliorate its doubly-exponential complexity, different exploration-guided adaptations try to avoid some of the computations. The first such adaptation named NLSAT was followed by Non-uniform CAD (NuCAD) and the Cylindrical Algebraic Covering (CAlC). Both NLSAT and CAlC have been developed and implemented in SMT solvers for satisfiability checking, and CAlC was recently also adapted for quantifier elimination. However, NuCAD was designed for quantifier elimination only, and no complete implementation existed before this work. In this paper, we present a novel variant of NuCAD for both real quantifier elimination and SMT solving, provide an implementation, and evaluate the method by experimentally comparing it to CAlC.
title A Variant of Non-uniform Cylindrical Algebraic Decomposition for Real Quantifier Elimination
topic Symbolic Computation
url https://arxiv.org/abs/2508.00505