A numeric representation of uncertain and incomplete sensor knowledge called certainty grids was used successfully in several recent mobile robot control programs developed at the Carnegie-Mellon University Mobile Robot Laboratory (MRL). The certainty grid representation will allow this map to be incrementally updated in a uniform way based on information coming from various sources, including sonar, stereo vision, proximity, and contact sensors. The map will be used by planning programs to choose clear paths, identify locations (by correlating maps), identify well-known and insufficiently sensed terrain, and perhaps identify objects by shape. The certainty grid representation can be extended in the time dimension and used to detect and track moving objects.

This is Part 2 of a two-part article and discusses issues of tort liability and the use of computers in the courtroom. Part 1 of this article, which appeared in the Spring 1988 issue of AI Magazine, discussed steps that developers of AI systems can take to protect their efforts, and the attendant legal ambiguities that must eventually be addressed in order to clarify the scope of such protection. Part 2 explores the prospect of AI systems as subjects of litigation.

A fundamental goal of computer vision is the development of systems capable of carrying out scene interpretation while taking into account all the available knowledge. In this article, we focus on how the interpretation task can be aided by the expected scene information (such as map knowledge), which, in most cases, would not be in registration with the perceived scene. The system is implemented as a two-panel, six-level blackboard and uses the Dempster-Shafer formalism to accomplish inexact reasoning in a hierarchical space. Inexact reasoning involves exploiting, at different levels of abstraction, any internal geometric consistencies in the data and between the data and the expected scene.

We propose an approach for meeting real-time constraints in AI systems that views (1) time as a resource that should be considered when making control decisions, (2) plans as ways of expressing control decisions, and (3) approximate processing as a way of satisfying time constraints that cannot be achieved through normal processing.

The second Natural Language Understanding and Logic Programming (NLULP) Workshop was held on 17-19 August 1987 at Simon Fraser University, Vancouver, British Columbia, Canada, (the first NLULP workshop was held three years ago in Rennes, France).

The Computing Research Laboratory (CRL) at New Mexico State University is a center for research in artificial intelligence and cognitive science. Specific areas of research include the human-computer interface, natural language understanding, connectionism, knowledge representation and reasoning, computer vision, robotics, and graph theory. This article describes the ongoing projects at CRL.

An informal workshop on concurrent logic programming, metaprogramming, and open systems was held at Xerox Palo Alto Research Center (PARC) on 8-9 September 1987 with support from the Association for the Advancement of Artificial Intelligence. The 50 workshop participants came from the Japanese Fifth Generation Project (ICOT), the Weizmann Institute of Sci-ence in Israel, Imperial College in London, the Swedish Institute of Computer Science, Stanford University, the Mas-sachusetts Institute of Technology (MIT), Carnegie Mellon University (CMU), Cal Tech, Science University of Tokyo, Melbourne University, Calgary University, University of Wisconsin, Case Western Reserve, University of Oregon, Korea Advanced Institute of Science and Technology (KAIST), Quintus, Symbolics, IBM, and Xerox PARC. No proceedings were generated; instead, participants distributed copies of drafts, slides, and recent papers.

The Yale Artificial Intelligence Project: A Brief History

An important task in postal automation technology is determining the position and orientation of the destination address block in the image of a mail piece such as a letter, magazine, or parcel. Analysis of physical characteristics of mail pieces indicates that in order to automate the address finding task, several different image analysis operations are necessary. Some examples are locating a rectangular white address label on a multicolor background, progressively grouping characters into text lines and text lines into text blocks, eliminating candidate regions by specialized detectors (for example, detecting regions such as postage stamps), and identifying handwritten regions. Described here are several operations, their utility as predicted by statistics of mail piece characteristics, and the results of applying the operations to a task set of mail piece images.

A number of tools that support the development, execution, and maintenance of knowledge-based systems are marketed commercially. Many of these tools, however, are designed for applications that can be executed on personal computers and are not suitable for building large knowledge-based systems. The market for knowledge engineering tools designed for applications that require the computational power of a Lisp machine or an engineering workstation is dominated by a few vendors. This article is an assessment of the current state of tools used to build large knowledge-based systems.