Abstract
Cylindrical algebraic decomposition (CAD) is a core algorithm within Symbolic Computation, particularly for quantifier elimination over the reals and polynomial systems solving more generally. It is now finding increased application as a decision procedure for Satisfiability Modulo Theories (SMT) solvers when working with non-linear real arithmetic. We discuss the potentials from increased focus on the logical structure of the input brought by the SMT applications and SC-Square project, particularly the presence of equational constraints. We also highlight the challenges for exploiting these: primitivity restrictions, well-orientedness questions, and the prospect of incrementality.
Original language | English |
---|---|
Title of host publication | Mathematical Aspects of Computer and Information Sciences (Proc. MACIS '17) |
Subtitle of host publication | MACIS 2017 |
Publisher | Springer |
Pages | 280-285 |
Number of pages | 6 |
Volume | LNCS 10693 |
ISBN (Electronic) | 978-3-319-72453-9 |
ISBN (Print) | 978-3-319-72452-2 |
DOIs | |
Publication status | Published - 21 Dec 2017 |
Event | 7th International Conference on Mathematical Aspects of Computer and Information Sciences - Vienna, Austria Duration: 15 Nov 2017 → 17 Nov 2017 Conference number: 7 https://macis2017.sba-research.org/ |
Publication series
Name | Lecture Notes in Computer Science (LNCS) |
---|---|
Publisher | Springer |
Conference
Conference | 7th International Conference on Mathematical Aspects of Computer and Information Sciences |
---|---|
Abbreviated title | MACIS 2017 |
Country/Territory | Austria |
City | Vienna |
Period | 15/11/17 → 17/11/17 |
Internet address |