Exploiting Strict Constraints in the Cylindrical Algebraic Covering

arXiv (Cornell University)

Abstract

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 strictness of input constraints for reducing the computational effort. We illustrate the concepts on a multidimensional example and provide experimental results to evaluate the usefulness of our proposed extension.

Authors 4

1. Philipp Bär Aachen

   RWTH Aachen University

   Affiliation as printed

   RWTH Aachen

2. Jasper Nalbach Aachen

   RWTH Aachen University

   Affiliation as printed

   RWTH Aachen

3. Erika Ábrahám Aachen

   RWTH Aachen University

   Affiliation as printed

   RWTH Aachen

4. Christopher W. Brown