The Innovative Applications of Artificial Intelligence Conference was held 18-22 July 1999 in Orlando, Florida. Ramasamy Uthurusamy was the Program Chair and Barbara Hayes-Roth was the Program Co-Chair. Although all the IAAI-99 papers and talks were certainly interesting and important, we present in this special issue of AI Magazine only a select subset because of page and other limitations. We include two invited talks and four applications as a snapshot of IAAI-99.

Finally, during knowledge refinement, the models are validated through simulation on paper or with prototyping, and the knowledge bases medicine, car troubleshooting, software are refined. The last of the book's authors domain-specific knowledge, and corrections or extensions to the products has been involved in this effort since standardizing the design and development of earlier ones. Thus, the book of expert systems then became The book is intended for practitioners is particularly interesting to those who the major research problems of the in knowledge management. The have been following their work. KADS methodology, as assets have become commonplace.

Based Search," by Peter Clark, John Thompson, Heather Holmback, and Lizbeth Duncan of the Boeing Co., demonstrated a concept-based search engine using an AI thesaurus with unambiguous control terms and relationships for ontology links for finding relevance when searching for human experts in the field.

The Fifth International Conference on Artificial Intelligence Planning and Scheduling (AIPS 2000) was held on 14-17 April 2000 at Breckenridge, Colorado; it was colocated with the Seventh International Conference on Principles of Knowledge Representation and Reasoning (KR2000). This conference brought together researchers working in all aspects of problems in planning, scheduling, planning and learning, and plan execution for dealing with complex problems.

Enabling organizations to capture, share, and apply the collective experience and know-how of their people is seen as fundamental to competing in the knowledge economy. As a result, there has been a wave of enthusiasm and activity centered on knowledge management. To make progress in this area, issues of technology, process, people, and content must be addressed. In this article, we develop a road map for knowledge management. It begins with an assessment of the current state of the practice, using examples drawn from our experience at Schlumberger. It then sketches the possible evolution of technology and practice over a 10-year period. Along the way, we highlight ways in which AI technology, present and future, can be applied in knowledge management systems.

In addition, to cope with conflicts caused by changes in actual operations, the airport authority also needs to make real-time problem-solving decisions on stand reassignments. the Hong Kong International Airport The stand-allocation system ( Figure world's busiest international airports in terms 1 is a snapshot of the The Although there were some initial hitches when system is installed and used in the Airport the new airport opened on 6 July 1998, operations Control Center (ACC), which is located in the quickly returned to normal within a control tower. Within a month, operational statistics management, and reactive scheduling capabilities surpassed those of the old airport--80 for stand management. The system supports percent of all flights were on time or within 15 concurrent use by multiple operators in minutes of schedule, all passengers cleared nonstop 24-hour-a-day operations because immigration within 15 minutes, and average HKIA is a 24-hour airport. Typically, a human operator must have several years of experience to acquire enough knowledge about airport operations before he/she can produce a "good" quality stand-assignment plan. Generating an allocation plan manually not only requires a highly experienced individual but is also very time consuming because it requires balancing many objectives against many possible alternatives.

In science, business, and policymaking--anywhere data are used in prediction--two sorts of problems requiring very different methods of analysis often arise. The first, problems of recognition and classification, concerns learning how to use some features of a system to accurately predict other features of that system. The second, problems of causal discovery, concerns learning how to predict those changes to some features of a system that will result if an intervention changes other features. This book is about the second--much more difficult--type of problem. The contributors discuss recent research and applications using Bayes nets or directed graphic representations, including representations of feedback or "recursive" systems. The book contains a thorough discussion of foundational issues, algorithms, proof techniques, and applications to economics, physics, biology, educational research, and other areas. ISBN 0-262-57124-2 426 pp., bibliography, index Published by AAAI Press - http://www.aaai.org/Press/

This article describes a methodology for programming robots known as probabilistic robotics. The probabilistic paradigm pays tribute to the inherent uncertainty in robot perception, relying on explicit representations of uncertainty when determining what to do. This article surveys some of the progress in the field, using in-depth examples to illustrate some of the nuts and bolts of the basic approach. My central conjecture is that the probabilistic approach to robotics scales better to complex real-world applications than approaches that ignore a robot's uncertainty.

In this project, we have developed the ramp activity coordination expert system (races) to solve aircraft-parking problems. races includes a knowledge-based scheduling system that assigns all daily arriving and departing flights to the gates and remote spots with domain-specific knowledge and heuristics acquired from human experts. races processes complex scheduling problems such as dynamic interrelations among the characteristics of remote spots-gates and aircraft with various other constraints, for example, customs and ground-handling factors, at an airport. By user-driven modeling for end users and near-optimal knowledge-driven scheduling acquired from human experts, races can produce parking schedules for about 400 daily flights in approximately 20 seconds; human experts normally take 4 to 5 hours to do the same. Scheduling results in the form of Gantt charts produced by races are also accepted by the domain experts. races is also designed to deal with the partial adjustment of the schedule when unexpected events occur. After daily scheduling is completed, the messages for aircraft change, and delay messages are reflected and updated into the schedule according to the knowledge of the domain experts. By analyzing the knowledge model of the domain expert, the reactive scheduling steps are effectively represented as the rules, and the scenarios of the graphic user interfaces are designed. Because the modification of the aircraft dispositions, such as aircraft changes and cancellations of flights, is reflected in the current schedule, the modification should be sent to races from the mainframe for the reactive scheduling. The adjustments of the schedule are made semiautomatically by races because there are many irregularities in dealing with the partial rescheduling.

Recently model checking representation and search techniques were shown to be efficiently applicable to planning, in particular to non-deterministic planning. Such planning approaches use Ordered Binary Decision Diagrams (OBDDs) to encode a planning domain as a non-deterministic finite automaton and then apply fast algorithms from model checking to search for a solution. OBDDs can effectively scale and can provide universal plans for complex planning domains. We are particularly interested in addressing the complexities arising in non-deterministic, multi-agent domains. In this article, we present UMOP, a new universal OBDD-based planning framework for non-deterministic, multi-agent domains. We introduce a new planning domain description language, NADL, to specify non-deterministic, multi-agent domains. The language contributes the explicit definition of controllable agents and uncontrollable environment agents. We describe the syntax and semantics of NADL and show how to build an efficient OBDD-based representation of an NADL description. The UMOP planning system uses NADL and different OBDD-based universal planning algorithms. It includes the previously developed strong and strong cyclic planning algorithms. In addition, we introduce our new optimistic planning algorithm that relaxes optimality guarantees and generates plausible universal plans in some domains where no strong nor strong cyclic solution exists. We present empirical results applying UMOP to domains ranging from deterministic and single-agent with no environment actions to non-deterministic and multi-agent with complex environment actions. UMOP is shown to be a rich and efficient planning system.