Truth table invariant cylindrical algebraic decomposition

Russell Bradford, James H. Davenport, Matthew England, Scott McCallum, David Wilson

Research output: Contribution to journalArticle

  • 13 Citations

Abstract

When using cylindrical algebraic decomposition (CAD) to solve a problem with respect to a set of polynomials, it is likely not the signs of those polynomials that are of paramount importance but rather the truth values of certain quantifier free formulae involving them. This observation motivates our article and definition of a Truth Table Invariant CAD (TTICAD).

In ISSAC 2013 the current authors presented an algorithm that can efficiently and directly construct a TTICAD for a list of formulae in which each has an equational constraint. This was achieved by generalising McCallum's theory of reduced projection operators. In this paper we present an extended version of our theory which can be applied to an arbitrary list of formulae, achieving savings if at least one has an equational constraint. We then explain how the theory of reduced projection operators can allow for further improvements to the lifting phase of CAD algorithms, even in the context of a single equational constraint.

The algorithm is implemented fully in Maple and we present both promising results from experimentation and a complexity analysis showing the benefits of our new contributions.
LanguageEnglish
Pages1-35
JournalJournal of Symbolic Computation
Volume76
Early online date4 Nov 2015
DOIs
StatusPublished - Sep 2016

Fingerprint

Truth table
Projection Operator
Decomposition
Decompose
Invariant
Polynomials
Polynomial
Complexity Analysis
Maple
Decomposition Algorithm
Quantifiers
Experimentation
Computer aided design
Likely
Arbitrary

Keywords

  • cylindrical algebraic decomposition
  • equational constraint

Cite this

Truth table invariant cylindrical algebraic decomposition. / Bradford, Russell; Davenport, James H.; England, Matthew; McCallum, Scott; Wilson, David.

In: Journal of Symbolic Computation, Vol. 76, 09.2016, p. 1-35.

Research output: Contribution to journalArticle

Bradford, Russell ; Davenport, James H. ; England, Matthew ; McCallum, Scott ; Wilson, David. / Truth table invariant cylindrical algebraic decomposition. In: Journal of Symbolic Computation. 2016 ; Vol. 76. pp. 1-35.
@article{4960162419b14157b8878a76eb544c3c,
title = "Truth table invariant cylindrical algebraic decomposition",
abstract = "When using cylindrical algebraic decomposition (CAD) to solve a problem with respect to a set of polynomials, it is likely not the signs of those polynomials that are of paramount importance but rather the truth values of certain quantifier free formulae involving them. This observation motivates our article and definition of a Truth Table Invariant CAD (TTICAD).In ISSAC 2013 the current authors presented an algorithm that can efficiently and directly construct a TTICAD for a list of formulae in which each has an equational constraint. This was achieved by generalising McCallum's theory of reduced projection operators. In this paper we present an extended version of our theory which can be applied to an arbitrary list of formulae, achieving savings if at least one has an equational constraint. We then explain how the theory of reduced projection operators can allow for further improvements to the lifting phase of CAD algorithms, even in the context of a single equational constraint. The algorithm is implemented fully in Maple and we present both promising results from experimentation and a complexity analysis showing the benefits of our new contributions.",
keywords = "cylindrical algebraic decomposition, equational constraint",
author = "Russell Bradford and Davenport, {James H.} and Matthew England and Scott McCallum and David Wilson",
year = "2016",
month = "9",
doi = "10.1016/j.jsc.2015.11.002",
language = "English",
volume = "76",
pages = "1--35",
journal = "Journal of Symbolic Computation",
issn = "0747-7171",
publisher = "Academic Press",

}

TY - JOUR

T1 - Truth table invariant cylindrical algebraic decomposition

AU - Bradford, Russell

AU - Davenport, James H.

AU - England, Matthew

AU - McCallum, Scott

AU - Wilson, David

PY - 2016/9

Y1 - 2016/9

N2 - When using cylindrical algebraic decomposition (CAD) to solve a problem with respect to a set of polynomials, it is likely not the signs of those polynomials that are of paramount importance but rather the truth values of certain quantifier free formulae involving them. This observation motivates our article and definition of a Truth Table Invariant CAD (TTICAD).In ISSAC 2013 the current authors presented an algorithm that can efficiently and directly construct a TTICAD for a list of formulae in which each has an equational constraint. This was achieved by generalising McCallum's theory of reduced projection operators. In this paper we present an extended version of our theory which can be applied to an arbitrary list of formulae, achieving savings if at least one has an equational constraint. We then explain how the theory of reduced projection operators can allow for further improvements to the lifting phase of CAD algorithms, even in the context of a single equational constraint. The algorithm is implemented fully in Maple and we present both promising results from experimentation and a complexity analysis showing the benefits of our new contributions.

AB - When using cylindrical algebraic decomposition (CAD) to solve a problem with respect to a set of polynomials, it is likely not the signs of those polynomials that are of paramount importance but rather the truth values of certain quantifier free formulae involving them. This observation motivates our article and definition of a Truth Table Invariant CAD (TTICAD).In ISSAC 2013 the current authors presented an algorithm that can efficiently and directly construct a TTICAD for a list of formulae in which each has an equational constraint. This was achieved by generalising McCallum's theory of reduced projection operators. In this paper we present an extended version of our theory which can be applied to an arbitrary list of formulae, achieving savings if at least one has an equational constraint. We then explain how the theory of reduced projection operators can allow for further improvements to the lifting phase of CAD algorithms, even in the context of a single equational constraint. The algorithm is implemented fully in Maple and we present both promising results from experimentation and a complexity analysis showing the benefits of our new contributions.

KW - cylindrical algebraic decomposition

KW - equational constraint

UR - http://dx.doi.org/10.1016/j.jsc.2015.11.002

UR - http://dx.doi.org/10.1016/j.jsc.2015.11.002

U2 - 10.1016/j.jsc.2015.11.002

DO - 10.1016/j.jsc.2015.11.002

M3 - Article

VL - 76

SP - 1

EP - 35

JO - Journal of Symbolic Computation

T2 - Journal of Symbolic Computation

JF - Journal of Symbolic Computation

SN - 0747-7171

ER -