| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 401327 | Journal of Symbolic Computation | 2016 | 20 Pages |
Abstract
A quantifier elimination algorithm by cylindrical algebraic decomposition based on regular chains is presented. The main idea is to refine a complex cylindrical tree until the signs of polynomials appearing in the tree are sufficient to distinguish the true and false cells. We report an implementation of our algorithm in the RegularChains library in Maple and illustrate its effectiveness by examples.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Changbo Chen, Marc Moreno Maza,