The aim of this paper is to present in a rigorous way the syntax and semantics of a certain fragment of a certain dialect of English. Patrick Suppes claims, in a paper prepared for the present workshop [the 1970 Stanford Workshop on Grammar and Semantics], that at the present time the semantics of natural languages are less satisfactorily formulated than the grammars ¼ [and] a complete grammar for any significant fragment of natural language is yet to be written.'' This claim would of course be accurate if restricted in its application to the attempts emanating from the Massachusetts Institute of Technology, but fails to take into account the syntactic and semantic treatments proposed in Montague (1970a, b). Thus the present paper cannot claim to present the first complete syntax (or grammar, in Suppes' terminology) and semantics for a significant fragment of natural language; and it is perhaps not inappropriate to sketch relations between the earlier proposals and the one given below. Montague (1970b) contains a general theory of languages, their interpretations, and the inducing of interpretations by translation.

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.

Operations Research, 21, 1071–1088.

Given an axiomatic description of its capabilities in some world, she generates her own procedures to embody these capabilities.

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.

Dept. of Computer Sciences and CAI Laboratory, University of Texas, Austin.

The research reported here concerns the principles used to automatically generate three-dimensional representations from line drawings of scenes. The computer programs involved look at scenes which consist of polyhedra and which may contain shadows and various kinds of coincidentally aligned scene features. Each generated description includes information about edge shape (convex, concave, occluding, shadow, etc.), about the type of illumination for each region (illuminated, projected shadow, or oriented away from the light source), and about the spacial orientation of regions. The methods used are based on the labeling schemes of Huffman and Clowes; this research provides a considerable extension to their work and also gives theoretical explanations to the heuristic scene analysis work of Guzman, Winston, and others. A condensed version appears in Patrick Winston (ed.), The Psychology of Computer Vision, pp. 19{91, New York: McGraw-Hill, 1975. Direct link to . MIT AI Lab Technical Report No AITR-271, November 1