Projects per year
Abstract
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 language  English 

Title of host publication  Computer Algebra in Scientific Computing 
Subtitle of host publication  Proceedings of the16th International Workshop, CASC 2014, Warsaw, Poland, September 812, 2014 
Editors  V. P. Gerdt, W. Koepf, W. M. Seiler, E. V. Vorozhtsov 
Publisher  Springer 
Pages  4458 
Number of pages  15 
Volume  8660 
ISBN (Print)  9783319105147 
DOIs  
Publication status  Published  2014 
Publication series
Name  Lecture Notes in Computer Science 

Publisher  Springer 
Keywords
 cylindrical algebraic decomposition
 equational constraint
 regular chains
 triangular decomposition
Fingerprint
Dive into the research topics of 'Truth table invariant cylindrical algebraic decomposition by regular chains'. Together they form a unique fingerprint.Projects
 1 Finished

Real Geometry and Connectedness via Triangular Description
Davenport, J. (PI), Bradford, R. (CoI), England, M. (CoI) & Wilson, D. (CoI)
Engineering and Physical Sciences Research Council
1/10/11 → 31/12/15
Project: Research council
Profiles

Russell Bradford
 Department of Computer Science  Senior Lecturer
 Mathematical Foundations of Computation
Person: Research & Teaching