We present and analyze several examples of CEG taken from protocols. Based upon such examples, we present a model of the CEG process. We then briefly describe a computer implementation of the CEG model. This material is based upon wirk supported by the National Science Foundation under Grant No. IST-8017343.

A. YONEZAWA and C. HEWITT 41 REPRESENTATIONS FOR ABSTRACT REASONING 4 A maximal method for set variables in automatic theorem-proving W. W. BLEDSOE

A. YONEZAWA and C. HEWITT 41 REPRESENTATIONS FOR ABSTRACT REASONING 4 A maximal method for set variables in automatic theorem-proving W. W. BLEDSOE

J. Do RAN 433 22 Chromosome classification and segmentation as exercises in knowing what to expect.

Names only appear which are in no sense bibliographic references; otherwise they are to be found in the author index.]

Many of the problems of recognition and interpretation encountered in archaeology have close parallels with classic artificial intelligence problems, notably those of scene analysis.

B.RANDELL 3 PROGRAM PROOF AND MANIPULATION 2 Some techniques for proving correctness of programs which alter data structures.

Oberuc 245, 249 see predicate calculus Occam's razor 271 London 24-5, 52

An operator is characterized by a precondition statement describing the conditions under which it may be applied, and lists of statements describing its effects. Specifically, the effect of an operator is to remove from the model all statements matching forms on the operator's'delete list', and to add to the model all statements on the operator's'add list'.

We describe how to design simple contentaddressable memories, functioning in parallel, which can do this and which, in some sense, can generalise about the stored data. Secondly, we consider how certain graphical representations of data may be suitable for use in efficient serial search strategies. We indicate how such structures can be used in diagnosis when the availability or cost of tests to be applied cannot be determined in advance. The type of parallel system to be considered is to store descriptions of a set of patterns, and is then to be used to supplement an incomplete description of a newly presented pattern by matching it against those in store. If this partial description matches one or more of the stored patterns then we would like the memory to provide us with the partial description that these patterns share. If the new pattern does not match any in store then we expect that the information supplied will be according to the relationships between the pattern presented and those in store. The information that we require our memory to provide when given an incomplete description as an address is therefore more than just the response'yes' or'no'. In this respect our type of system differs from content-addressable parallel memories used in computer technology, and for the same reason its capabilities exceed that of a switching network which is designed to respond positively when the states of its input channels attain one of a number of combinations of binary values (Richards 1971, Renwick and Cole 1971). This paper generalises the work of Willshaw (1972) to ensembles which conform to few or no logical constraints.