Fikes, R.E. | Hart, P.E. | Nilsson, N.J.

"In this paper we describe some major new additions to the STRIPS robot problem-solving system. The first addition is a process for generalizing a plan produced by STRIPS so that problem-specific constants appearing in the plan are replaced by problem-independent parameters.The generalized plan, stored in a convenient format called a triangle table, has two important functions. The more obvious function is as a single macro action that can be used by STRIPSâ€”either in whole or in partâ€”during the solution of a subsequent problem. Perhaps less obviously, the generalized plan also plays a central part in the process that monitors the real-world execution of a plan, and allows the robot to react "intelligently" to unexpected consequences of actions.We conclude with a discussion of experiments with the system on several example problems."Artificial Intelligence 3:251-288

I shall discuss automatic methods of search for solutions in problems susceptible of a particular formal representation, namely that on which the Graph Traverser program (Doran & Michie 1966, and see Doran p. 105) has been based. One approach, based on state-evaluation, generates all the states of the problem which can be reached in a small number of moves from the current state, and then seeks by some process of evaluation to decide which state shall form the next point of departure. In the classical studies of Newell, Shaw & Simon (1960) selection is applied by going down a priority sequence of operators, applying to each in turn a number of tests, first of applicability to the current state and then of whether the operator conduces towards one or another of various desirable intermediate states, or subgoals.

In Part II these models are applied to the solution of three problems--prediction of the Bernoulli sequence, extrapolation of a certain kind of Markov chain, and the use of phrase structure grammars for induction. The solution to the second problem uses less certain approximations, but the properties of the solution that are discussed, are fairly independent of these approximations. The third application, using phrase structure grammars, is least exact of the three. This formal solution is then applied in an approximate way to the determination of the "optimum" phrase structure grammar for a given set of strings.

What is needed is a discipline which will study semantic message-connection in a way analogous to that in which metamathematics studies mathematical connection, and to that in which mathematical linguistics now studies syntactic connection. Research Used as Data for the Construction of T (a) Conceptual Dictionary for English The uses of the main words and phrases of English are mapped on to a classificatory system of about 750 descriptors, or heads, these heads being streamlined from Roget's Thesaurus. For Instance, a single card covers Disappoint, Disappointed, Disappointing, Disappointment. The two connectives, / ("slash") and: ("colon") and a word-order rule are used as in T to replace R.H. Richens' three subscripts, and every two pairs of elements are bracketted together, two bracketted pairs of elements counting as a single pair for the purpose of forming 2nd order brackets.

... The literature does not include any general discussion of the outstanding problems of this field. In this article, an attempt will be made to separate out, analyze, and find the relations between some of these problems. Analysis will be supported with enough examples from the literature to serve the introductory function of a review article, but there remains much relevant work not described here.Proc. Institute of Radio Engineers 49, p. 8-30

Even the earliest computers could do arithmetic superbly, but only very recently have they begun to read the written digits that a child recognizes before he learns to add them. Understanding speech and reading print are examples of a basic intellectual skill that can variously be called cognition, abstraction or perception; perhaps the best general term for it is pattern reecognition. Except for their inability to recognize patterns, machines (or, more accurately, the programs that tell machines what to do) have now met most of the classic criteria of intelligence that skeptics have proposed.Scientific American [August, 1960] 203: 60-68. Computers and Thought, Section 6 (1963).

Particular attention is given to processes involving pattern recognition, learning, planning ahead, and the use of analogies or?models!. Second, we can often find simple machines which in certain situations do exhibit performances which would be called intelligent If done by a man. In attempting to design intelligent machines we are, in effect, concerned with the problems of "creativity". Usually the problem is not so much to find the basic structure (or the domain of things to try) as to find ways of reducing this structure to reasonable size.

This is a case study in problem-solving, representing part of a program of research on complex information-processing systems. We have specifieda system for finding proofs of theorems in elementary symbolic logic, and by programming a computer to these specifications, have obtained empirical data on the problem-solving process in elementary logic. The program is called the Logic Theory Machine (LT); it was devised to learn how it is possible to solve difficult problems such as proving mathematical theorems, discovering scientific laws from data, playing chess, or understanding the meaning of English prose.The research reported here is aimed at understanding the complexp rocesses (heuristics) that are effective in problem-solving. Hence, we are not interested in methods that guarantee solutions, but which require vastamounts of computation. Rather, we wish to understand how a mathematician, for example, is able to prove a theorem even though he does not know when he starts how, or if, he is going to succeed.Proceedings of the Western Joint Computer Conference, 15:218-239. Reprinted in Feigenbaum and Feldman, Computers and Thought (1963).

I propose to investigate the question as to whether it is possible for machinery to show intelligent behaviour. On the other hand the human intelligence seems to be able to find methods of ever-increasing power for dealing with such problems'transcending' the methods available to machines. It is already possible to produce machines where this sort of situation arises in a small degree. The states of'continuous' machinery on the other hand form a continuous manifold, and the behaviour of the machine is described by a curve on this manifold.