Chevron Canada is decentralizing its computer environment from mainframes to PCs e Emission Reduction Research mounted infantry virtual environment) and Sun workstations. The DIVE belt provides the Chevron oil exploration crews will be N.J.) has developed the Batch Design ability to operate inside a virtual environment able to retrieve various types of well Kit, an expert system for optimizing without becoming tangled batch processes and minimizing pollution. Funded by the U.S. The system will help eliminate Army, the DIVE project is designed to ADVANTA Mortgage (San Diego, avoidable pollution and save pharmaceutical allow soldiers to operate within a virtual Cal.) has signed a license agreement and chemical manufacturers battlefield. VR is being used to demonstrate used as the focal point of exhibition fire engineering principles such The Santa Fe Institute (Santa Fe, stands designed by Photosound for as means of escape theory, fire modeling, N.M.) has won an ARPA grant of such pharmaceutical firms as Smith-human behavior, and spatial $323,000 for research on complex Kline Beecham. The system will be designed advanced computin arena.

Over 60 researchers from 10 countries took part in the Third Knowledge Discovery in Databases (KDD) Workshop, held during the Eleventh National Conference on Artificial Intelligence in Washington, D.C. A major trend evident at the workshop was the transition to applications in the core KDD area of discovery of relatively simple patterns in relational databases; the most successful applications are appearing in the areas of greatest need, where the databases are so large that manual analysis is impossible. Progress has been facilitated by the availability of commercial KDD tools for both generic discovery and domain-specific applications such as marketing. At the same time, progress has been slowed by problems such as lack of statistical rigor, overabundance of patterns, and poor integration. Besides applications, the main themes of this workshop were (1) the discovery of dependencies and models and (2) integrated and interactive KDD systems.

The field of knowledge engineering has been one of the most visible successes of AI to date. Knowledge acquisition is the main bottleneck in the knowledge engineer's work. Machine-learning tools have contributed positively to the process of trying to eliminate or open up this bottleneck, but how do we know whether the field is progressing? How can we determine the progress made in any of its branches? How can we be sure of an advance and take advantage of it? This article proposes a benchmark as a classificatory, comparative, and metric criterion for machine-learning tools. The benchmark centers on the knowledge engineering viewpoint, covering some of the characteristics the knowledge engineer wants to find in a machine-learning tool. The proposed model has been applied to a set of machine-learning tools, comparing expected and obtained results. Experimentation validated the model and led to interesting results.

This report summarizes this year's workshop and outlines WET to underwrite and support these workshops. Information Systems is also acknowledged. The Defense Advanced this year's workshop and outlines the philosophy behind this annual event. Computer-Supported Cooperative and present the best research Finally, I would like to thank V. Work gathering, which takes in that has a bearing on the "repersonalization Jagannathan for his great help and everyone from anthropologists to of computing," as Fernando expertise in workshop management futurists, this workshop focuses on flores, founder of Action Technologies, and Mary Carriger for relieving me of hardware and software that enables puts it.

What criteria should be used to select one semantic formalism over another? However, the scope of analyze and gain insight into (that is, models for circumscription, perfect convergence results linking aspects of not just model) such a task. Although much basic problems are NP hard (at best). Ginsberg and Hugh Holbrook work remains to be done, the consensus His point was that just confirming (Stanford University) showed seems to be that there is sufficient that this problem is indeed potentially that default reasoning could be used common ground to warrant serious nasty is not really surprising. Marco Cadoli and as well as to somehow cope with the significant computational advantages.

The Association for the Advancement of Artificial Intelligence (AAAI) held its 1994 Spring Symposium Series on 19-23 March at Stanford University, Stanford, California. This article contains summaries of 10 of the 11 symposia that were conducted: Applications of Computer Vision in Medical Image Processing; AI in Medicine: Interpreting Clinical Data; Believable Agents; Computational Organization Design; Decision-Theoretic Planning; Detecting and Resolving Errors in Manufacturing Systems; Goal-Driven Learning; Intelligent Multimedia, Multimodal Systems; Software Agents; and Toward Physical Interaction and Manipulation. Papers of most of the symposia are available as technical reports from AAAI.

This report stems from an April 1994 meeting, organized by AAAI at the suggestion of Steve Cross and Gio Wiederhold.1 The purpose of the meeting was to assist ARPA in defining an agenda for foundational AI research. Prior to the meeting, the fellows and officers of AAAI, as well as the report committee members, were asked to recommend areas in which major research thrusts could yield significant scientific gain -- with high potential impact on DOD applications -- over the next ten years. At the meeting, these suggestions and their relevance to current national needs and challenges in computing were discussed and debated. An initial draft of this report was circulated to the fellows and officers. The final report has benefited greatly from their comments and from textual revisions contributed by Joseph Halpern, Fernando Pereira, and Dana Nau.

Efficient indexing schemes have influenced the acceptance of production systems in the industrial world. However, in embedded-control systems, production systems have not been applied intensively because of their nondeterministic run-time behavior. Thus, nonpredictability of response times is a major obstacle to the widespread use of expert systems in the real-time domain. The RETE and TREAT algorithms and their offspring play a major role in the implementation of efficient pattern-matching systems. Therefore, it is worthwhile to investigate run-time predictability for these match algorithms. This article presents three different schemes for estimating the time needed for operations in the production-system execution model.

Given a knowledge base KB containing first-order and statistical facts, we consider a principled method, called the random-worlds method, for computing a degree of belief that some formula Phi holds given KB. If we are reasoning about a world or system consisting of N individuals, then we can consider all possible worlds, or first-order models, withdomain {1,...,N} that satisfy KB, and compute thefraction of them in which Phi is true. We define the degree of belief to be the asymptotic value of this fraction as N grows large. We show that when the vocabulary underlying Phi andKB uses constants and unary predicates only, we can naturally associate an entropy with each world. As N grows larger,there are many more worlds with higher entropy. Therefore, we can usea maximum-entropy computation to compute the degree of belief. This result is in a similar spirit to previous work in physics and artificial intelligence, but is far more general. Of equal interest to the result itself are the limitations on its scope. Most importantly, the restriction to unary predicates seems necessary. Although the random-worlds method makes sense in general, the connection to maximum entropy seems to disappear in the non-unary case. These observations suggest unexpected limitations to the applicability of maximum-entropy methods.

Information extraction is the task of automaticallypicking up information of interest from an unconstrained text. Informationof interest is usually extracted in two steps. First, sentence level processing locates relevant pieces of information scatteredthroughout the text; second, discourse processing merges coreferential information to generate the output. In the first step, pieces of information are locally identified without recognizing any relationships among them. A key word search or simple patternsearch can achieve this purpose. The second step requires deeperknowledge in order to understand relationships among separately identified pieces of information. Previous information extraction systems focused on the first step, partly because they were not required to link up each piece of information with other pieces. To link the extracted pieces of information and map them onto a structuredoutput format, complex discourse processing is essential. This paperreports on a Japanese information extraction system that merges information using a pattern matcher and discourse processor. Evaluationresults show a high level of system performance which approaches human performance.