Logical Reasoning Systems derive sound conclusions from formal declarative knowledge. Such systems are usually deened by abstract rules of inference. For example, the rule of modus ponens states that given P , and \P implies Q" (usually written P ! Q), we can infer Q. Logical systems have a rich history starting with Greek syllogisms and continuing through the work many prominent mathematicians...

To help along the analysis and design of nonlinear control systems the NONLINCON package, an acronym for Nonlinear Control, was developed. This note addresses the usefulness of symbolic computation, and of the NONLINCON package in particular, for the symbolic analysis and design of nonlinear control systems. The symbolic computation program MAPLE is used as computing substratum. Textbook proble...

Two aspects of parallelism as related to symbolic computing are presented: (1) the implementation of parallel programs for the factorization of polynomials, and (2) the automatic derivation and generation of parallel codes for nite element analysis. The former illustrates the use of parallel programming to speed up symbolic manipulation. The latter shows how symbolic systems can help create par...

Two aspects of parallelism as related to symbolic computing are presented: (1) the implementation of parallel programs for the factorization of polynomials, and (2) the automatic derivation and generation of parallel codes for finite element analysis. The former illustrates the use of parallel programming to speed up symbolic manipulation. The latter shows how symbolic systems can help create p...

We consider the problem of symbolic-numeric integration of symbolic functions, focusing on rational functions. Using a hybrid method allows the stable yet efficient computation of symbolic antiderivatives while avoiding issues of ill-conditioning to which numerical methods are susceptible. We propose two alternative methods for exact input that compute the rational part of the integral using He...