This article seizes an opportune time to honor Marvin and his contributions and influence in artificial intelligence, science, and beyond. The article provides readers with some personal insights of Minsky from Danny Hillis, John McCarthy, Tom Mitchell, Erik Mueller, Doug Riecken, Aaron Sloman, and Patrick Henry Winston -- all members of the AI community that Minsky helped to found. The article continues with a brief resume of Minsky's research, which spans an enormous range of fields. It concludes with a short biographical account of Minsky's personal history.
Abecker, Andreas, Antonsson, Erik K., Callaway, Charles B., Dignum, Virginia, Doherty, Patrick, Elst, Ludger van, Freed, Michael, Freedman, Reva, Guesgen, Hans, Jones, Gareth, Koza, John, Kortenkamp, David, Maybury, Mark, McCarthy, John, Mitra, Debasis, Renz, Jochen, Schreckenghost, Debra, Williams, Mary-Anne
The Association for the Advancement of Artificial Intelligence, in cooperation with Stanford University's Department of Computer Science, presented the 2003 Spring Symposium Series, Monday through Wednesday, 24-26 March 2003, at Stanford University. The titles of the eight symposia were Agent-Mediated Knowledge Management, Computational Synthesis: From Basic Building Blocks to High- Level Functions, Foundations and Applications of Spatiotemporal Reasoning (FASTR), Human Interaction with Autonomous Systems in Complex Environments, Intelligent Multimedia Knowledge Management, Logical Formalization of Commonsense Reasoning, Natural Language Generation in Spoken and Written Dialogue, and New Directions in Question-Answering Motivation.
McCarthy, John, Feigenbaum, Edward A.
"This is a position paper about the relations among artificial intelligence (AI), mathematical logic and the formalization of common-sense knowledge and reasoning. It also treats other problems of concern to both AI and philosophy. I thank the editor for inviting it. The position advocated is that philosophy can contribute to AI if it treats some of its traditional subject matter in more detail and that this will advance the philosophical goals also. Actual formalisms (mostly first order languages) for expressing common-sense facts are described in the references."Copies also available on J. McCarthy's Stanford Archivein Philosophical Logic and Artificial Intelligence, Richmond Thomason (ed), Dordrecht: Kluwer Academic, 1989.
Too few people are doing basic research in AI relative to the number working on applications. The ratio of basic/applied is less in AI than in the older sciences and than in computer science generally. This is unfortunate, because reaching human level artificial intelligence will require fundamental conceptual advances.
Binford, Tom, McCarthy, John
The Robotics Project (the "Hand-Eye Project") evolved within the Stanford Artificial Intelligence Laboratory under the guidance of John McCarthy, Les Earnest, Jerry Feldman, and Tom Binford. Major efforts have been undertaken to isolate and solve fundamental problems in computer vision, manipulation, and autonomous vehicles. Stereo vision and texture have been examined. Several generations of robot programming languages have resulted in AL, an intermediate-level language for commanding manipulation.
"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
"The epistemological part of Al studies what kinds of facts about the world are available to an observer with given opportunities to observe, how these facts can be represented in the memory of a computer, and what rules permit legitimate conclusions to be drawn from these facts. It leaves aside the heuristic problems of how to search spaces of possibilities and how to match patterns."See also: IJCAI 5, 1038-1044In Readings in Artificial Intelligence, B.L. Webber and N.J. Nilsson (eds.), Tioga Publishing, 1981.
"It is well known to be impossible to tile with dominoes a checkerboard with two opposite corners deleted. This fact is readily stated in the first order predicate calculus, but the usual proof which involves a parity and counting argument does not readily translate into predicate calculus. We conjecture that this problem will be very difficult for programmed proof procedures."Stanford Artificial Intelligence Project Memo No. 16