Skip to main content
SpringerLink
Log in

Using meta-level inference for selective application of multiple rewrite rules in algebraic manipulation

  • Tuesday Morning
  • Conference paper
  • First Online:
5th Conference on Automated Deduction Les Arcs, France, July 8–11, 1980 (CADE 1980)

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

Included in the following conference series:

  • 172 Accesses

Abstract

In this paper we describe a technique for controlling inference, meta-level inference, and a program for algebraic manipulation, PRESS, which embodies this technique. In PRESS, algebraic expressions are manipulated by a series of methods. The appropriate method is chosen by meta-level inference and itself uses meta-level reasoning to select and apply rewrite rules to the current expression.

The use of meta-level inference is shown to drastically cut down on search, lead to clear and modular programs, aid the proving of properties of the program and enable the automatic learning of both new algebraic facts and new control information.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bledsoe, W.W. and Bruell, P. A man machine theorem proving system. In Nilsson, N., editor, Procs of IJCAI3, pages 56–65. Stanford, 1973.

    Google Scholar 

  2. Boyer, R.S. and Moore J.S. Proving theorems about LISP functions. In Nilsson, N., editor, procs. of IJCAI3, pages 486–493. Stanford, August, 1973. Also available from Edinburgh as DCL memo no. 60.

    Google Scholar 

  3. Brown, F.M. Towards the automation of Set Theory and its Logic. Research Report 34, Dept. of Artificial Intelligence, Edinburgh., May, 1977. A shortened version appeared in IJCAI5.

    Google Scholar 

  4. Bundy, A. and Welham, B. Using meta-level descriptions for selective application of multiple rewrite rules in algebraic manipulation. Working Paper 55, Dept. of Artificial Intelligence, Edinburgh., May, 1979.

    Google Scholar 

  5. Bundy, A. and Welham, B. Using meta-level inference for selective application of multiple rewrite rules in algebraic manipulation. Artificial Intelligence, forthcoming.

    Google Scholar 

  6. Bundy, A., Byrd, L., Luger, G., Mellish, C., Milne, R. and Palmer, M. Mecho: A program to solve Mechanics problems. Working Paper 50, Dept. of Artificial Intelligence, Edinburgh., 1979.

    Google Scholar 

  7. Bundy, A. Analysing Mathematical Proofs (or reading between the lines). In Winston, P., editor, Procs of the fourth. IJCAI, Georgia, 1975. An expanded version is available from Edinburgh as DAI Research Report No. 2.

    Google Scholar 

  8. Bundy, A. An elementary treatise on equation solving. Working Paper 51, Dept. of Artificial Intelligence, Edinburgh., 1979.

    Google Scholar 

  9. Davis, R. & Buchanan, B.G. Meta-level knowledge: overview and applications. In Reddy, R., editor, procs of 5th, pages 920–927. IJCAI, 1977.

    Google Scholar 

  10. Hayes, P. Computation and deduction. In Proc. of MFCS Symposium. Czech. Academy of Sciences, 1973.

    Google Scholar 

  11. Hearn, A.C. REDUCE: A user-oriented interactive system for Algebraic simplification. Academic Press, New York, 1967, pages 79–90.

    Google Scholar 

  12. Huet, G. Confluent reductions: Abstract properties and applications to term rewriting systems. Rapport de Recherche 250, Laboratoire de Recherche en Informatique et Automatique, IRIA, France, August, 1977.

    Google Scholar 

  13. Knuth, D.E. & Bendix, P.B. Simple word problems in universal algebra. In Leech, editor, Computational problems in abstract algebra, pages pp 263–297. Pergamon Press, 1970.

    Google Scholar 

  14. Martin, W.A. and Fateman, R.J. The MACSYMA system. In Petrick, S.R., editor, 2nd Symposium on Symbolic Manipulation, pages 59–75. Los Angeles, 1971.

    Google Scholar 

  15. Moses, J. Algebraic simplification, a guide for the perplexed. In Petrick, S.R., editor, 2nd Symposium on Symbolic Manipulation, pages 282–304. Los Angeles, 1971.

    Google Scholar 

  16. Pereira, L.M., Pereira, F.C.N. and Warren, D.H.D. User's guide to DECsystem-10 PROLOG. Internal Memo, Dept. of Artificial Intelligence, Edinburgh., 1978.

    Google Scholar 

  17. Weyhrauch, R.W. Prolegomena to a theory of mechanized formal reasoning. RWW Informal Note 8., Stanford University, 1979.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Artificial Intelligence, University of Edinburgh, UK

    Alan Bundy & Bob Welham

Authors
  1. Alan Bundy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bob Welham
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Wolfgang Bibel Robert Kowalski

Rights and permissions

Reprints and permissions

Copyright information

© 1980 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bundy, A., Welham, B. (1980). Using meta-level inference for selective application of multiple rewrite rules in algebraic manipulation. In: Bibel, W., Kowalski, R. (eds) 5th Conference on Automated Deduction Les Arcs, France, July 8–11, 1980. CADE 1980. Lecture Notes in Computer Science, vol 87. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10009-1_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-10009-1_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10009-6

  • Online ISBN: 978-3-540-38140-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation