The game of Go invites analysis. The rules seem few and simple, suggesting that the game may have helpful theorems. Tens of millions of people play and skill has developed over centuries to extraordinary levels. Thus, computer analysis can be tested against analysis by highly skilled human players. We study M × N boards, rather than the usual 19 × 19.

This paper investigates the problem of implementing machine learning of heuristics. First, a method of representing heuristics as production rules is developed which facilitates dynamic manipulation of the heuristics by the program embodying them. Second, procedures are developed which permit a problem-solving program employing heuristics in production rule form to learn to improve its performance by evaluating and modifying existing heuristics and hypothesizing new ones, either during an explicit training process or during normal program operation. Third, the feasibility of these ideas in a complex problem-solving situation is demonstrated by using them in a program to make the bet decision in draw poker. Finally, problems which merit further investigation are discussed, including the problem of defining the task environment and the problem of adapting the system to board games.

Full text available for a fee. The main purpose of the research reported here is to show that a new and more powerful type of computer-assisted instruction (CAI), based on extensive application of artificial-intelligence (AI) techniques, is feasible, and to demonstrate some of its major capabilities. A set of computer programs was written and given the name SCHOLAR. Due to its complexity, only the conception and educational aspects of this system (including an actual on-line protocol) are presented in this paper. IEEE Transactions on Man-Machine Systems MMS-ll:190-202

Full text available for a fee. "The use of augmented transition network grammars for the analysis of natural language sentences is described. Structure-building actions associated with the arcs of the grammar network allow for the reordering, restructuring, and copying of constituents necessary to produce deep-structure representations of the type normally obtained from a transformational analysis, and conditions on the arcs allow for a powerful selectivity which can rule out meaningless analyses and take advantage of semantic information to guide the parsing. The advantages of this model for natural language analysis are discussed in detail and illustrated by examples. An implementation of an experimental parsing system for transition network grammars is briefly described." Communications of the ACM, Vol. 13, No. 10, October, 1970, pp. 591-606 (reprinted in RNLP: 71-88).

The M & N procedure is an improvement to the mini-max backing-up procedure widely used in computer programs for game-playing and other purposes. It is based on the principle that it is desirable to have many options when making decisions in the face of uncertainty. The mini-max procedure assigns to a MAX (MIN) node the value of the highest (lowest) valued successor to that node. The M & N procedure assigns to a MAX (MIN) node some function of the M (N) highest (lowest) valued successors. An M & N procedure was written in LISP to play the game of kalah, and it was demonstrated that the M & N procedure is significantly superior to the mini-max procedure.

A parsing algorithm which seems to be the most efficient general context-free algorithm known is described. It is similar to both Knuth's LR(k) algorithm and the familiar top-down algorithm. It has a time bound proportional to n3 (where n is the length of the string being parsed) in general; it has an n2 bound for unambiguous grammars; and it runs in linear time on a large class of grammars, which seems to include most practical context-free programming language grammars. In an empirical comparison it appears to be superior to the top-down and bottom-up algorithms studied by Griffiths and Petrick.

Russian Mathematical Surveys, 25, 221-262

Russian Mathematical Surveys, 25, 221-262

Arguably the first article discussing the uses of AI in the law beyond straightforward information retrieval.Although the computer has worked its way out of the laboratory and into common experience, lawyers have made slim progress towards finding useful computer applications. Research in artificial intelligence, a branch of computer science, has illuminated our capacity to use computers to model human thought processes. This research suggests that computer science may assist lawyers in both the study and performance of their reasoning processes. In this Article we will argue that the time has come for serious interdisciplinary work between lawyers and computer scientists to explore the computer's potential in law.Stanford Law Review vol.23, no.1, November, 1970

In Linguaggi nella Societ`a e nella Tecnica, pp. 189– 224. Edizioni di Comunit`a.