Guarded expressions in practice:

Abstract: "Computer algebra systems typically drop some degenerate cases when evaluating expressions, e.g., x/x becomes 1 dropping the case x=0. We claim that it is feasible in practice to compute also the degenerate cases yielding guarded expressions. We work over real closed fields but our id...

Full description

Saved in:
Bibliographic Details
Main Authors: Dolzmann, Andreas (Author), Sturm, Thomas (Author)
Format: Book
Language:English
Published: Passau 1997
Series:Universität <Passau> / Fakultät für Mathematik und Informatik: MIP 1997,02
Subjects:
Summary:Abstract: "Computer algebra systems typically drop some degenerate cases when evaluating expressions, e.g., x/x becomes 1 dropping the case x=0. We claim that it is feasible in practice to compute also the degenerate cases yielding guarded expressions. We work over real closed fields but our ideas about handling guarded expression can be easily transferred to other situations. Using formulas as guards provides a powerful tool for heuristically reducing the combinatorial explosion of cases: equivalent, redundant, tautological, and contradictive cases can be detected by simplification and quantifier elimination. Our approach allows to simplify the expressions on the basis of simplification knowledge on the logical side. The method described in this paper is implemented in the REDUCE package GUARDIAN, which is freely available on the WWW."
Physical Description:19, 5 S.

There is no print copy available.

Interlibrary loan Place Request Caution: Not in THWS collection!