This is the first presidential address of AAAI, the American Association for Artificial Intelligence. In the grand scheme of history of artificial intelligence (AI), this is surely a minor event. The field this scientific society represents has been thriving for quite some time. No doubt the society itself will make solid contributions to the health of our field. But it is too much to expect a presidential address to have a major impact. So what is the role of the presidential address and what is the significance of the first one? I believe its role is to set a tone, to provide an emphasis. I think the role of the first address is to take a stand about what that tone and emphasis should be-set expectations for future addresses and to communicate to my fellow presidents. Only two foci are really possible for a presidential address: the state of the society or the state of the science. I believe the latter to be correct focus. AAAI itself, its nature and its relationship to the larger society that surrounds it, are surely important. However, our main business is to help AI become a science -- albeit a science with a strong engineering flavor. Thus, though a president's address cannot be narrow or highly technical, it can certainly address a substantive issue. That is what I propose to do.

Bolt Beranek and Newman June 1981 was the closing date for the receipt of votes) The people listed below have been elected by the membership of the AAAI to the offices as indicated. AAAI Annual Meeting The election was special in several ways, in order to complete the initialization of officers and periods of tenure. The annual meeting of the AAAI will be held during the Both a president (for 1981-82) and a president-elect (who will IJCAI-RI meeting in Vancouver. The meeting will be held on serve as president for 1982-83) were elected. The IJCAI business president-elect would be on the ballot, however, no presidentelect meeting will also be held during the same period.

By-Laws of the Association for the Advancement of Artificial Intelligence

This article is the second planned excerpt from the Handbook of Artificial Intelligence being complied at Stanford University. This overview of the Handbook chapter on search, like the overview of natural language research we printed in the first issue, introduces the important ideas and techniques, which are discussed in detail later in the chapter. Cross-references to other articles in the Handbook have been removed -- terms discussed in more detail elsewhere are italicized. The author would like to note that this article draws on material generously made available by Nils Nilsson for use in the Handbook.

Twenty five years is not long in the history of a science--long enough to achieve, short enough to remember. Your esteemed founders are still around -- vigorous, not so young anymore. Out of the cybernetics you came, and information-theoretic psychology. You were born in the early days of modern computing, on hot, bulky hardware with names few now remember, like JOHNNIAC; in strange and wonderful software called list structures, with stacks you could "push down" and "pop-up," bearing arcane acronyms like IPL and FLPL.

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.

For intelligent computers to be able to interact with the real world, they must be able to aggregate individual actions into sequences to achieve desired goals. This process is referred to as automatic problem solving, sometimes more casually called automatic planning. The sequences of actions that are generated are called plans.

AI research at CMU is closely integrated with other activities in the Computer Science Department, and to a major degree with ongoing research in the Psychology Department. Although there are over 50 faculty, staff and graduate students involved in various aspects of AI research, there is no administratively (or physically) separate AI laboratory. To underscore the interdisciplinary nature of our AI research, a significant fraction of the projects listed below are joint ventures between computer science and psychology.

At the recent AAAI conference at Stanford, it became apparent that many new AI research centers are being established around the country in industrial and governmental settings and in universities that have not paid much attention to AI in the past. At the same time, many of the established AI centers are in the process of converting from older facilities, primarily based on Decsystem-10 and Decsystem-20 machines, to a variety of newer options. At present, unfortunately, there is no simple answer to the question of what machines, operating systems, and languages a new or upgrading AI facility should use, and this situation has led to a great deal of confusion and anxiety on the part of those researchers and administrators who are faced with making this choice. In this article I will survey the major alternatives available at present and those that are clearly visible on the horizon, and I will try to indicate the advantages and disadvantages of each for AI work. This is mostly information that we have gathered at CMU in the course of planning for our own future computing needs, but the opinions expressed are my own.

This overview takes a general look at search in problem solving, indicating some connections with topics considered in other Handbook chapters. The these general ideas are found in programs for natural second section considers algorithms that use these language understanding, information retrieval, automatic representations. In methods, which use information about the nature and this chapter of the Handbook we examine search as a tool structure of the problem domain to limit the search. Most of the Finally, the chapter reviews several well-known early examples considered are problems that are relatively easy programs based on search, together with some related to formalize. The first of these is a may be, however, that the description of a task-domain database, which describes both the current task-domain situation is too large for multiple versions to be stored situation and the goal.