#### Filter Results:

- Full text PDF available (37)

#### Publication Year

1997

2017

- This year (4)
- Last 5 years (41)
- Last 10 years (43)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

#### Method

Learn More

- Russell J. Bradford, James H. Davenport, Matthew England, David J. Wilson
- MKM/Calculemus/DML
- 2013

Cylindrical algebraic decomposition (CAD) is an important tool for the study of real algebraic geometry with many applications both within mathematics and elsewhere. It is known to have doubly exponential complexity in the number of variables in the worst case, but the actual computation time can vary greatly. It is possible to offer different formulations… (More)

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… (More)

- Erika Ábrahám, John Abbott, +12 authors Thomas Sturm
- CICM
- 2016

Symbolic Computation and Satisfiability Checking are two research areas, both having their individual scientific focus but sharing also common interests in the development, implementation and application of decision procedures for arithmetic theories. Despite their commonalities, the two communities are rather weakly connected. The aim of our newly accepted… (More)

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… (More)

- James H. Davenport, Russell J. Bradford, Matthew England, David J. Wilson
- 2012 14th International Symposium on Symbolic and…
- 2012

In considering the reliability of numerical programs, it is normal to ``limit our study to the semantics dealing with numerical precision'' (Martel, 2005). On the other hand, there is a great deal of work on the reliability of programs that essentially ignores the numerics. The thesis of this paper is that there is a class of problems that fall between… (More)

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… (More)

- David J. Wilson, Russell J. Bradford, James H. Davenport, Matthew England
- Mathematics in Computer Science
- 2014

Cylindrical Algebraic Decompositions (CADs) have been studied since their creation as a tool for working with semi-algebraic sets and eliminating quantifiers of the reals. In this paper we are concerned with Cylindrical Algebraic Sub-Decompositions (sub-CADs), defined as subsets of CADs sufficient to describe the solutions for given formulae. We discuss… (More)

- Matthew England
- ArXiv
- 2013

Cylindrical algebraic decomposition (CAD) is an important tool for the investigation of semi-algebraic sets, with applications within algebraic geometry and beyond. We recently reported on a new implementation of CAD in Maple which implemented the original algorithm of Collins and the subsequent improvement to projection by McCallum. Our implementation was… (More)

- Matthew England
- ArXiv
- 2013

Cylindrical algebraic decomposition (CAD) is an important tool for the investigation of semialgebraic sets. Originally introduced by Collins in the 1970s for use in quantifier elimination it has since found numerous applications within algebraic geometry and beyond. Following from his original work in 1988, McCallum presented an improved algorithm, CADW,… (More)