Home → Magazine Archive → April 1988 (Vol. 31, No. 4)
Table of Contents
Authors
Rosalie Steier
Page 369
President's letter
Paul Abrahams
Pages 370-371
Viewpoint
John Shore
Pages 372-375
ACM forum
Robert L. Ashenhurst
Pages 376-381
Reasoning with worlds and truth maintenance in a knowledge-based programming environment
In traditional knowledge-based system development environments, the fundamental representational building blocks are mechanisms such as frames, rules, and attached procedures. The KEE system has been extended to include both
…
Robert Filman
Pages 382-401
Undebuggability and cognitive science
A resource-realistic perspective suggests some indispensable features for a computer program that approximates all human mentality. The mind's program would differ fundamentally more from familiar types of software. These features …
Christopher Cherniak
Pages 402-412
Relational database design using an object-oriented methodology
Of the many approaches to relational database design, the Object Modeling Technique (OMT) is particularly effective. A comprehensive explanation and two applications show the semantic improvement of OMT over other approaches. …
Michael R. Blaha, William J. Premerlani, James E. Rumbaugh
Pages 414-427
Cost/benefit analysis for incorporating human factors in the software lifecycle
New software engineering techniques and the necessity to improve the user interface in increasingly interactive software environments have led to a change in traditional software development methods. Methodologies for improvement …
Marilyn M. Mantei, Toby J. Teorey
Pages 428-439
Computing Poisson probabilities
We propose an algorithm to compute the set of individual (nonnegligible) Poisson probabilities, rigorously bound truncation error, and guarantee no overflow or underflow. Work and space requirements are modest, both proportional …
Bennett L. Fox, Peter W. Glynn
Pages 440-445
Dynamic hash tables
Linear hashing and spiral storage are two dynamic hashing schemes originally designed for external files. This paper shows how to adapt these two methods for hash tables stored in main memory. The necessary data structures and …
Per-Ake Larson
Pages 446-457