Empirical evidence suggests that searching deeper in game trees using the minimax propagation rule usually improves the quality of decisions significantly. However, despite many recent theoretical analyses of the effects of minimax look ahead, however, this phenomenon has still not been convincingly explained. Instead, much attention has been given to so-called pathological behavior, which occurs under certain assumptions. This article supports the view that pathology is a direct result of these underlying theoretical assumptions. Pathology does not occur in practice, because these assumptions do not apply in realistic domains. The article presents several arguments in favor of minimaxing and focuses attention on the gap between their analytical formulation and their practical meaning. A new model is presented based on the strict separation of static and dynamic aspects in practical programs. finally, certain methods of improving minimax look-ahead are discussed, drawing on insights gained from this research.

The goal of intelligent computer-aided engineering (ICAE) is to construct computer programs that capture a significant fraction of an engineer's knowledge. Today, ICAE systems are a goal, not a reality. This article attempts to refine that goal and suggest how to get there. We begin by examining several scenarios of what ICAE systems could be like. Next we describe why ICAE won't evolve directly from current applications of expert system technology to engineering problems. I focus on qualitative physics as a critical area where progress is needed, both in terms of representations and styles of reasoning.

In this article, I discuss the emerging field of artificial intelligence and legal reasoning and review the new book by Anne v.d.L. Gardner, An Artificial Intelligence Approach to Legal Reasoning, published by Bradford/MIT Press (1987, 225 pp., $22.50) as the first book in its new series on the subject.

New Hitech Computer Chess Success

Carnegie-Mellon University's Hitech chess computer scored 5-1 in the National Open Chess Championships held in Chicago March 18-20. The Championship Section in which Hitech competed, had 380 entries. Carnegie-Mellon University's Hitech chess computer scored 5-1 in the National Open Chess Championships held in Chicago March 18-20. The Championship Section in which Hitech competed, had 380 entries.

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.

The capabilities for representing and reasoning about three-dimensional (3-D) objects are essential for knowledge-based, 3-D photointerpretation systems that combine domain knowledge with image processing, as demonstrated by 3- D Mosaic and ACRONYM. Three-dimensional representation of objects is necessary for many additional applications, such as robot navigation and 3-D change detection. Geometric reasoning is especially important because geometric relationships between object parts are a rich source of domain knowledge. A practical framework for geometric representation and reasoning must incorporate projections between a two-dimensional (2-D) image and a 3-D scene, shape and surface properties of objects, and geometric and topological relationships between objects. In addition, it should allow easy modification and extension of the system's domain knowledge and be flexible enough to organize its reasoning efficiently to take advantage of the current available knowledge. We are developing such a framework -- the Frame-based Object Recognition and Modeling (3-D FORM) System. This system uses frames to represent objects such as buildings and walls, geometric features such as lines and planes, and geometric relationships such as parallel lines. Active procedures attached to the frames dynamically compute values as needed. Because the order of processing is controlled largely by the order of slot access, the system performs both top-down and bottom-up reasoning, depending on the current available knowledge. The FORM system is being implemented with the Carnegie-Mellon University-built Framekit tool in Common Lisp (Carbonell and Joseph 1986). To date, it has been applied to two types of geometric reasoning problems: interpreting 3-D wire frame data and solving sets of geometric constraints.

This is a summary of the Workshop on Planning that was sponsored by the Defense Advanced Research Project Agency and held in Santa Cruz, California, on October 21-23, 1987. The purpose of this workshop was to identify and explore new directions for research in planning.

It was felt that the AIM Szolovits responding, and "Uncertainty approaches, augmenting explanations