Goto

Collaborating Authors

 Genre


Solving Mechanics problems using meta-level inference

Classics

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.


Interactive transfer of expertise: Acquisition of new inference rules

Classics

Summary of Ph.D. dissertation, Computer Science Dept., Stanford University (1979)."TEIRESIAS is a program designed to provide assistance on the task of building knowledge-based systems. It facilitates the interactive transfer of knowledge from a human expert to the system, in a high level dialog conducted in a restricted subset of natural language. This paper explores an example of TEIRESIAS in operation and demonstrates how it guides the acquisition of new inference rules. The concept of meta-level knowledge is described and illustrations given of its utility in knowledge acquisition and its contribution to the more general issues of creating an intelligent program."Also in:Readings in Artificial Intelligence, ed. Webber, Bonnie Lynn and Nils J. Nilsson, Palo Alto, CA: Tioga Publishing Co., 1981.Orig. in IJCAI-77, vol.1, pp. 321 ff. Preprint in Stanford HPP Report #HPP-77-9.See also: Artificial Intelligence, 12[#2]:409-427. Readings in Artificial Intelligence, ed. Webber, Bonnie Lynn and Nils J. Nilsson, Palo Alto, CA: Tioga Publishing Co., 1981


The B* tree search algorithm: A best-first proof procedure

Classics

Searches are conducted whenever selection cannot be done effectively by computing a function of some state description of the competing alternatives.



Prototypes and production rules: An approach to knowledge representation for hypothesis formation

Classics

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.


Region extraction and shape analysis of aerial photographs

Classics

A new system for the analysis of aerial photographs of suburban areas is presented. In this system, regions are characterized by various spectral and spatial features such as brightness, color, size, shape, texture, and spatial relationships with other regions. The analysis proceeds from a global survey of the picture to the detailed analysis of specific regions. The former process extracts several kinds of characteristic regions which are supposed to include specific objects by using knowledge-free picture processing programs. In the detailed analysis, several object-detection programs perform parallel analysis of extracted characteristic regions in detail to recognize objects such as crop fields, woods, roads, and houses.


The Computer Revolution in Philosophy

Classics

"Computing can change our ways of thinking about many things, mathematics, biology, engineering, administrative procedures, and many more. But my main concern is that it can change our thinking about ourselves: giving us new models, metaphors, and other thinking tools to aid our efforts to fathom the mysteries of the human mind and heart. The new discipline of Artificial Intelligence is the branch of computing most directly concerned with this revolution. By giving us new, deeper, insights into some of our inner processes, it changes our thinking about ourselves. It therefore changes some of our inner processes, and so changes what we are, like all social, technological and intellectual revolutions." This book, published in 1978 by Harvester Press and Humanities Press, has been out of print for many years, and is now online, produced from a scanned in copy of the original, digitised by OCR software and made available in September 2001. Since then a number of notes and corrections have been added. Atlantic Highlands, NJ: Humanities Press.


Models of learning systems

Classics

"The terms adaptation, learning, concept-formation, induction, self-organization, and self-repair have all been used in the context of learning system (LS) research. The research has been conducted within many different scientific communities, however, and these terms have come to have a variety of meanings. It is therefore often difficult to recognize that problems which are described differently may in fact be identical. Learning system models as well are often tuned to the require- ments of a particular discipline and are not suitable for application in related disciplines."In Encyclopedia of Computer Science and Technology, Vol. 11. Dekker


Segmentation of static scenes

Classics

A wide range of segmentation techniques continues to evolve in the literature on scene analysis. Many of these approaches have been constrained to limited applications or goals. This survey analyzes the complexities encountered in applying these techniques to color images of natural scenes involving complex textured objects. It also explores new ways of using the techniques to overcome some of the problems which are described. An outline of considerations in the development of a general image segmentation system which can provide input to a semantic interpretation process is distributed throughout the paper.


An improved bi-directional heuristic search algorithm

Classics

There are a number of transportation applications that require the use of a heuristic shortest path algorithm rather than one of the standard, optimal algorithms. This is primarily due to the requirements of some transportation applications where shortest paths need to be quickly identified either because an immediate response is required (e.g., in-vehicle route guidance systems) or because the shortest paths need to be recalculated repeatedly (e.g., vehicle routing and scheduling). For this reason a number of heuristic approaches have been advocated for decreasing the computation time of the shortest path algorithm. This paper presents a survey review of various heuristic shortest path algorithms that have been developed in the past. The goal is to identify the main features of different heuristic strategies, develop a unifying classification framework, and summarize relevant computational experience.