Truth table invariant cylindrical algebraic decomposition by regular chains

Russell Bradford, Changbo Chen, James H. Davenport, Matthew England, Marc Moreno Maza, David Wilson

Research output: Chapter or section in a book/report/conference proceedingChapter or section

21 Citations (SciVal)
366 Downloads (Pure)


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 have constant truth value on each cell of the decomposition. Secondly, the computation uses regular chains theory to first build a cylindrical decomposition of complex space (CCD) incrementally by polynomial. Significant modification of the regular chains technology was used to achieve the more sophisticated invariance criteria. Experimental results on an implementation in the RegularChains Library for Maple verify that combining these advances gives an algorithm superior to its individual components and competitive with the state of the art.
Original languageEnglish
Title of host publicationComputer Algebra in Scientific Computing
Subtitle of host publicationProceedings of the16th International Workshop, CASC 2014, Warsaw, Poland, September 8-12, 2014
EditorsV. P. Gerdt, W. Koepf, W. M. Seiler, E. V. Vorozhtsov
Number of pages15
ISBN (Print)9783319105147
Publication statusPublished - 2014

Publication series

NameLecture Notes in Computer Science


  • cylindrical algebraic decomposition
  • equational constraint
  • regular chains
  • triangular decomposition


Dive into the research topics of 'Truth table invariant cylindrical algebraic decomposition by regular chains'. Together they form a unique fingerprint.

Cite this