Not widely known by the AI community, elevator control has become a major field of application for AI technologies. Techniques such as neural networks, genetic algorithms, fuzzy rules and, recently, multiagent systems and AI planning have been adopted by leading elevator companies not only to improve the transportation capacity of conventional elevator systems but also to revolutionize the way in which elevators interact with and serve passengers. In this article, we begin with an overview of AI techniques adopted by this industry and explain the motivations behind the continuous interest in AI. We review and summarize publications that are not easily accessible from the common AI sources. In the second part, we present in more detail a recent development project to apply AI planning and multiagent systems to elevator control problems.

Kernel methods, a new generation of learning algorithms, utilize techniques from optimization, statistics, and functional analysis to achieve maximal generality, flexibility, and performance. These algorithms are different from earlier techniques used in machine learning in many respects: For example, they are explicitly based on a theoretical model of learning rather than on loose analogies with natural learning systems or other heuristics. They come with theoretical guarantees about their performance and have a modular design that makes it possible to separately implement and analyze their components. They are not affected by the problem of local minima because their training amounts to convex optimization. In the last decade, a sizable community of theoreticians and practitioners has formed around these methods, and a number of practical applications have been realized. Although the research is not concluded, already now kernel methods are considered the state of the art in several machine learning tasks. Their ease of use, theoretical appeal, and remarkable performance have made them the system of choice for many learning problems. Successful applications range from text categorization to handwriting recognition to classification of geneexpression data.

This article is a reflection on agent-based AI. My contention is that AI research should focus on interactive, autonomous systems, that is, agents. Emergent technologies demand so. We see how recent developments in (multi-) agent-oriented research have taken us closer to the original AI goal, namely, to build intelligent systems of general competence. Agents are not the panacea though. I point out several areas such as design description, implementation, reusability, and security that must be developed before agents are universally accepted as the AI of the future.

We propose a perspective on knowledge compilation which calls for analyzing different compilation approaches according to two key dimensions: the succinctness of the target compilation language, and the class of queries and transformations that the language supports in polytime. We then provide a knowledge compilation map, which analyzes a large number of existing target compilation languages according to their succinctness and their polytime transformations and queries. We argue that such analysis is necessary for placing new compilation approaches within the context of existing ones. We also go beyond classical, flat target compilation languages based on CNF and DNF, and consider a richer, nested class based on directed acyclic graphs (such as OBDDs), which we show to include a relatively large number of target compilation languages.

We present a propositional logic to reason about the uncertainty of events, where the uncertainty is modeled by a set of probability measures assigning an interval of probability to each event. We give a sound and complete axiomatization for the logic, and show that the satisfiability problem is NP-complete, no harder than satisfiability for propositional logic.

Common wisdom has it that small distinctions in the probabilities (parameters) quantifying a belief network do not matter much for the results of probabilistic queries. Yet, one can develop realistic scenarios under which small variations in network parameters can lead to significant changes in computed queries. A pending theoretical question is then to analytically characterize parameter changes that do or do not matter. In this paper, we study the sensitivity of probabilistic queries to changes in network parameters and prove some tight bounds on the impact that such parameters can have on queries. Our analytic results pinpoint some interesting situations under which parameter changes do or do not matter. These results are important for knowledge engineers as they help them identify influential network parameters. They also help explain some of the previous experimental results and observations with regards to network robustness against parameter changes.

The problem of organizing information for multidocument summarization so that the generated summary is coherent has received relatively little attention. While sentence ordering for single document summarization can be determined from the ordering of sentences in the input article, this is not the case for multidocument summarization where summary sentences may be drawn from different input articles. In this paper, we propose a methodology for studying the properties of ordering information in the news genre and describe experiments done on a corpus of multiple acceptable orderings we developed for the task. Based on these experiments, we implemented a strategy for ordering information that combines constraints from chronological order of events and topical relatedness. Evaluation of our augmented algorithm shows a significant improvement of the ordering over two baseline strategies.

The chapters in this book examine the state of today's agent technology and point the way toward the exciting developments of the next millennium. Contributors include Donald A. Norman, Nicholas Negroponte, Brenda Laurel, Thomas Erickson, Ben Shneiderman, Thomas W. Malone, Pattie Maes, David C. Smith, Gene Ball, Guy A. Boy, Doug Riecken, Yoav Shoham, Tim Finin, Michael R. Genesereth, Craig A. Knoblock, Philip R. Cohen, Hector J. Levesque, and James E. White, among others. He then went on to outline that drive a field forward. Francisco's W Hotel, the conference not, to succeed when placed in front Along with the program committee, included work from researchers and of real users. He argued that we are the conference web site and online have faced increasingly challenging now living in a time where we can submissions and reviewing.

The Modified Antarctic Mapping Mission MAMM) was conducted from September to November 2000 onboard RADARSAT. The mission plan consisted of more than 2400 synthetic aperture radar data acquisitions of Antarctica that achieved the scientific objectives and obeyed RADARSAT's resource and operational constraints. Mission planning is a time- and knowledge-intensive effort. It required over a workyear to manually develop a comparable plan for AMM-1, the precursor mission to MAMM. This article describes the design and use of the automated mission planning system for MAMM, which dramatically reduced mission-planning costs to just a few workweeks and enabled rapid generation of what-if scenarios for evaluating alternative mission designs.

The Thirteenth Innovative Applications of Artificial Intelligence Conference (IAAI-2001) was held on 7 to 9 August 2001 in Seattle, Washington, in conjunction with the Seventeenth International Joint Conference on Artificial Intelligence. As in past years, papers were solicited in two categories: (1) deployed applications and (2) emerging applications and technologies. Deployed applications are systems that have been in use for at least several months by individuals or organizations other than their developers, have measurable benefits, and incorporate AI technologies. Emerging applications are technologies and systems that are close to deployment and clearly show an innovative implementation of AI technologies. All these case studies are of value not only to other application developers looking for guidance in applying various techniques to their own applications but also to researchers who need to understand the myriad of technical challenges provided by real-world problems.