The Geometry of Cylindrical Algebraic Decomposition
The decision problem of the first order theory over the reals is a fundamental problem in symbolic computation. Because many problems emerging from other areas of science and engineering can be directly expressed by a decision problem over the reals, there are more and more interests in developing efficient algorithms for the decision problem. For example, the non-linear real arithmetic (NRA) theory in satisfiability modulo theories (SMT) is a special case of the real decision problem, where all variables are existentially quantified. And there are applications in Robotics, Biology and Economics. More and more new applications are discovered all the time. Besides, the real decision problem is related to many different branches of mathematics, such as logic, geometry, algebra and computation. Therefore, the decision problem over the reals is interesting to both the mathematics community and researchers from other science areas.
Authors
- Rizeng Chen (ORCID: https://orcid.org/0009-0001-5985-5359)
Institutions
- King University (US)
- Peking University (CN)
Publication Details
- Journal
- ACM communications in computer algebra
- Published
- 2024-09-01
- DOI
- https://doi.org/10.1145/3717582.3717586
- Primary Topic
- Polynomial and algebraic computation
- Type
- article
- Field-Weighted Citation Impact
- 0.00