10 citations · 18 across the 3 of their papers we have counts for
4 papers
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…
Supporting Proving and Discovering Geometric Inequalities in GeoGebra by using Tarski
Christopher W. Brown, Zoltán Kovács, Róbert Vajda
We introduce a system of software tools that can automatically prove or discover geometric inequalities. The system, called GeoGebra Discovery, consisting of an extended version of…
Model-based construction of Open Non-uniform Cylindrical Algebraic Decompositions
Christopher W. Brown
In this paper we introduce the notion of an Open Non-uniform Cylindrical Algebraic Decomposition (NuCAD), and present an efficient model-based algorithm for constructing an Open Nu…