Joel Moses
Abstract
Algebraic simplification is examined first from the point of view of a user who needs to comprehend a large expression, and second from the point of view of a designer who wants to construct a useful and efficient system. First we describe various techniques akin to substitution. These techniques can be used to decrease the size of an expression and make it more intelligible to a user. Then we delineate the spectrum of approaches to the design of automatic simplification capabilities in an algebraic manipulation system. Systems are divided into five types. Each type provides different facilities for the manipulation and simplification of expressions. Finally we discuss some of the theoretical results related to algebraic simplification. We describe several positive results about the existence of powerful simplification algorithms and the number-theoretic conjectures on which they rely. Results about the nonexistence of algorithms for certain classes of expressions are included.
- 1 Abrahams, P.W. Application of LISP to sequence prediction. Comm. ACMg, 8 (Aug. 1966), 551.Google Scholar
- 2 Brown, W.S., et al. The ALPAK system for non-numerical algebra on a Digital Computer-II. Bell Sys. Tech. J. 43, 2 (Mar. 1964), 785-804.Google Scholar
- 3 Brown, W.S. Rational exponential expressions and a conjecture concerning rr and e. Amer. Math. Monthly 76 (Jan. 1969), 28-34.Google ScholarCross Ref
- 4 Caviness, B.F. On canonical forms and simplification. Ph.D. diss., Carnegie-Mellon U., Pittsburgh, Pa., Aug. 1967.Google Scholar
- 5 Caviness, B.F. On canonical forms and simplification. J. ACM 17, 2 (Apr. 1970), 385-396. Google ScholarDigital Library
- 6 Collins, G. PM, A system for polynomial manipulation. Comm. ACM 9, 8 (Aug. 1966), 578-589. Google ScholarDigital Library
- 7 Collins, G. The SAC-I system: An introduction and survey. SYMSAM II, pp. 144-152. Google ScholarDigital Library
- 8 Collins, G. Subresultant and reduced polynomial remainder sequences. J. ACM 14, 1 (Jan. 1967), 128-142. Google ScholarDigital Library
- 9 Engelman, C. The legacy of MATHLAB 68. SYMSAM II, pp. 29-41. Google ScholarDigital Library
- 10 Engeli, M. User's manual for the formula manipulation language SYMBAL. Computer Center, U. of Texas at Austin, 1968.Google Scholar
- 11 Fateman, R. The user-level semantic matching capability in MACSYMA. Proc. 2nd. Symp. on Symbolic and Algebraic Manipulation, ACM Headquarters, New York, pp. 311-323. Google ScholarDigital Library
- 12 Fateman, R. Essays in algebraic simplification. Ph.D. diss., Harvard U., Cambridge, Mass., 1971.Google Scholar
- 13 Fenichel, R. An on-line system for algebraic manipulation. Ph.D. diss., Harvard U., Cambridge, Mass., 1966.Google Scholar
- 14 Griesmer, J.H., and Jenks, R.D. SCRATCHPAD/I : An interactive facility for symbolic mathematics. SYMSAM II, pp. 42-48. Google ScholarDigital Library
- 15 Hall, A.D. The ALTRAN system for rational function manipulation--A survey. Comm. ACM 14, 8 (Aug. 1971), 517-521. Google ScholarDigital Library
- 16 Hearn, A. REDUCE: A user-oriented interactive system for algebraic simplification. In b~teractive Systems for Experimental Applied Mathematics. Academic Press, New York, 1968, pp. 79-90.Google Scholar
- 17 Hearn, A. The Problem of Substitution. Proc. 1968 Summer Inst. on Symbolic Math. Comput. IBM, Cambridge, Mass., pp. 3-19.Google Scholar
- 18 Hearn, A. REDUCE 2: A system and language for algebraic manipulation. Proc. 2nd Symp. on Symbolic and Algebraic Manipulation, ACM Headquarters, New York, pp. 123-135. Google ScholarDigital Library
- 19 Korsvold, K. An on-line algebraic simplification program. Artif. Intell. Proj. Memo. no. 37, Stanford U., Stanford, Cal., Nov. 1965.Google Scholar
- 20 Martin, W., and Fateman, R. The MACSYMA system. SYMSAM II, pp. 59-75. Google ScholarDigital Library
- 21 Matijasevic, J.V. Enumerable sets are diophantine. Soviet Math. Dokl., 11, 1970.Google Scholar
- 22 Minsky, M., and Papert, S. Perceptrons. MIT Press, Cambridge, Mass., 1969.Google Scholar
- 23 Moses, J. Symbolic integration. Report MAc-TR-47, Project MAC, MIT, Cambridge, Mass., Dec. 1967. (Available as AD 662-666, Clearinghouse, Springheld, Va. 22151.)Google Scholar
- 24 Moses, J. A canonical form for first order exponential expressions. In preparation.Google Scholar
- 25 Moses, J., Rothschild, L.P., and Schroeppel, R. A zero-equivalence algorithm for expressions formed by functions definable by first order differential equations. In preparation.Google Scholar
- 26 Oldehoeft, A. Analysis of constructed mathematical responses by numeric tests for equivalence. Proc. ACM 24th Nat. Conf., 1969, ACM, New York, pp. 117-124. Google ScholarDigital Library
- 27 Perils, A., et al. A definition of Formula Algol. Comput. Center, Carnegie-Mellon U., Pittsburgh, Pa., Mar. 1966.Google Scholar
- 28 Richardson, D. Some unsolvable problems involving functions of a real variable. Ph.D. diss., U. of Bristol, England, 1966.Google Scholar
- 29 Richardson, D. Some unsolvable problems involving elementary functions of a real variable. J. Symb. Logic 33 (1968), 511-520.Google Scholar
- 30 Richardson, D. A solution of the identity problem for integral exponential functions. Z. Math Logik u. Grundlagen Math, to appear.Google Scholar
- 31 Simon, H. The Science of the Artificial. MIT Press, Cambridge, Mass., 1969. Google ScholarDigital Library
- 32 Tobey, R. Experience with FORMAC algorithm design. Comm. ACMg, 8 (Aug. 1966), 589-597. Google ScholarDigital Library
- 33 Tobey, R., et al. Automatic simplification in FORMAC. Proc. A9IPS 1965 FJCC, Vol. 27, Pt. 1, Spartan Books, New York, pp. 37-57.Google Scholar
Recommendations
Towards a general theory of special functions
A list of a number of natural developments for the field of algebraic manipulation is given. Then the prospects for a general theory of functions defined by ordinary differential equations are discussed. The claim is made that recent developments in ...
Quadrilateral mesh simplification
We introduce a simplification algorithm for meshes composed of quadrilateral elements. It is reminiscent of edge-collapse based methods for triangle meshes, but takes a novel approach to the challenging problem of maintaining the quadrilateral ...
Lambda calculus with algebraic simplification for reduction parallelization by equational reasoning
Parallel reduction is a major component of parallel programming and widely used for summarization and aggregation. It is not well understood, however, what sorts of nontrivial summarizations can be implemented as parallel reductions. This paper develops ...
Comments