We present a new algorithm for determining the satisfiability of conjunctions of non-linear
polynomial constraints over the reals, which can be used as a theory solver for satisfiability …

Abstract Cylindrical Algebraic Decomposition (CAD) is one of the pillar algorithms of
symbolic computation, and its worst-case complexity is double exponential to the number of …

Abstract Cylindrical Algebraic Decomposition (CAD) has long been one of the most
important algorithms within Symbolic Computation, as a tool to perform quantifier elimination …

Satisfiability modulo theories (SMT) solvers check the satisfiability of quantifier-free first-
order logic formulae over different theories. We consider the theory of non-linear real …

Abstract Symbolic Computation and Satisfiability Checking are two research areas, both
having their individual scientific focus but sharing also common interests in the …

Collins introduced the cylindrical algebraic decomposition method for eliminating quantifiers
in real arithmetic formulas. In our work we use this method for satisfiability checking in …

This extended abstract accompanies an invited talk at CASC 2024, which surveys recent
developments in Real Quantifier Elimination (QE) and Cylindrical Algebraic Decomposition …

There has been recent interest in the use of machine learning (ML) approaches within
mathematical software to make choices that impact on the computing performance without …

Cylindrical algebraic decomposition (CAD) plays an important role in the field of real
algebraic geometry and many other areas. As is well-known, the choice of variable ordering …

We consider a problem from biological network analysis of determining regions in a
parameter space over which there are multiple steady states for positive real values of …