The first is to have an adequate model of the cognitive state of other agents. The second is to form plans under the constraint of resource limitations: i.e., an agent does not always have an infinite amount of time to sit and think of plans while the world changes under him; he must act. These two problems are obviously interlinked since, to have a realistic model of the cognitive states of other agents, who are presumably similar to himself, an agent must reason about the resource limitations they are subject to in reasoning about the world. In this paper we address both problems with reference to AI planning system robots and one part of their cognitive state, namely beliefs. Our goal is to pursue what might be called robot psychology: to construct a plausible model of robot beliefs by examining robots' internal representations of the world.

I apologise for any mistakes or misinterpretations I may therefore have made. In October 1981,.Japan announced a national project to develop highly innovative computer systems for the 199Os, with the title "Fifth Generation Computer Systems " This paper is a personal view of that project, The fifth generation plan its significance, and reactions to it. In late 1978 the Japanese Ministry of International Trade THIS PAPER PRESENTS a personal view of the Japanese and Industry (MITI) gave ETL the task of defining a project Fifth Generation Computer Systems project.

We describe a program for verifying that a set of rules in an expert system comprehensively spans the knowledge of a specialized domain. The program has been devised and tested within the context of the ONCOCIN System, a rule-based consultant for clinical oncology. The stylized format of ONCOIN's rule has allowed the automatic detection of a number of common errors as the knowledge base has been developed. This capability suggests a general mechanism for correcting many problems with knowledge base completeness and consistency before they can cause performance errors.

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.

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.

Artificial intelligence is that part of computer science that concerns itself with the concepts and methods of symbolic inference and symbolic representation of knowledge. Its point of departure -- it's most fundamental concept -- is what Newell and Simon called (in their Turing Award Lecture) "the physical symbol system." But within the last fifteen years, it has concerned itself also with signals -- with the interpretation or understanding of signal data. AI researchers have discussed "signal-to symbol transformations," and their programs have shown how appropriate use of symbolic manipulations can be of great use in making signal processing more effective and efficient. Indeed, the programs for signal understanding have been fruitful, powerful, and among the most widely recognized of AI's achievements.

"The purpose of this paper is to compare various approaches to generalization in terms of a single framework. Toward this end, generalization is cast as a search problem, and alternative methods for generalization are characterized in terms of the search strategies that they employ. This characterization uncovers similarities among approaches, and leads to a comparison of relative capabilities and computational complexities of alternative approaches. The characterization allows a precise comparison of systems that utilize different representations for learned generalizations."Artificial Intelligence, 18 (2), 203-26.

Our own early attempts (as devoted users of LISP) to use PROLOG convinced us that it would be worth the effort to create within LISP a faithful implementation of Kowalski's logic programming idea. We felt it would be very convenient to be able to set up a knowledge base of assertions inside a LISP workspace, and to compute the answers to queries simply by executing appropriate function calls.In Hayes, J. E., Michie, D., and Pao, Y.-H. (Eds.), Machine Intelligence 10. Ellis Horwood.

This paper has three themes: (1) The task of acquiring and organizing the knowledge on which to base an expert system is difficult.(2) Inductive inference systems can be used to extract this knowledge from data.(3) The knowledge so obtained is powerful enough to enable systems using it to compete handily with more conventional algorithm-based systems.These themes are explored in the context of attempts to construct high-performance programs relevant to the chess endgame king-rook versus king-knight.In Hayes, J. E., Michie, D., and Pao, Y.-H. (Eds.), Machine Intelligence 10. Ellis Horwood.

R1, a knowledge-based configurer of VAX-11 computer systems, began to be used over a year ago by Digital Equipment Corporation's manufacturing organization. The success of this program and the existence at DEC of a newly formed group capable of supporting knowledge-based programs has led other groups at DEC to support the development of programs that can be used in conjunction with RI. This paper describes XSEL, a program being developed at Carnegie-Mellon University that will assist salespeople in tailoring computer systems to fit the needs of customers. XSEL will have two kinds of expertise: it will know how to select hardware and software components that fulfil the requirements of particular sets of applications, and it will know how to provide satisfying explanations in the computer system sales domain.