Using the Regular Chains Library to Build Cylindrical Algebraic Decompositions by Projecting and Lifting

@inproceedings{England2014UsingTR,
  title={Using the Regular Chains Library to Build Cylindrical Algebraic Decompositions by Projecting and Lifting},
  author={Matthew England and David J. Wilson and Russell J. Bradford and James H. Davenport},
  booktitle={ICMS},
  year={2014}
}
Cylindrical algebraic decomposition (CAD) is an important tool, both for quantifier elimination over the reals and a range of other applications. Traditionally, a CAD is built through a process of projection and lifting to move the problem within Euclidean spaces of changing dimension. Recently, an alternative approach which first decomposes complex space using triangular decomposition before refining to real space has been introduced and implemented within the RegularChains Library of Maple… 
Truth Table Invariant Cylindrical Algebraic Decomposition by Regular Chains
A new algorithm to compute cylindrical algebraic decompositions (CADs) is presented, building on two recent advances. Firstly, the output is truth table invariant (a TTICAD) meaning given formulae
Towards Incremental Cylindrical Algebraic Decomposition in Maple
TLDR
A proof of concept implementation of an Incremental CAD algorithm in Maple, where CADs are built and then refined as additional polynomial constraints are added to make CAD suitable for use as a theory solver for SMT tools who search for solutions by continually reformulating logical formula and querying whether a logical solution is admissible.
An implementation of Sub-CAD in Maple
TLDR
This report reports on new functionality: the ability to build cylindrical algebraic sub-decompositions (sub-CADs) where only certain cells are returned, and implemented algorithms to return cells of a prescribed dimensions or higher and an algorithm to return only those cells on which given poly-nomials are zero.
Improving the Use of Equational Constraints in Cylindrical Algebraic Decomposition
TLDR
This paper improves on the approach of McCallum in ISSAC 2001 by using the reduced projection theory to make savings in the lifting phase (both to the polynomials the authors lift with and the cells lifted over).
Summer Research Report: Towards Incremental Lazard Cylindrical Algebraic Decomposition
TLDR
A proof of concept implementation of an Incremental CAD algorithm in Maple, where CADs are built and refined incrementally by polynomial constraint, in contrast to the usual approach of a single computation from a single input.
The Complexity of Cylindrical Algebraic Decomposition with Respect to Polynomial Degree
Cylindrical algebraic decomposition (CAD) is an important tool for working with polynomial systems, particularly quantifier elimination. However, it has complexity doubly exponential in the number of
Advances in cylindrical algebraic decomposition
TLDR
A prototype software CADassistant is described to help users take advantage of the advances without knowledge of the underlying theory, to improve the practical efficiency of CAD for a variety of problems.
A Poly-algorithmic Quantifier Elimination Package in Maple
TLDR
The challenges and scope such an implementation of QuantifierElimination written in Maple gives in terms of the desires of the Satisfiability Modulo Theory (SMT) community, and other frequent uses of QE are explored, noting Maple’s status as a Mathematical toolbox.
...
...

References

SHOWING 1-10 OF 28 REFERENCES
Truth Table Invariant Cylindrical Algebraic Decomposition by Regular Chains
A new algorithm to compute cylindrical algebraic decompositions (CADs) is presented, building on two recent advances. Firstly, the output is truth table invariant (a TTICAD) meaning given formulae
Cylindrical Algebraic Sub-Decompositions
TLDR
This paper introduces cylindrical algebraic sub-decompositions (sub-CADs), which are subsets of CADs containing all the information needed to specify a solution for a given problem.
Problem Formulation for Truth-Table Invariant Cylindrical Algebraic Decomposition by Incremental Triangular Decomposition
TLDR
This work considers how best to formulate problems for input to a new CAD algorithm combining truth-table invariance and CAD construction by regular chains technology, and develops new heuristics to help make this choice and thus allow the best use of the algorithm in practice.
Cylindrical algebraic decompositions for boolean combinations
TLDR
This article generalises the theory of equational constraints to design an algorithm which will efficiently construct a TTICAD for a wide class of problems, producing stronger results than when using equational constraint alone.
An implementation of CAD in Maple utilising McCallum projection
TLDR
The implementation described here is of interest as the only full implementation of CADW, (since Qepcad does not currently make use of McCallum’s delineating polynomials), and hence can solve problems not admissible to other CAD implementations.
Truth table invariant cylindrical algebraic decomposition
Real Root Isolation of Regular Chains
TLDR
An algorithm RealRootIsolate for isolating the real roots of a polynomial system given by a zerodimensional squarefree regular chain is presented, a generalization, for regular chains, of the algorithm proposed by Collins and Akritas.
The complexity of quantifier elimination and cylindrical algebraic decomposition
TLDR
A simple and constructive proof that quantifier elimination in real algebra is doubly exponential, even when there is only one free variable and all polynomials in the quantified input are linear is given.
An implementation of CAD in Maple utilising problem formulation, equational constraints and truth-table invariance
TLDR
This report describes how the CADs produced using equational constraints are able to take advantage of not just improved projection but also improvements in the lifting phase, and presents an extension to the original TTICAD algorithm which increases both the applicability of TTICad and its relative benefit over other algorithms.
The McCallum Projection, Lifting, and Order-Invariance
TLDR
Easy computable criteria are given that often allow us to conclude that McCallum's projection is valid even though a projection factor vanishes identically over a cell, and the ideas contained in this paper are incorporated into QEPCAD, the most complete implementation of CAD.
...
...