The PROCESS SPECIFICATION language (PSL) has been designed to facilitate correct and complete exchange of process information among manufacturing systems, such as scheduling, process modeling, process planning, production planning, simulation, project management, work flow, and business-process reengineering. We give an overview of the theories within the PSL ontology, discuss some of the design principles for the ontology, and finish with examples of process specifications that are based on the ontology.

This article presents the methodology that has been successfully used over the past seven years by an interdisciplinary team to create the International Committee for Documentation of the International Council of Museums (CIDOC) CONCEPTUAL REFERENCE MODEL (CRM), a high-level ontology to enable information integration for cultural heritage data and their correlation with library and archive information. The CIDOC CRM is now in the process to become an International Organization for Standardization (ISO) standard. The CIDOC CRM analyzes the common conceptualizations behind data and metadata structures to support data transformation, mediation, and merging. It is assumed that the presented methodology and the upper level of the ontology are applicable in a far wider domain.

This article reports on the Sixth Robot World Cup Competition and Conference (RoboCup-2002) Fukuoka/Busan, which took place from 19 to 25 June in Fukuoka, Japan. It was the largest Robo- Cup since 1997 and held the first humanoid league competition in the world. Further, the first ROBOTREX (robot trade and exhibitions) was held with about 50 companies, universities, and institutes represented. To the best of our knowledge, this was the largest robotic event in history.

During the 2002 European Conference on Artificial Intelligence (ECAI-02) was introduced the Starting Artificial Intelligence Researchers Symposium STAIRS), the first-ever international symposium specifically aimed at Ph.D. students in AI. The outcome was a thorough, high-quality, and successful event, with all the features one usually finds in the best international conferences: large international committees, comprehensive coverage, published proceedings, renowned speakers and panelists, subsidized awards, and an exciting social program. Considering the numerous benefits gained by the young researchers through such a forum, no doubt STAIRS will become a regular and well-established biennial event.

This article summarizes 16 agent strategies that were designed for the 2002 Trading Agent Competition. Agent architects use numerous general-purpose AI techniques, including machine learning, planning, partially observable Markov decision processes, Monte Carlo simulations, and multiagent systems. Ultimately, the most successful agents were primarily heuristic based and domain specific.

Robots in the Robot Host competition, part of the Eighteenth National Conference on Artificial Intelligence (AAAI-2002) Mobile Robot Competition faced two challenges: (1) a serving task that was similar to the Hors d'Oeuvres, Anyone? Both tasks required moving carefully among people, politely offering them information or hors d'oeuvres, recognizing when the people are making a request, and answering the request.

The AAAI-2002 Robot Exhibition offered robotics researchers a venue for live demonstrations of their current projects. Researchers ranging from undergraduates working on their own to large multilab groups demonstrated robots that performed tasks ranging from improvisational comedy to urban search and rescue. This article describes their entries.

The Eleventh Annual AAAI Robot Competition and Exhibition was held at the National Conference on Artificial Intelligence in Edmonton, Alberta, Canada, in August 2002. This article describes each of the events that were held: Robot Challenge, Robot Exhibition, Robot Host, and Robot Rescue.

The Trading Agent Competition (TAC) has now become an annual fixture since its inception in 2000. The competition was conceived with the objective of studying automated trading strategies by focusing the research community on the development of competing solutions to a common trading scenario. The success of past TAC events has motivated broadening the scope of the competition beyond the context of the travel agent scenario used thus far. For the fourth edition of this competition, TAC-03, to be held in August 2003, the authors have created a novel supply-chain trading game with the aim of investigating automated agents in the context of dynamic supply-chain management.

The Fifth International Symposium on Abstraction, Reformulation, and Approximation (SARA-2002) was held from 2 to 4 August 2002 in Kananaskis, Alberta, Canada. This interdisciplinary conference brought together researchers from around the world to present recent progress on, and exchange ideas about, how abstraction, reformulation, and approximation techniques can be used in areas such as automatic programming, constraint satisfaction, design, diagnosis, machine learning, search, planning, reasoning, game playing, scheduling, and theorem proving.