A knowledge-based approach to user-friendliness in symbolic computing
An experiment in making a symbolic computing system tolerant of technical deficiencies in programming by novice users is outlined. The work uses a knowledge-base of information on general properties of symbolic computations, and a pattern-matcher which can specify instances of relevant properties in a user's program or inputs. Both of these components are implemented in LISP, and have been used in conjunction with REDUCE.
KeywordsArbitrary Sequence Novice User Inexperienced User Subject Pattern Symbolic Computing
Unable to display preview. Download preview PDF.
- 1.J.J. Dongarra and A.R. Hinds, Software — Practice and Experience 9, 219 (1979)Google Scholar
- 2.F. Gardin, “DYNPAT User's Manual”, manual M-104, Dept. of Computer Science, University of Exeter (1982)Google Scholar
- 3.F. Gardin and J.A. Campbell, in Proc. 1981 Symposium on Symbolic and Algebraic Computation, SYMSAC '81 (ed. P.S. Wang). Association for Computing Machinery, New York (1981), p. 233.Google Scholar
- 4.A.C. Hearn, “REDUCE 2 User's Manual”, UCP-19, Computational Physics Group, University of Utah (1973)Google Scholar
- 5.M. Metcalf, “FORTRAN Optimization” (Academic Press, London, 1982)Google Scholar
- 6.P.D. Pearce and R.J. Hicks, in Proc. 1981 Symposium on Symbolic and Algebraic Computation, SYMSAC '81 (ed. P.S. Wang). Association for Computing Machinery, New York (1981), p. 131.Google Scholar
- 7.C. Weissman, “LISP 1.5 Primer” (Dickenson Publishing Co., Belmont, California, 1967).Google Scholar
- 8.J. Weizenbaum, Comm. A.C.M. 9, 36 (1966).Google Scholar