ABSTRACT
Cylindrical Algebraic Decomposition (CAD) is an established tool in the computer algebra community for computing with semi-algebraic sets / Tarski formulas. The key property of CAD is that it provides a representation in which geometric projection and set complement (the analogues of the logical operations of quantifier elimination and negation for Tarski formulas) are trivial. However, constructing a CAD often requires an impractical amount of time and space. Non-uniform CAD (NuCAD) was introduced with the goal of providing a more practically efficient alternative to CAD for computing with semi-algebraic sets / Tarski formulas. As a first step towards that goal, previous work has shown that Open NuCADs do provide a much more efficient representation than Open CADs. However, it hasn't been shown that the key operation of projection can be computed efficiently in the NuCAD representation, because while set complement is trivial for NuCADs, as it is for CADs, projection, in contrast to the CAD case, is not. This paper provides another step towards the larger goal by showing how projection can be done efficiently in the Open NuCAD representation. The importance of this contribution is not restricted to Open NuCADs, since the same approach to projection will carry over to the general case for NuCADs where, we hope, the practical benefits of the much smaller representation NuCAD provides will be even greater.
- Christopher W. Brown. Open non-uniform cylindrical algebraic decompositions. In Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC'15, pages 85--92, New York, NY, USA, 2015. ACM. Google ScholarDigital Library
- Christopher W. Brown and James H. Davenport. The complexity of quantifier elimination and cylindrical algebraic decomposition. In ISSAC'07: Proceedings of the 2007 international symposium on Symbolic and algebraic computation, pages 54--60, New York, NY, USA, 2007. ACM. Google ScholarDigital Library
- Dejan Jovanović and Leonardo de Moura. Solving Non-linear Arithmetic. In Bernhard Gramlich, Dale Miller, and Uli Sattler, editors, Automated Reasoning, volume 7364 of Lecture Notes in Computer Science, pages 339--354. Springer Berlin Heidelberg, 2012. Google ScholarDigital Library
- S. McCallum. Solving polynomial strict inequalities using cylindrical algebraic decomposition. The Computer Journal, 36(5):432--438, 1993.Google ScholarCross Ref
- A. Strzebonski. Solving systems of strict polynomial inequalities. Journal of Symbolic Computation, 29:471--480, 2000. Google ScholarDigital Library
- Adam Strzebonski. Cylindrical algebraic decomposition using local projections. ISSAC'14, pages 389--396, New York, NY, USA, 2014. ACM. Google ScholarDigital Library
Recommendations
On projection in CAD-based quantifier elimination with equational constraint
ISSAC '99: Proceedings of the 1999 international symposium on Symbolic and algebraic computationOpen Non-uniform Cylindrical Algebraic Decompositions
ISSAC '15: Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic ComputationThis paper introduces the notion of an Open Non-uniform Cylindrical Algebraic Decomposition (NuCAD), and presents an efficient model-based algorithm for constructing an Open NuCAD from an input formula. Using a limited experimental implementation of the ...
QEPCAD B: a program for computing with semi-algebraic sets using CADs
This report introduces QEPCAD, B, a program for computing with real algebraic sets using cylindrical algebraic decomposition (CAD). QEPCAD B both extends and improves upon the QEPCAD system for quantifier elimination by partial cylindrical algebraic ...
Comments