Dept. of Computer Science, Carnegie-Mellon University. "Many game-playing programs must search very large game trees. Use of the alpha-beta pruning algorithm instead of the simple minimax search reduces by a large factor the number of bottom positions which must be examined in the search. An analytical expression for the expected number of bottom positions examined in a game tree using alpha-beta pruning is derived, subject to the assumptions that the branching factor N and the depth D of the tree are arbitrary but fixed, and the bottom positions are a random permutation of ND unique values. A simple approximation to the growth rate of the expected number of bottom positions examined is suggested, based on a Monte Carlo simulation for large values of N and D. The behavior of the model is compared with the behavior of the alpha-beta algorithm in a chess playing program and the effects of correlation and non-unique bottom position values in real game trees are examined."

Kenneth Mark Colby, 1920 - 2001 Kenneth Colby was born in Waterbury, Connecticut and graduated from Yale in 1941. Two years later he graduated from Yale's School of Medicine. Colby started his career as a professor of computer science at Stanford, and also did some research for the National Institute of Mental Health. It was there that he created Parry in the university's Artificial Intelligence Library. Parry was a chatterbot, and able to have conversations with people.

Proceedings of the international conference on computational linguistics, Pisa, Italy.

A versatile assembly system, using TV cameras and oomputer-controlled arm and moving table, is described. It makes almple assemblies such aa a peg and rings and a toy car. It separates parts from a heap, recognising them with an overhead camera, then assembles them by feel. It can be instructed to perform a new task with different parte by spending an hour showing it the parts and a day or two programming the assembly manipulations. A hierarchical description of parts, views, outlines etc. is used to construct models, and a structure matching algorithm is used in recognition.Later version appearing in Artificial Intelligence, Vol 6, pp. 129(1975) (available for a fee).In IJCAI-73: THIRD INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 20-23 August 1973, Stanford University Stanford, California.

A theorem prover for part of arithmetic in described which proves theorems by representing them in the form of a diagram or network. The nodes of this network represent 'ideal integers', i.e. objects which have all the properties of integers, without being any particular intoger. The links in the network represent relationships between 'ideal integers'. The procedures which draw these diagrams make elementary deductions based on their built-in knowledge of the functions and predicates of arithmetic. This theorem prover is intended as a model of some kinds of human problem-solving behaviour. Also found at EdinburghIn IJCAI-73: THIRD INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 20-23 August 1973, Stanford University Stanford, California.

Since 1967 there has again been great interest in chess programming. This paper demonstrates that the structure of today's most successful programs cannot be extended to play Master level chess. Certain basic requirements of a Master player's performance are shown to be outside the performance limits to which a program of this type could be extended. The paper also examines a basic weakness in the tree-searching model approach when applied to situations that cannot be searched to completion. This is the Horizon Effect, which causes unpredictable evaluation errors due to an interaction between the static evaluation function and the rules for search termination. The outline of a model of chess playing that avoids the Horizon Effect and appears extendable to play Master level chess is presented, together with some results already achieved In IJCAI-73: THIRD INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 20-23 August 1973, Stanford University Stanford, California, pp. 77-85

The object is segmented into parts by grouping parallel traces obtained from the ranging system. Making use of the property of generalized translational invariance, the parts are described in terms of generalized cylinders, consisting of a space curve, or axis, and a circular cross section function on this axis.

Session 6 Logic: II Theorem Proving and STEPS TOWARD AUTOMATIC THEORY FORMATION John Seely Brown Information and Computer Science Department University of California Irvine Irvine, California Abstract This paper describes a theory formation system which can discover a partial axiomization of a data base represented as extensionally defined binary relations.- The system first discovers all possible intensional definitions of each binary relation in terms of the others. It then determines a minimal set of these relations from which the others can be defined. It then attempts to discover all the ways the relations of this minimal set can interact with each other, thus generating a set of inference rules. Although the system was originally designed to explore automatic techniques for theory construction for question-answering systems, it is currently being expanded to function as a symbiotic system to help social scientists explore certain kinds of data bases. Introduction For over a decade researchers in AI have been designing question-answering systems which are capable of deriving "implicit" facts from a sparse data base.

This framework is in large part due to various res trictions imposed upon the heuristic that guides the search and the resulting effect on the search algorithm itself. In order to discuss some of these restrictions it is necessary to introduce the following notation. For a node n of a tree or graph, the following functions are defined as part of the problem.

At the present stage of research in artificial intelligence , machines are stil l remote from achieving a level of intelligence comparable in complexity to human thought. As computer applications become more sophisticated, however, and thus more influential in human affairs , it becomes increasingly important to understand both the capabilities and limitations of machine Intelligence and its potential impact on society. To this end, the artificial intelligence field was ex­amined in a systematic manner. The study was divided into two parts : (1) Delineation of areas of artificial intelligence, and postulatio " of hypothetical prod­ucts resulting from progress in the field , and (2) A judgmental portion, which involved appli­cations and implications of the products to society . For the latter purpose, a Delphi study was conducted among experts in the artificial intelligence field to solicit their opinion concerning prototype and com­mercial dates for the products, and the possibility and desirability of their applications and implications .In IJCAI-73: THIRD INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 20-23 August 1973, Stanford University Stanford, California.