AAAI News
This support has in-Intelligence will be held 13-17 July 1987 in M. Tenenbaum, Chair; Ronald Brachman,:luded publicity, printing, office help, and Seattle, Washington. Typical grants AAAI-87's Technical Program will from the membership for conference iave been $5,000, although requests for up present outstanding research papers in AI. sites for 1988, 1990, and 1991. The proposal to $10,000 will be considered. Any topic in These papers will be divided into those emphasizing should be structured around the new AI science or technology is appropriate, basic research and those emphasizing five day format described elsewhere in this and anyone may volunteer to organize a applied research. Based on a predictive workshop on any topic.
A Question of Responsibility
In 1940, a 20-year-old science fiction fan from Brooklyn found that he was growing tired of stories that endlessly repeated the myths of Frankenstein and Faust: Robots were created and destroyed their creator; robots were created and destroyed their creator; robots were created and destroyed their creator-ad nauseum. So he began writing robot stories of his own. "[They were] robot stories of a new variety," he recalls. "Never, never was one of my robots to turn stupidly on his creator for no purpose but to demonstrate, for one more weary time, the crime and punishment of Faust. My robots were machines designed by engineers, not pseudo-men created by blasphemers. My robots reacted along the rational lines that existed in their'brains' from the moment of construction. " In particular, he imagined that each robot's artificial brain would be imprinted with three engineering safeguards, three Laws of Robotics: 1. A robot may not injure a human being or, through inaction, allow a human being to come to harm. 2. A robot must obey the orders given it by human beings except where such orders would conflict with the first law. The young writer's name, of course, was Isaac Asimov (1964), and the robot stories he began writing that year have become classics of science fiction, the standards by which others are judged. Indeed, because of Asimov one almost never reads about robots turning mindlessly on their masters anymore. But the legends of Frankenstein and Faust are subtle ones, and as the world knows too well, engineering rationality is not always the same thing as wisdom. M Mitchell Waldrop is a reporter for Science Magazine, 1333 H Street N.W., Washington D C. 2COO5. Reprinted by permission of the publisher.
Donald A. Waterman 1936-1987
Don was one of the pioneers the checkers player, and Waterman's. of our field, whose early research built the foundation for the "His subsequent contributions to protocol analysis, to area that would later come to be labeled "knowledge based the technology of rule-based systems, and to the literature of systems" (and still later "expert systems"). Don received a B.S. in Electrical Engineering from With Don's work on production systems in his thesis, it Iowa State University in 1958, and an M.S. in Electrical was only natural that he should move to Carnegie-Mellon to Engineering from the University of California, Berkeley in work with Allen Newell after acquiring his Ph.D. in 1968. He then entered the Ph.D. program at Stanford's Al takes up the story from there: newly created Cotiputer Science Department. While at "Don came to CMU in Psychology, rather than Computer Berkeley he met a young professor named Ed Feigenbaum, Science. As with many people in AI, he had an abiding and when Feigenbaum moved to Stanford in 1965 Don became interest in understanding human cognition, although it always Ed's first Ph.D. student.
Why a Diagram is (sometimes) Worth Ten Thousand Words
When two representations are informationally equivalent, their computational efficiency depends on the information-processing operators that act on them. Two sets of operators may differ in their capabilities for recognizing patterns, in the inferences they can carry out directly, and in their control strategies (in par- ticular, the control of search). Cognitive Science 11, 65-99