The Hearsay-H speech-understanding system (SUS) developed at Carnegie-Mellon University recognizes connected speech in a 1000-word vocabulary with correct interpretations for 90 percent of test sentences. Its basic methodology involves the application of symbolic reasoning as an aid to signal processing. A marriage of general artificial intelligence techniques with specific acoustic and linguistic knowledge was needed to accomplish satisfactory speech-This research was supported chiefly by Defense Advanced Research Projects Agency contract F44620-73- C-0074 to Carnegie-Mellon University. In addition, support for the preparation of this paper was provided by USC/ISI, Rand, and the University of Massachusetts. We gratefully acknowledge their support. Views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official opinion or policy of DARPA, the U.S. government, or any other person or agency connected with them.

"In the fall of 1978 we decided to produce a special issue of the SIGART Newsletter devoted to a survey of current knowledge representation research. We felt that there were twe useful functions such an issue could serve. First, we hoped to elicit a clear picture of how people working in this subdiscipline understand knowledge representation research, to illuminate the issues on which current research is focused, and to catalogue what approaches and techniques are currently being developed. Second -- and this is why we envisaged the issue as a survey of many different groups and projects -- we wanted to provide a document that would enable the reader to acquire at least an approximate sense of how each of the many different research endeavours around the world fit into the field as a whole. It would of course be impossible to produce a final or definitive document accomplishing these goals: rather, we hoped that this survey could initiate a continuing dialogue on issues in representation, a project for which this newsletter seems the ideal forum. It has been many months since our original decision was made, but we are finally able to present the results of that survey. Perhaps more than anything else, it has emerged as a testament to an astounding range and variety of opinions held by many different people in many different places. The following few pages are intended as an introduction to the survey as a whole, and to this issue of the newsletter. We will briefly summarize the form that the survey took, discuss the strategies we followed in analyzing and tabulating responses, briefly review the overall sense we received from the answers that were submitted, and discuss various criticisms which were submitted along with the responses. The remainder of the volume has been designed to be roughly self-explanatory at each point, so that one may dip into it at different places at will. Certain conventions, however, particularly regarding indexing and tabulating, will also be explained in the remainder of this introduction." ACM SIGART Newsletter No. 70.

The purpose of this research is to investigate the extent to which knowledge can replace and support search in selecting a chess move and to delineate the issues involved. This has been carried out by constructing a program. PARADISE (PArtern Recognition Applied to Directing SEarch), which finds the best move in tactically sharp middle game positions from the games of chess masters.

Frederick Hayes-Roth The RAND Corporation Using the concepts of stimulus and response frames of scheduled Knowledge source instantiations, competition among alternative responses, goals, and the desirability of a knowledge source instantiation, a general attentional control mechanism is developed. This general focusing mechanism facilitates the experimental evaluation of a variety of specific attentional control policies (such as best-first, bottom-up, and top-down search strategies) and allows the modular addition of specialized heuristics for the speech understanding task. Empirical results demonstrate the effectiveness of the focusing principles, and possible directions for future research are considered. INTRODUCTION The Hearsay-II (HSII) speech understanding system (Lesser, et al., 1974; Erman & Lesser, 1975; Lesser & Frman, 1977) is a complex, distributed-logic processing system. Inputs to the system are temporal sequences of sets of acoustic segments and associated hypothesized phonetic labels.

To choose their actions, reasoning programs must be able to make assumptions and subsequently revise their beliefs when discoveries contradict these assumptions. The Truth Maintenance System (TMS) is a problem solver subsystem for performing these functions by recording and maintaining the reasons for program beliefs. Such recorded reasons are useful in constructing explanations of program actions and in guiding the course of action of a problem solver. This paper describes (1) the representations and structure of the TMS, (2) the mechanisms used to revise the current set of beliefs, (3) how dependency-directed backtracking changes the current set of assumptions, (4) techniques for summarizing explanations of beliefs, (5) how to organize problem solvers into "dialectically arguing" modules, (6) how to revise models of the belief systems of others, and (7) methods for embedding control structures in patterns of assumptions. We stress the need of problem solvers to choose between alternative systems of beliefs, and outline a mechanism by which a problem solver can employ rules guiding choices of what to believe, what to want, and what to do.Artificial Intelligence 12(3):231-272

Our purpose in studying natural language understanding in conjunction with problem solving is to bring together the constraints of what formal representation can actually be obtained with the question of what knowledge is required in order to solve a wide range of problems in a semantically rich domain. We believe that these issues cannot sensibly be tackled in isolation. In practical terms we have had the benefits of an increased awareness of common problems in both areas and a realisation that some of our techniques are applicable to both the control of inference and the control of parsing. Early work on solving mathematical problems stated in natural language was done by Bobrow (STUDENT - (i]) and Chamiak (CARPS - [5]). However the rudimentary parsing and simple semantic structures used by Bobrow and Charniak are inadequate for any but the easiest problems. Our intention has been to build on B/RG Chris This work was supported by SRC grant number 94493 and an SRC research studentship for Mellish.

This work is an attempt to formally represent the knowledge required for the solution of a difficult retrograde chess problem (figure I). This solution Includes the extension of a formal deductive system to Include an observational facility. FOL [9], we have detailed a proof of the solution of the puzzle, Including proofs for almost all of the necessary associated lemmas [2], We shall highlight the various representational decisions made In the process of axiomatiiing retrograde chess, discussing both the necessity for these particular choices, and their Implications for designers of representations for other domains. This work is part of the search for epistemologically effective formalisms for artificial Intelligence.

This approach leads to an infinite sequence of algorithms I. Surface Models

I will remain Ion8 and deeply indebted to Herb Simon, H. T. Kung, AI Newell, Jay

The Sphinx once challenged a particularly tasty-looking student of language to solve the riddle: "How is saying'My toc is turning blue,' as a request to get off my toe, similar to slamming a door in someone's face?" The poor student stammered that in both cases, when the agents are trying to communicate something, they have analogous intentions. "Yes indeed" countered the Sphinx, "but what are those intentions?" Hearing no reply, the monster promptly devoured the poor student and sat back smugly to wait for the next oral exam. The research described herein was supported primarily by the National Research Council of Canada, and also by the National Institute of Education under Contract US-N1E-C-400-76-0116, the Department of Computer Science of the University of Tor3nto, and by a summer graduate student associateship (1975) to Cohen from the International Business Machines Corporation.