In:
ACM SIGSAM Bulletin, Association for Computing Machinery (ACM), Vol. 38, No. 1 ( 2004-03), p. 23-24
Abstract:
QEPCAD B 2 is a system for computing with semi-algebraic sets. a semi-algebraic set is a subset of ℝ n that can be defined as the set of points satisfying a boolean formula combining polynomial equalities and inequalities in the variables x 1 ,..., x n . So, for example, the upper-right quadrant of the unit disk is a semi-algebraic set, since it has the defining formula[see pdf for formula]Many important problems in mathematics, science and engineering boil down to questions about semi-algebraic sets. QEPCAD B allows its users to compute with semi-algebraic sets specified by defining formulae. Computation is exact and symbolic, results being returned in the same language of defining formulae. The basic operations the system supports are formula simplification and quantifier elimination Quantifier Elimination: Adding quantifiers to a defining formula is, in a sense, asking a question. For example, ∃ x [ x 2 + bx + c =0] is the question "when does x 2 + bx + c have a real root?" The well-known answer "when b 2 −4 c ≥0" is an equivalent formula from which the quantified variable has been eliminated. Quantifier elimination algorithms, which produce such equivalent formulae, can be seen as providing "answers" to "questions" about semi-algebraic sets. Formula Simplification: Many procedures in mathematics, performed both manually and mechanically, produce "answers" in the form of defining formulae. These defining formulae are often not particularly nice characterizations of the sets they define--hence the need for formula simplification. For example, QEPCAD B determines that the formula F :=1+ b 2 − c 2 ≥ b ∧− c ( b 2 − c 2 ) 3 +3 b 2 c ( b 2 − c 2 )∨ b 2 − c 2 〈 b under the assumption b 〉 0 ∧ c 〉 0 ∧ 1 〈 b + c ∧ b 〈 1 + c ∧ c 〈 1 = b is equivalent to F ′ := c 2 − bc − 1 〉 0. Obviously, F ′ was a considerably better characterization for subsequent computations in the application from which this arose. Cylindrical Algebraic Decomposition (CAD): A CAD is essentially a data-structure providing an explicit representation of a semi-algebraic set. This representation is expensive to compute, but it contains so much information about the set it represents that quantifier elimination and simplification are easily accomplished, which is why CAD is the basis for these operations in QEPCAD B. A little insight into what CAD is and how it is used is provided by the following figures, produced by QEPCAD B, which show the CAD representation for the formula F from the simplification example, followed by the CAD representing F restricted by the given assumptions, followed by the simplified CAD representation of the same set, which is what was used to provide the simplified output formula F ′.This exhibit focuses on using QEPCAD B as a problem-solving tool. Examples trace problems from the application areas from which they arise, through the initial formulation of quantifier elimination or formula simplification problems, through refining problem formulations to take advantage of QEPCAD B's strengths and avoid its weaknesses. Limitations of the system and tradeoffs versus other tools are also discussed.
Type of Medium:
Online Resource
ISSN:
0163-5824
DOI:
10.1145/980175.980185
Language:
English
Publisher:
Association for Computing Machinery (ACM)
Publication Date:
2004
detail.hit.zdb_id:
2478700-0
detail.hit.zdb_id:
243811-2
Permalink
