My Ph.D. dissertation (Calistri 1990) extends traditional methods of plan recognition to handle situations in which agents have flawed plans. This extension involves solving two problems: determining what sorts of mistakes people make when they reason about plans and figuring out how to recognize these mistakes when they occur. I have developed a complete classification of plan-based misconceptions, which categorizes all ways that a plan can fail, and I have developed a probabilistic interpretation of these misconceptions that can be used in principle to guide a best-first search algorithm. I have also developed a program called Pathfinder that embodies a practical implementation of this theory.

This article describes a task-specific, domain-independent architecture for candidate evaluation. I discuss the task-specific architecture approach to knowledge-based system development. Finally, I describe a task-specific expert system shell, which includes a development environment (Ceved) and a run-time consultation environment (Ceval). This shell enables nonprogramming domain experts to easily encode and represent evaluation-type knowledge and incorporates the encoded knowledge in performance systems.

There has been a good deal of discussion recently about the possibility of standardizing knowledge representation efforts, including the development of an interlingua, or knowledge interchange format (KIF), that would allow developers of declarative knowledge to share their results with other AI researchers. In this article, I examine the practicality of this idea. I present some philosophical arguments against it, describe a straw-man KIF, and suggest specific experiments that would help explore these issues.

In my Ph.D. dissertation (Bhansali 1991), I develop an integrated knowledge-based framework for efficiently synthesizing programs by bringing together ideas from the fields of software engineering (software reuse, domain modeling) and AI (hierarchical planning, analogical reasoning). Based on this framework, I constructed a prototype system, APU, that can synthesize UNIX shell scripts from a high-level specification of problems typically encountered by novice shell programmers. An empirical evaluation of the system's performance points to certain criteria that determine the feasibility of the derivational analogy approach in the automatic programming domain when the cost of detecting analogies and recovering from wrong analogs is considered.

A five-year project, it is aimed at promoting cooperation among research centers, developing state-of-the art training and teaching programs, and demonstrating KBCS solutions to selected socioeconomic problems.

Engineering and scientific education condition us to expect everything, including intelligence, to have a simple, compact explanation. Today, some researchers who seek a simple, compact explanation hope that systems modeled on neural nets or some other connectionist idea will quickly overtake more traditional systems based on symbol manipulation. Others believe that symbol manipulation, with a history that goes back millennia, remains the only viable approach. AI is not like circuit theory and electromagnetism.

It is consistent with much that psychologists have observed in the natural problem solving people do. Psychologists have also observed, however, that people have several problems in doing analogical or case-based reasoning. I present case-based decision aiding as a methodology for building systems in which people and machines work together to solve problems. The case-based decision-aiding system augments the person's memory by providing cases (analogs) for a person to use in solving a problem.

Review of Artificial Intelligence, Simulation, and Modeling

Review of Expert Systems in Business: A Practical Approach