Three experiments have been conducted, and some novel designs and design rules have emerged. The paradigm for Eurisko's exploration is a loop in which it generates a new device configuration, computes its I/O behavior, tries to "parse" this into a functionally it already knows about and can use, and then evaluates the results. In the first experiment, this loop took place at the level of charged carriers moving under the effects of electric fields through abutted regions of doped and undoped semiconductors. This was unsurprising, as they were short sentences in the descriptive language we had defined (a language with verbs like Abut and ApplyEField, and with nouns like nDoped Region and IntrinsicChannellRegion).

Eurisko is an AI program that learns by discovery. We are applying Eurisko to the task of inventing new kinds of three- dimensional microelectronic devices that can then be fabricated using recently developed laser recrystallization techniques. Three experiments have been conducted, and some novel designs and design rules have emerged. The paradigm for Eurisko's exploration is a loop in which it generates a new device configuration, computes its I/O behavior, tries to "parse" this into a functionally it already knows about and can use, and then evaluates the results. In the first experiment, this loop took place at the level of charged carriers moving under the effects of electric fields through abutted regions of doped and undoped semiconductors. Many of the well-known primitive devices were synthesized quickly, such as the MOSFET, Junction Diode, and Bipolar Transistor. This was unsurprising, as they were short sentences in the descriptive language we had defined (a language with verbs like Abut and ApplyEField, and with nouns like nDoped Region and IntrinsicChannellRegion).

In this article we discuss a method for learning useful conditions on the application of operators during heuristic search. Since learning is not attempted until a complete solution path has been found for a problem, credit for correct moves and blame for incorrect moves is easily assigned. We review four learning systems that have incorporated similar techniques to learn in the domains of algebra, symbolic integration, and puzzle-solving. We conclude that the basic approach of learning from solution paths can be applied to any situation in which problems can be solved by sequential search. Finally, we examine some potential difficulties that may arise in more complex domains, and suggest some possible extensions for dealing with them.

BBN's project in knowledge representation for natural language understanding is developing techniques for computer assistance to decision maker who is collecting information about and making choices in a complex situation. In particular, we are designing a system for natural language control of an intelligent graphics display. This system is intended for use in situation assessment and information management.

Research by members of the Department of Computer Science at Rutgers, and by their collaborators, is organized within the Laboratory for Computer Science research(LCSR). AI and AI-related applications are the major area of research within LCSR, with about forty people-faculty, staff and graduate students-currently involved in various aspects of AI research.

The Rete Match Algorithm is an efficient method for comparing a large collection of patterns to a large collection of objects. It finds all the objects that match each pattern. The algorithm was developed for use in production system interpreters, and it has been used for systems containing from a few hundred to more than a thousand patterns and objects. This article presents the algorithm in detail. It explains the basic concepts of the algorithm, it describes pattern and object representations that are appropriate for the algorithm, and it describes the operations performed by the pattern matcher.

ISIS-II takes a heuristic search approach to generating schedules. The key features of ISIS-II's approach is that it can represent and use a variety of different types of constraints to guide the search, and is able to selectively relax conflicting constraints. The plant under consideration** represents one of the most complex of scheduling tasks. The plant produces thousands of different parts,some of which are similar, some of which are not. Any part can be ordered in quantities from one to hundreds.

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.

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.

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.