The Stanford AI lab cart is a card-table sized mobile robot controlled remotely through a radio link, and equipped with a TV camera and transmitter. A computer has been programmed to drive the cart through cluttered indoor and outdoor spaces, gaining its knowledge about the world entirely from images broadcast by the onboard TV system.The cart deduces the three dimensional location of objects around it, and its own motion among them, by noting their apparent relative shifts in successive images obtained from the moving TV camera. It maintains a model of the location of the ground, and registers objects it has seen as potential obstacles if they are sufficiently above the surface, but not too high. It plans a path to a user-specified destination which avoids these obstructions. This plan is changed as the moving cart perceives new obstacles on its journey.The system is moderately reliable, but very slow. The cart moves about one meter every ten to fifteen minutes, in lurches. After rolling a meter, it stops, takes some pictures and thinks about them for a long time. Then it plans a new path, and executes a little of it, and pauses again.

Cognitive Science, vol. 4, No. 4, pp. 349-377

ACM Transactions on Programming Languages and Systems 2(1): 90-121.

"Circumscription is a rule of conjecture that can be used by a person or program for `jumping to certain conclusions'. Namely, the objects that can be shown to have a certain property P by reasoning from certain facts A are all the objects that satisfy P. More generally, circumscription can be used to conjecture that the tuples that can be shown to satisfy a relation P(x, y, z) are all the tuples satisfying this relation. Thus we circumscribe the set of relevant tuples."Artificial Intelligence 13:27-39. Also in Readings in Artificial Intelligence, B.L. Webber and N.J. Nilsson (eds.), Tioga Publishing, 1981.

Proc. Canadian Soc. for Computational Studies of Intelligence, Univ. Victoria, Victoria, BC (1980)

This is a short preview of the document. Your library or institution may give you access to the complete full text for this document in ProQuest.

We discuss the problem of incorporating into a heuristic theorem prover a decision procedure for a fragment of the logic. An obvious goal when incorporating such a procedure is to reduce the search space explored by the heuristic component of the system, as would be achieved by eliminating from the system's data base some explicitly stated axioms. For example, if a decision procedure for linear inequalities is added, one would hope to eliminate the explicit consideration of the transitivity axioms. However, the decision procedure must then be used in all the ways the eliminated axioms might have been. The difficulty of achieving this degree of integration is more dependent upon the complexity of the heuristic component than upon that of the decision procedure. The view of the decision procedure as a black box is frequently destroyed by the need pass large amounts of search strategic information back and forth between the two components.

A 25-year-old book about science has some explaining to do. Machines Who Think was conceived as a history of artificial intelligence, beginning with the first dreams of the classical Greek poets (and the nightmares of the Hebrew prophets), up through its realization as twentieth-century science. The interviews with AI's pioneer scientists took place when the field was young and generally unknown. They were nearly all in robust middle age, with a few decades of fertile research behind them, and luckily, more to come. Thus their explanations of what they thought they were doing were spontaneous, provisional, and often full of glorious fun.

Get Citation Alerts New Citation Alert added! You will be notified whenever a record that you have chosen has been cited. To manage your alert preferences, click on the button below. Aided Design 8, 1 (Jan. An experimental system for computer controlled mechanical assembly.

This approach leads to an infinite sequence of algorithms I. Surface Models