A Poly-algorithmic Quantifier Elimination Package in Maple

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The problem of Quantifier Elimination (QE) in Computer Algebra is that of eliminating all quantifiers from a statement featuring polynomial constraints. This problem is known to be worst case time complexity worst case doubly exponential in the number of variables. As such implementations are sometimes seen as undesirable to use, despite problems arising in algebraic geometry and even economics lending themselves to formulations as QE problems. This paper largely concerns discussion of current progress of a package QuantifierElimination written using Maple that uses a poly-algorithm between two well known algorithms to solve QE: Virtual Term Substitution (VTS), and Cylindrical Algebraic Decomposition (CAD). While mitigation of efficiency concerns is the main aim of the implementation, said implementation being built in Maple reconciles with an aim of providing rich output to users to make use of algorithms to solve QE valuable. We explore the challenges and scope such an implementation gives in terms of the desires of the Satisfiability Modulo Theory (SMT) community, and other frequent uses of QE, noting Maple’s status as a Mathematical toolbox.
Original languageEnglish
Title of host publicationMaple in Mathematics Education and Research
PublisherSpringer International Publishing
Pages171-186
DOIs
Publication statusPublished - 28 Feb 2020

Keywords

  • Quantifer Elimination
  • Virtual Term Substitution
  • Cylindrical Algebraic Decomposition

Cite this