Accurate simplification of large symbolic formulae
F.V. Fernández, Angel Rodriguez-Vazquez, Martin Martin, Huertas · IEEE/ACM International Conference on Computer-Aided Design · 1992
Simplification techniques for nested symbolic expressions obtained by hierarchical analysis procedures are presented. An algorithm where potential ranges of variation in the symbolic parameter values are considered to perform simplifications is presented. In this approach, the relative significance of each expression at the different nested levels is evaluated prior to performing simplification. Thus, only those terms with little influence on the top expression are eliminated.>