Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Symbolic and Algebraic Manipulation

EUROSAM 1979: Symbolic and Algebraic Computation pp 23–29Cite as

Canonicality in rule systems

  • 1. Simplification
  • Conference paper
  • First Online:

  • 138 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 72))

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Brown, P. J.: “Canonical Forms and Artificial Languages”, Mathematical Notes No. 19, Computation Center, U. of N. Carolina, July 1963.

    Google Scholar 

  • Brown, W. S.: “Rational Exponential Expressions and a Conjecture Concerning π and e”, Amer. Math. Monthly, Vol. 76, January 1969, pp. 28–34.

    Google Scholar 

  • Caviness, B. F.: “On Canonical Forms and Simplification”, J. ACM, Vol. 17, No. 2, April 1970, pp. 385–396.

    Google Scholar 

  • Cheatham, T. E.: “Symbolic Evaluation — A Look at Loop Analysis”, Proc. of a Symposium on Symbolic and Algebraic Manipulation, August 1976, pp. 90–96.

    Google Scholar 

  • Fateman, R. J.: “The User-level Semantic Pattern Matching Capability in MACSYMA”, Proc. of the 2nd Symposium on Symbolic and Algebraic Manipulation, ACM Headquarters, New York, pp. 311–323.

    Google Scholar 

  • Fateman, R. J.: “Essays in Algebraic Manipulation”, TR-95, M.I.T. Lab. for Comp. Sci., April 1972.

    Google Scholar 

  • Floyd, R.: “Assigning Meaning to Programs”, Proc. of a Symposium on Applied Mathematics, Vol. 19, Mathematical Aspects of Computer Science, pp. 19–32, American Mathematical Society, New York.

    Google Scholar 

  • Moses, J.: “Algebraic Simplification: A guide for the Perplexed”, C. ACM, Vol. 14, No. 8, August 1971, pp. 527–537.

    Google Scholar 

  • Richardson, D.: “Some Unsolvable Problems Involving Functions of a Real Variable”, J. Symbolic Logic, Vol. 33, 1968, pp. 511–520.

    Google Scholar 

  • Robinson, J. A.: “A Machine-oriented Logic Based on the Resolution Principle”, J. ACM, Vol. 12, No. 1, January 1965, pp. 23–41.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratory for Computer Science, Massachusetts Institute of Technology, 02139, Cambridge, Mass.

    Michael R. Genesereth

Authors
  1. Michael R. Genesereth
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Edward W. Ng

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Genesereth, M.R. (1979). Canonicality in rule systems. In: Ng, E.W. (eds) Symbolic and Algebraic Computation. EUROSAM 1979. Lecture Notes in Computer Science, vol 72. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09519-5_54

Download citation

  • DOI: https://doi.org/10.1007/3-540-09519-5_54

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09519-4

  • Online ISBN: 978-3-540-35128-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation