10 citations · 11 across the 6 of their papers we have counts for
8 papers
More is Less: Adding Polynomials for Faster Explanations in NLSAT
Valentin Promies, Jasper Nalbach, Erika Ábrahám +1
To check the satisfiability of (non-linear) real arithmetic formulas, modern satisfiability modulo theories (SMT) solving algorithms like NLSAT depend heavily on single cell constr…
Projective Delineability for Single Cell Construction
Jasper Nalbach, Lucas Michel, Erika Ábrahám +5
The cylindrical algebraic decomposition (CAD) is the only complete method used in practice for solving problems like quantifier elimination or SMT solving related to real algebra,…
A Variant of Non-uniform Cylindrical Algebraic Decomposition for Real Quantifier Elimination
Jasper Nalbach, Erika Ábrahám
The Cylindrical Algebraic Decomposition (CAD) method is currently the only complete algorithm used in practice for solving real-algebraic problems. To ameliorate its doubly-exponen…
On Projective Delineability
Lucas Michel, Jasper Nalbach, Pierre Mathonet +5
We consider cylindrical algebraic decomposition (CAD) and the key concept of delineability which underpins CAD theory. We introduce the novel concept of projective delineability wh…
Extensions of the Cylindrical Algebraic Covering Method for Quantifiers
Jasper Nalbach, Gereon Kremer
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 cyl…
FMplex: Exploring a Bridge between Fourier-Motzkin and Simplex
Valentin Promies, Jasper Nalbach, Erika Ábrahám +1
In this paper we present a quantifier elimination method for conjunctions of linear real arithmetic constraints. Our algorithm is based on the Fourier-Motzkin variable elimination…
Exploiting Strict Constraints in the Cylindrical Algebraic Covering
Philipp Bär, Jasper Nalbach, Erika Ábrahám +1
One of the few available complete methods for checking the satisfiability of sets of polynomial constraints over the reals is the cylindrical algebraic covering (CAlC) method. In t…
Levelwise construction of a single cylindrical algebraic cell
Jasper Nalbach, Erika Ábrahám, Philippe Specht +3
Satisfiability Modulo Theories (SMT) solvers check the satisfiability of quantifier-free first-order logic formulas. We consider the theory of non-linear real arithmetic where the…