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.

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.

Finally, abstraction can be extended to involve multiple complexity. In particular, one of the most costly behaviors levels, leading to a hierarchy of plans, each serving as a of the basic problem solving strategies is their inefficiency skeleton for the problem solving process at the next level in dealing with goal descriptions that include conjunctions. of detail. The search process at each level of detail can Because there is usually no good reason for the problem thus be reduced to a sequence of relatively simple solver to prefer to attack one conjunct before another, an subproblems of achieving the preconditions of the next incorrect ordering will often be chosen. This can lead to step in the skeleton plan from an initial state in which the an extensive search for a sequence of actions to try to previous step in the skeleton plan has just been achieved.

A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity.

In IJCAI-81, pp. 67–69.

Biological Cybernetics, 40 (3), 201-11

Artificial Intelligence

Summary of PhD thesis, Computer Science Department, Stanford University, January, 1980,Stanford Rep. Nos. HPP-80-2, STAN-CS-80-784

Two premises, reflected in the title, underlie the perspective from which I will consider research in natural language processing in this article. First, progress on building computer systems that process natural languages in any meaningful sense (i.e., systems that interact reasonably with people in natural language) requires considering language as part of a larger communicative situation. Second, as the phrase “utterance and objective” suggests, regarding language as communication requires consideration of what is said literally, what is intended, and the relationship between the two.