Year: 1997
Type: conference-paper
Abstract: Computer algebra systems typically drop some degenerate cases when evaluating expressions, e.g., z/z becomes ldropping the case z = O.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 simplifies the expressions on the basis of simplification knowledge on the logical side.The met hod described in this paper is implemented in the REDUCEpackage GUARDIAN,which is freely available on the WWW.
Authors: Andreas Dolzmann, Thomas Sturm
Institution: University of Passau
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W1998178802
