In Metzing, D. (Ed.), Frame Conceptions and Text Understanding, pp. 46–61. de Gruyter.

Our purpose in studying natural language understanding in conjunction with problem solving is to bring together the constraints of what formal representation can actually be obtained with the question of what knowledge is required in order to solve a wide range of problems in a semantically rich domain. We believe that these issues cannot sensibly be tackled in isolation. In practical terms we have had the benefits of an increased awareness of common problems in both areas and a realisation that some of our techniques are applicable to both the control of inference and the control of parsing. Early work on solving mathematical problems stated in natural language was done by Bobrow (STUDENT - (i]) and Chamiak (CARPS - [5]). However the rudimentary parsing and simple semantic structures used by Bobrow and Charniak are inadequate for any but the easiest problems. Our intention has been to build on B/RG Chris This work was supported by SRC grant number 94493 and an SRC research studentship for Mellish.

Summary of Ph.D. dissertation, Computer Science Dept., Stanford University (1979)."TEIRESIAS is a program designed to provide assistance on the task of building knowledge-based systems. It facilitates the interactive transfer of knowledge from a human expert to the system, in a high level dialog conducted in a restricted subset of natural language. This paper explores an example of TEIRESIAS in operation and demonstrates how it guides the acquisition of new inference rules. The concept of meta-level knowledge is described and illustrations given of its utility in knowledge acquisition and its contribution to the more general issues of creating an intelligent program."Also in:Readings in Artificial Intelligence, ed. Webber, Bonnie Lynn and Nils J. Nilsson, Palo Alto, CA: Tioga Publishing Co., 1981.Orig. in IJCAI-77, vol.1, pp. 321 ff. Preprint in Stanford HPP Report #HPP-77-9.See also: Artificial Intelligence, 12[#2]:409-427. Readings in Artificial Intelligence, ed. Webber, Bonnie Lynn and Nils J. Nilsson, Palo Alto, CA: Tioga Publishing Co., 1981

Chess Life and Review (February):84-85.

Distributed systems are multi-processor information processing systems whichdo not rely on the central shared memory for communication. The importanceof distributed systems has been growing with the advent of "computer networks"of a wide spectrum: networks of geographically distributed computers at one end,and tightly coupled systems built with a large number of inexpensive physicalprocessors at the other end. Both kinds of distributed system are made availableby the rapid progress in the technology of large-scale integrated circuits. Yetlittle has been done in the research on semantics and programming methodologiesfor distributed information processing systems.Our main research goal is to understand and describe the behaviour of suchdistributed systems in seeking the maximum benefit of employing multi-processorcomputation schemata.Hayes, J.E., D. Michie, and L. I. Mikulich (Eds.), Machine Intelligence 9, Ellis Horwood.

in D Michie (ed.), Expert Systems in the Micro-Electronic Age, pp. 242-270, Edinburgh: Edinburgh University Press

D.Michie (Ed.), Expert systems in the micro- electronic age.Edinburgh: Edinburgh University Press, 153-167

A program called "AM" is described which carries on simple mathematics research,defining and studying new concepts under the guidance of a large body ofheuristic rules. The 250 heuristics communicate via an agenda mechanism, aglobal priority queue of small tasks for the program to perform, and reasons whyeach task is plausible (for example, "Find generalizations of 'primes', because'primes' turned out to be so useful a concept"). Each concept is represented asan active, structured knowledge module. One hundred very incomplete modulesare initially supplied, each one corresponding to an elementary set-theoreticconcept (for example, union). This provides a definite but immense space whichAM begins to explore. In one hour, AM rediscovers hundreds of common concepts(including singleton sets, natural numbers, arithmetic) and theorems (for example,unique factorization).Summary of Ph.D. dissertation.Hayes, J.E., D. Michie, and L. I. Mikulich (Eds.), Machine Intelligence 9, Ellis Horwood.

Cognitive Science 3(3):177-212.

Technometrics, 21(2)