Using meta-level inference for selective application of multiple rewrite rules in algebraic manipulation
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.
Keywordsrewrite rules theorem proving mathematical reasoning algebraic manipulation and meta-level reasoning
Unable to display preview. Download preview PDF.
- [Bledsoe and Bruell 73]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
- [Boyer and Moore 73]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
- [Brown 77]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
- [Bundy and Welham 79]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
- [Bundy and Welham ng]Bundy, A. and Welham, B. Using meta-level inference for selective application of multiple rewrite rules in algebraic manipulation. Artificial Intelligence, forthcoming.Google Scholar
- [Bundy et al 79]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
- [Bundy 75]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
- [Bundy 79]Bundy, A. An elementary treatise on equation solving. Working Paper 51, Dept. of Artificial Intelligence, Edinburgh., 1979.Google Scholar
- [Davis et al 77]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
- [Hayes 73]Hayes, P. Computation and deduction. In Proc. of MFCS Symposium. Czech. Academy of Sciences, 1973.Google Scholar
- [Hearn 67]Hearn, A.C. REDUCE: A user-oriented interactive system for Algebraic simplification. Academic Press, New York, 1967, pages 79–90.Google Scholar
- [Huet 77]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
- [Knuth & Bendix 70]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
- [Martin and Fateman 71]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
- [Moses 71]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
- [Pereira et al 78]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
- [Weyhrauch 79]Weyhrauch, R.W. Prolegomena to a theory of mechanized formal reasoning. RWW Informal Note 8., Stanford University, 1979.Google Scholar