I was asked to give a visionary talk about the future applications of Artificial Intelligence technology; but I should warn you that I'm actually not very good as a visionary. Most of my predictions about what will happen in the industry don't come true even though they ought to. So I'm not going to tell you what the future holds; what I will do is to point out some of the technological trends that are at work. The outline of the talk is as follows: I'll start off by looking at the previous IAAI conferences and reflect on what we've learned from them. Then I'll look at what's changing in the hardware base that sets the context for all the computer applications we do. I think that will lead to interesting new viewpoints. Next I'll sketch what applications might arise from this new viewpoint. Finally, I'll discuss how the development of practical applications ought to interact with the scientific enterprise of trying to understand intelligence, in particular, human intelligence.

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.

Carnegie Mellon University and then continued investigating issues in representation and reasoning as part of his research career for the last decade and a half. However, the engineers, as is their wont, have their own take and emphasis many faces: Its philosophical progress, instigated by the focus on on AI issues. Teaching engineering and animals, and its mathematical list gives some idea about how students interested in AI, especially face to formulating and analyzing concerns with application bring advances when they are taking courses along classes of algorithms that appear to be in theory, as has happened earlier with computer science students, presents effective in providing computers with in mathematics and physics. Many academic researchers have the difference in background and interest. For several decades, there has found that AI often elicits greater interest Also, when ideas are presented been another face to the field, a technological from fellow academics in engineering somewhat abstractly, the engineering one that provides tools for departments--many computer students might need to do extra work solving practical problems in various science departments are housed in in seeing how they might be applied domains. AI It would thus be great if there interaction with AI.

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.

Induction extracts knowledge in the form of, say, rules or decision trees from existing data, and deduction applies induction results to interpret new data. It starts with existing database technology and performs both induction and deduction. The integration of database technology, induction (from machine learning), and deduction (from knowledge-based sys-tems) plays a key role in the construction of ILDB systems, as does the design of efficient induction and deduction algorithms. This article presents a system structure for ILDB systems and discusses practical issues for ILDB applications, such as instance selection and structured induction.

Induction and deduction are two opposite operations in data-mining applications. Induction extracts knowledge in the form of, say, rules or decision trees from existing data, and deduction applies induction results to interpret new data. An intelligent learning database (ILDB) system integrates machine-learning techniques with database and knowledge base technology. It starts with existing database technology and performs both induction and deduction. The integration of database technology, induction (from machine learning), and deduction (from knowledge-based sys-tems) plays a key role in the construction of ILDB systems, as does the design of efficient induction and deduction algorithms. This article presents a system structure for ILDB systems and discusses practical issues for ILDB applications, such as instance selection and structured induction.

The information it provides a dynamic, real-time environment units resulting from such an analysis in which it is still relatively easy for tasks to be encode a deeper understanding of the timevarying classified, monitored, and assessed. Moreover, scene to be described. They include a commentary system has severe time restrictions spatial relations for the explicit characterization imposed by the flow of the game and is of spatial arrangements of objects as well thus a good test bed for research into real-time as representations of recognized object movements.

The Workshop on Intelligent Information Integration (III), organized in conjunction with the Sixteenth International Joint Conference on Artificial Intelligence, was held on 31 July 1999 in Stockholm, Sweden. Approximately 40 people participated, and nearly 20 papers were presented. This packed workshop schedule resulted from a large number of submissions that made it difficult to reserve discussion time without rejecting an unproportionately large number of papers. Participants included scientists and practitioners from industry and academia. Topics included query planning, applications of III, mediator architectures, and the use of ontologies for III.

Classifier systems are now viewed disappointing because of their problems such as the rule strength vs rule set performance problem and the credit assignment problem. In order to solve the problems, we have developed a hybrid classifier system: GLS (Generalization Learning System). In designing GLS, we view CSs as model free learning in POMDPs and take a hybrid approach to finding the best generalization, given the total number of rules. GLS uses the policy improvement procedure by Jaakkola et al. for an locally optimal stochastic policy when a set of rule conditions is given. GLS uses GA to search for the best set of rule conditions. 1 INTRODUCTION Classifier systems (CSs) (Holland 1986) have been among the most used in reinforcement learning.

Classifier systems are now viewed disappointing because of their problems such as the rule strength vs rule set performance problem and the credit assignment problem. In order to solve the problems, we have developed a hybrid classifier system: GLS (Generalization Learning System). In designing GLS, we view CSs as model free learning in POMDPs and take a hybrid approach to finding the best generalization, given the total number of rules. GLS uses the policy improvement procedure by Jaakkola et al. for an locally optimal stochastic policy when a set of rule conditions is given. GLS uses GA to search for the best set of rule conditions. 1 INTRODUCTION Classifier systems (CSs) (Holland 1986) have been among the most used in reinforcement learning.