Cylindrical Algebraic Decompositions for Boolean Combinations
Abstract
This article makes the key observation that when using cylindrical algebraic decomposition (CAD) to solve a problem with respect to a set of polynomials, it is not always the signs of those polynomials that are of paramount importance but rather the truth values of certain quantifier free formulae involving them. This motivates our definition of a Truth Table Invariant CAD (TTICAD). We generalise 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 constraints alone. The algorithm is implemented fully in Maple and we present promising results from experimentation.
Cite
@article{arxiv.1304.7603,
title = {Cylindrical Algebraic Decompositions for Boolean Combinations},
author = {Russell Bradford and James H. Davenport and Matthew England and Scott McCallum and David Wilson},
journal= {arXiv preprint arXiv:1304.7603},
year = {2013}
}
Comments
To appear in the proceedings of the 38th International Symposium on Symbolic and Algebraic Computation (ISSAC '13)