  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.
