This approach leads to an infinite sequence of algorithms I. Surface Models

This paper examines in detail the history of a set of network-structured formalisms for knowledge representation - the so-called semantic networks. While these nets have for the most part retained their basic associative nature, their primitive representational elements have differed significantly from one project to the next. These differences in underlying primitives are symptomatic of deeper philosophical disparities, and a set of five significantly different levels at which networks can be understood are discussed. One of these levels, the epistemological, or knowledge-structuring, level, has played an important implicit part in all previous notations, and is here made explicit in a way that allows a new type of network formalism to be specified. This new type of formalism accounts precisely for operations like individuation of description, internal concept structure in terms of roles and interrelations between them, and structured inheritance.

Academic Press.

This report describes a knowledge-base system in which the information is stored in a network of small parallel processing elements??de and link units??ich are controlled by an external serial computer. This network is similar to the semantic network system of Quillian, but is much more tightly controlled. Such a network can perform certain critical deductions and searches very quickly; it avoids many of the problems of current systems, which must use complex heuristics to limit and guided their searches. It is argued (with examples) that the key operation in a knowledge-base system is the intersection of large explicit and semi-explicit sets. The parallel network system does this in a small, essentially constant number of cycles; a serial machine takes time proportional to the size of the sets, except in special cases.

Artificial Intelligence, 12 (1), 23-40.

I will remain Ion8 and deeply indebted to Herb Simon, H. T. Kung, AI Newell, Jay

In J. E. Hayes, D. Michie, and L. I. Mikulich (Eds.), Machine Intelligence 9. Chichester, England: Ellis Horwood Ltd., 149-195

Doctoral dissertation, Computer ScienceDept., Stanford University.

IJCAI 6, 1-3

... we began to program a computer understanding system thatwould attempt to process input texts. An item crucial to our ability to accomplishthis task was what we called a script. A script is a frequently repeated causalchain of events that describes a standard situation. In understanding, when it ispossible to notice that one of these standard event chains has been initiated,then it is possible to understand predictively. That is, if we know we are in arestaurant then we can understand where an "order" fits with what we justheard, who might be ordering what from whom, what preconditions (menu,sitting down) might have preceded the "order", and what is likely to happennext. All this information comes from the restaurant script.Hayes, J.E., D. Michie, and L. I. Mikulich (Eds.), Machine Intelligence 9, Ellis Horwood.