Výsledky vyhledávání - "Brown, Christopher W"

Report

Semantics of Division for Polynomial Solvers

Autor: Brown, Christopher W.

How to handle division in systems that compute with logical formulas involving what would otherwise be polynomial constraints over the real numbers is a surprisingly difficult question. This paper argues that existing approaches from both the compute

Externí odkaz: http://arxiv.org/abs/2412.00963

Zobrazit plný text záznamu

Report

On Projective Delineability

Autor: Michel, Lucas, Nalbach, Jasper, Mathonet, Pierre, Zénaïdi, Naïm, Brown, Christopher W., Ábrahám, Erika, Davenport, James H., England, Matthew

We consider cylindrical algebraic decomposition (CAD) and the key concept of delineability which underpins CAD theory. We introduce the novel concept of projective delineability which is easier to guarantee computationally. We prove results about thi

Externí odkaz: http://arxiv.org/abs/2411.13300

Zobrazit plný text záznamu

Report

Exploiting Strict Constraints in the Cylindrical Algebraic Covering

Autor: Bär, Philipp, Nalbach, Jasper, Ábrahám, Erika, Brown, Christopher W.

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 this paper, we propose an extension for this method to exploit the stri

Externí odkaz: http://arxiv.org/abs/2306.16757

Zobrazit plný text záznamu

Report

Levelwise construction of a single cylindrical algebraic cell

Autor: Nalbach, Jasper, Ábrahám, Erika, Specht, Philippe, Brown, Christopher W., Davenport, James H., England, Matthew

Publikováno v: Journal of Symbolic Computation, Volume 123, Article Number 102288. Elsevier, 2024

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 formulae are logical combinations of polynomial constraints. Here a co

Externí odkaz: http://arxiv.org/abs/2212.09309

Zobrazit plný text záznamu

Report

Supporting Proving and Discovering Geometric Inequalities in GeoGebra by using Tarski

Autor: Brown, Christopher W., Kovács, Zoltán, Vajda, Róbert

Publikováno v: EPTCS 352, 2021, pp. 156-166

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 GeoGebra, a controller web service realgeom, and the computational to

Externí odkaz: http://arxiv.org/abs/2201.00544

Zobrazit plný text záznamu