Abstract
Collins [4] observed that quantifier elimination problems often have equational constraints, and he asserted that such constraints can be used to reduce the projection sets required for cylindrical algebraic decomposition (cad) based quantifier elimination. This paper provides a detailed partial validity proof for the restricted equational projection method outlined by Collins [4]. The proof is sufficient to validate the use of the method for the first projection of the projection phase. 4 further consequence is that the method can be used for both the first and second projections in the case of a trivariate quantifier elimination problem having sufficient equational constraints.
Original language | English |
---|---|
Title of host publication | ISSAC 99: PROCEEDINGS OF THE 1999 INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND ALGEBRAIC COMPUTATION |
Editors | S Dooley |
Place of Publication | New York, NY |
Publisher | ASSOC COMPUTING MACHINERY |
Pages | 145-149 |
Number of pages | 5 |
ISBN (Print) | 1581130732 |
DOIs | |
Publication status | Published - 1999 |
Event | International Symposium on Symbolic and Algebraic Computation - VANCOUVER, Canada Duration: 29 Jul 1999 → 31 Jul 1999 |
Conference
Conference | International Symposium on Symbolic and Algebraic Computation |
---|---|
Country/Territory | Canada |
City | VANCOUVER |
Period | 29/07/99 → 31/07/99 |
Keywords
- CYLINDRICAL ALGEBRAIC DECOMPOSITION