—A class of LISP programs that is analogous to the finite-state automata is defined, and an algorithm is given for constructing such programs from examples of their input-output behavior. It is shown that the algorithm has robust performance for a wide variety of inputs and that it converges to a solution on the basis of minimum input information.IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS, VOL. SMC-8, NO. 8,

In Hanson and Riseman, 303-333.

Artificial Intelligence 10:173-199

"A CASNET model consists of three main components: observations of a patient, pathophysiological states, and disease classifications. As observations are recorded, they are associated with the appropriate intennediate states. These states, in turn, are typically causally related, thereby forming a network that summarizes the mechanisms of disease. It is these patterns of states in the network that are linked to individual disease classes." Artificial intelligence, August, 1978. Reprinted in Clancey & Shortliffe. Readings in Medical Artificial Intelligence: The First Decade. Ch. 7.

Englewood Cliffs, N.J.: Prentice-Hall.

IJCAI 5, 928-932.

In E. W. Elcock and D. Michie (Eds.), Machine intelligence 8. New York: Wiley.

"Artificial intelligence tasks which can be formulated as constraint satisfaction problems, with which this paper is for the most part concerned, are usually solved by backtracking. By examining the thrashing behavior that nearly always accompanies backtracking, identifying three of its causes and proposing remedies for them we are led to a class of algorithms which can profitably be used to eliminate local (node, arc and path) inconsistencies before any attempt is made to construct a complete solution. A more general paradigm for attacking these tasks is the alternation of constraint manipulation and case analysis producing an OR problem graph which may be searched in any of the usual ways.Many authors, particularly Montanan i and Waltz, have contributed to the development of these ideas; a secondary aim of this paper is to trace that history. The primary aim is to provide an accessible, unified framework, within which to present the algorithms including a new path consistency algorithm, to discuss their relationships and the many applications, both realized and potential, of network consistency algorithms."See also: sciencedirect.comArtificial Intelligence 8:99-118

In E. W. Elcock and D. Michie (Eds.), Machine intelligence 8. New York: Wiley.

ACM symposium on artificial intelligence and programming languages, Rochester, N.Y., 37-44.