RoboCup is an initiative designed to promote the full integration of AI and robotics research. Following the success of the first RoboCup in 1997 at Nagoya (Kitano 1998; Noda et al. 1998) and the second RoboCup in Paris in 1998, the Third Robot World Cup Soccer Games and Conferences, RoboCup-99, were held in Stockholm from 27 July to 4 August 1999 in conjunction with the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI-99). There were four different leagues: (1) the simulation league, (2) the small-size real robot league, (3) the middle-size real robot league, and (4) the Sony legged robot league. RoboCup-2000, the Fourth Robot World Cup Soccer Games and Conferences, will take place in Melbourne, Australia, in August 2000.

We investigate the space efficiency of a Propositional Knowledge Representation (PKR) formalism. Intuitively, the space efficiency of a formalism F in representing a certain piece of knowledge A, is the size of the shortest formula of F that represents A. In this paper we assume that knowledge is either a set of propositional interpretations (models) or a set of propositional formulae (theorems). We provide a formal way of talking about the relative ability of PKR formalisms to compactly represent a set of models or a set of theorems. We introduce two new compactness measures, the corresponding classes, and show that the relative space efficiency of a PKR formalism in representing models/theorems is directly related to such classes. In particular, we consider formalisms for nonmonotonic reasoning, such as circumscription and default logic, as well as belief revision operators and the stable model semantics for logic programs with negation. One interesting result is that formalisms with the same time complexity do not necessarily belong to the same space efficiency class.

We hope to see you in along with one or two new developments.

We order its events and find meaning in them by assimilating them to more or less familiar narratives. Temporal A wide variety of systems were presented: 1999, at the Sea Crest Oceanfront and modal logics have been used to story generation, interactive Resort and Conference Center. The reason about time, action, and adaptive fiction (including the first public titles of the five symposia were change and to program and verify demonstration from Joseph Bates's networked systems. How can we create characters from specifications of service quality in which interactive narrative emerges? The symposium focused mainly on a single, comprehensive theoretical framework, Clark's grounding model.

Intelligent-agent technology is one of the most exciting, active areas of research and development in computer science and information technology today. The First Asia-Pacific Conference on Intelligent- Agent Technology (IAT'99) attracted researchers and practitioners from diverse fields such as computer science, information systems, business, telecommunications, manufacturing, human factors, psychology, education, and robotics to examine the design principles and performance characteristics of various approaches in agent technologies and, hence, fostered the cross-fertilization of ideas on the development of autonomous agents and multiagent systems among different domains.

The 1998 Planning Competition at the AI Planning Systems Conference was the first of its kind. Its goal was to create planning domains that a wide variety of planning researchers could agree on to make comparison among planners more meaningful, measure overall progress in the field, and set up a framework for long-term creation of a repository of problems in a standard notation. A rules committee for the competition was created in 1997 and had long discussions on how the contest should go. One result of these discussions was the pddl notation for planning domains. This notation was used to set up a set of planning problems and get a modest problem repository started. As a result, five planning systems were able to compete when the contest took place in June 1998. All these systems solved problems in the strips framework, with some slight extensions. The attempt to find domains for other forms of planning foundered because of technical and organizational problems. In spite of this problem, the competition achieved its goals partially in that it con-firmed that substantial progress had occurred in some subfields of planning, and it allowed qualitative comparison among different planning algorithms. It is urged that the competition continue to take place and to evolve.

The 2000 Association of Computing Machinery Conference on Intelligent User Interfaces (IUI -- 2000) was held in New Orleans, Louisiana, from 9-12 January. This conference occupies the currently hot area that lies midway between the traditional fields of AI and computer-human interaction (CHI). For AI practitioners, this conference represents a good venue for learning about both how to design user interfaces for AI applications and how to use AI techniques to improve the user experience with more conventional applications. This year's conference drew the largest audience yet for an IUI conference, but the conference still remains at a manageable, single-track size. A wide range of high-quality presentations, tutorials, demonstrations, and invited speakers provided a bridge between the AI and CHI communities.

He has divided the the labors of a crowd of ants. Another Flake's third theme is universality: text into seven sections: (1) computation, distinguishing characteristic of emergence that very different systems can behave (2) fractals, (3) chaos, (4) complex is that it involves no single in similar ways.

The KDD conference series is the primary venue for presenting and publishing the highest quality advances in the field.

In 1998, the international planning community was invited to take part in the first planning competition, hosted by the Artificial Intelligence Planning Systems Conference, to provide a new impetus for empirical evaluation and direct comparison of automatic domain-independent planning systems. This article describes the systems that competed in the event, examines the results, and considers some of the implications for the future of the field.