Methods of Approach At the outset it might be well to distinguish sharply between two general approaches to the problem of machine learning.

We have divided this area into categories and cross-indexed the references accordingly.

The editors have provided him with special introductory sections as a ing guide to a thorough understand of the reports.

Case-based reasoning is used extensively by people in A second driving force in the evolutionary history of CBR both expert and commonsense situations. It provides a was dissatisfaction with rule-based reasoning (expert systems wide range of advantages.

When working from of a small set of primitives and the statement of a such representations, lexical choice is often a nonissue program's knowledge as a set of expressions over these since each term can be uniquely associated with a natural primitives plus a set of constant terms for individuals.

By studying biological systems, Several definitions for the term robot have been proposed principles may be discovered that can be used, perhaps by (Jablonowski and Posey, 1985). None of these definitions analogy, to improve the functional components of a robot are adequate because they exclude robot intelligence of as well as their cooperation.

Our descriptive vocabulary may still In this article I propose to describe an area of artificial contain proper names as modifiers but the explanatory intelligence (Al) research that I and several colleagues vocabulary now involves the impersonal qualities of an have been enaged in for a number of years.

Artificial intelligence, or AI, is largely an experimental science--at least as much progress has been made by building and analyzing programs as by examining theoretical questions. MYCIN is one of several well-known programs that embody some intelligence and provide data on the extent to which intelligent behavior can be programmed. As with other AI programs, its development was slow and not always in a forward direction. But we feel we learned some useful lessons in the course of nearly a decade of work on MYCIN and related programs. In this book we share the results of many experiments performed in that time, and we try to paint a coherent picture of the work.

Automatic computer programming or automatic programming occurs whenever a machine aids in this process. The amount of automatic programming that is occurring is a variable quantity that depends on how much aid the human is given. There are a number of dimensions on which the level of help can be measured including the level of the language used by the human, the amount of informality allowed, the degree to which the system is told what to do rather than how to do it, and the efficiency of the resulting code. Thus we usually say that there is a higher degree of automatic programming whenever a higher level language is used, less precision is required of the human, the input instructions are more declarative and less procedural, and the quality of the object code is better. The technologies of automatic programming thus include the fields that help move the programming experience along any of these dimensions: algorithm synthesis, programming language research, compiler theory, human factors, and others. This paper will concentrate on only the first of these topics, formal methodologies for the automatic construction of algorithms from fragmentary information. The formal methodologiest have been separated into two categories, synthesis from formal specifications and synthesis from examples. In the former case, it is assumed a specification is given for the target program with adequate domain information so that the target program can be derived in a series of logical steps.

This paper will be concerned with the problem of obtaining this performance from the machine by giving it examples of the desired computation and having it program itself. We will be concerned with designing a trainable Turing machine although the concepts presented are applicable in a much more general context as discussed in Section 4. The Turing machine to be discussed here will have an infinite one dimensional tape and will have the capability in one move to read a symbol on the tape, print a new symbol to replace the one just read, and step right or left one increment on the tape. It will have a deterministic finite-state controller with a designated initial state which will upon receiving an input symbol read from the tape, yield the symbol to be printed and the step direction (right or left) to be made.