This paper discusses a number of problems faced in communicating expertise and common sense to a computer, and the approaches taken by several current knowledge representation languages towards solving these problems. The ...

In order to be able to design a control system for high-speed control of mechanical manipulators, it is necessary to understand properly their dynamics. Here we present an analysis of a detailed model of a three-link device ...

The goal of this research was to assist in the creation of a new, improved Wumpus advisor by taking protocols of ten people learning to play Wumpus with a human coach. It was hoped that by observing these subjects learn ...

A representation for numbers using two computer words is discussed, where the value represented is the ratio of the corresponding integers. This allows for better dynamic range and relative accuracy than single-precision ...

We have implemented an interpreter for a rule-based system, AMORD, based on a non-chronological control structure and a system of automatically maintained data-dependencies. The purpose of this paper is tutorial. We wish ...

The plan method analyzes the structure of a program. The plan which results from applying the method represents this structure by specifying how the parts of the program interact. This paper demonstrates the utility of the ...

PLASMA (for PLAnner-like System Modeled on Actors) is a message-passing computer language based on actor semantics. Since every event in the system is the receipt of a message actor by a target actor, a complete history ...

This paper describes a method for finding such topographical features as ridges and valleys in a given terrain. Contour lines are used to obtain the desired result.

A system is proposed capable of generating narrative computer animation in response to a simple script. The major problem addressed is how to imbed into the system some of the knowledge that animators use when creating ...

This paper summarizes the design and implementation of the "semantics" module of a natural language undertanding system for the personal assistant domain. This module includes mappings to deep frames, noun phrase referencing ...

This paper is an experimental investigation of the utility of the MIT-AI frames system. Using this system, a birthday party planning system was written, representing the basic decisions that comprise such a plan as frames. ...

A real-time list processing system is one in which the time required by each elementary list operation (CONS, CAR, CDR, RPLACA, RPLACD, EQ, and ATOM in LISP) is bounded by a (small) constant. Classical list processing ...

Shallow binding is a scheme which allows the value of a variable to be accessed in a bounded amount of computation. An elegant model for shallow binding in LISP 1.5 is presented in which context-switching is an environment ...

This paper is divided into two parts. The first part deals with cryptosystems and cryptanalysis. It surveys the basic information about cryptosystems and then addresses two specific questions. Are cryptosystems such as ...

This paper presents some "laws" that must be satisfied by computations involving communicating parallel processes. The laws take the form of stating restrictions on the histories of computations that are physically realizable. ...

Message passing is directed toward the production of programs that are intended to execute efficiently in a computing environment with a large number of processors. The paradigm attempts to address the computational issues ...

The appearance of a surface depends dramatically on how it is illuminated. In order to interpret properly satellite and aerial imagery, it is necessary to know the position of the sun in the sky. This is particularly ...

Some researchers, notably Schank and Abelson, (1975) have argued for the existence of large numbers of scripts as a representation for complex events. This paper adopts a different viewpoint. I consider complex events to ...

This paper investigates some problems associated with an argument evaluation order that we call "future" order, which is different from both call-by-name and call-by-value. In call-by-future, each formal parameter of a ...