If ability to perform complex calculations were a sufficient criterion, then even a conventional digital computor could lay claim to more intelligence than any of usand perhaps we had better let it make away with the word and be done with it.

In this paper, we consider a distinctly bottom-up which generates arguments by performing a heuristic approach.

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.]

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

And-or graphs and theorem-proving graphs determine the same kind of search space and differ only in the direction of search: from axioms to goals, in the case of theorem-proving graphs, and in the opposite direction, from goals to axioms, in the case of and-or graphs. Bi-directional search strategies combine both directions of search. We investigate the construction of a single general algorithm which covers uni-directional search both for and-or graphs and for theorem-proving graphs, bi-directional search for path-finding problems and search for a simplest solution as well as search for any solution. We obtain a general theory of completeness which applies to search spaces with infinite or-branching. In the case of search for any solution, we argue against the application of strategies designed for finding simplest solutions, but argue for assigning a major role in guiding the search to the use of symbol complexity (the number of symbol occurrences in a derivation).

The frame problem in representing natural-language information is discussed. It is argued that the problem is not restricted to problem-solving-type situations, in which it has mostly been studied so far, but also has a broader significance. A new solution to the frame problem, which arose within a larger system for representing natural-language information, is described. The basic idea is to extend the predicate calculus notation with a special operator, Unless, with peculiar properties. Some difficulties with Unless are described. THE FRAME PROBLEM This paper proposes a method for handling the frame problem in representing conceptual, or natural-language-type information.

C. COOPER 21 3 Data representation--the key to conceptualisation: D. B. VIGOR 33 MECHANISED MATHEMATICS 45 4 An approach to analytic integration using ordered algebraic expressions: L. I. HODGSON 47 5 Some theorem-proving strategies based on the resolution principle: J. L DARLINGTON 57 MACHINE LEARNING AND HEURISTIC PROGRAMMING 73 6 Automatic description and recognition of board patterns in Go-Moku: A. M. MURRAY and E. W. Etcomc