The goal of the Workshop on Adaptation and Learning in Multiagent Systems was to focus on research that addresses unique requirements for agents learning and adapting to work in the presence of other agents. Recognizing the applicability and limitations of current machine-learning research as applied to multiagent problems and developing new learning and adaptation mechanisms particularly targeted to this class of problems were the primary research issues that we wanted the authors to address. This article outlines the presentations that were made at the workshop and the success of the workshop in meeting the established goals. Issues that need to be better understood are also presented.

The Association for the Advancement of Artificial Intelligence (AAAI) held its 1995 Fall Symposia Series on 10 to 12 November in Cambridge, Massachusetts. This article contains summaries of the eight symposia that were conducted: (1) Active Learning; (2) Adaptation of Knowledge for Reuse; (3) AI Applications in Knowledge Navigation and Retrieval; (4) Computational Models for Integrating Language and Vision; (5) Embodied Language and Action Symposium; (6) Formalizing Context; (7) Genetic Programming; and (8) Rational Agency: Concepts, Theories, Models, and Applications.

The University of Chicago's robot, CHIP, is part of the Animate Agent Project, aimed at understanding the software architecture and knowledge representations needed to build a general-purpose robotic assistant. CHIP's strategy for the Office Cleanup event of the 1995 Robot Competition and Exhibition was to scan an entire area systematically and, as collectible objects were identified, pick them up and deposit them in the nearest appropriate receptacle. This article describes CHIP and its various systems and the ways in which these elements combined to produce an effective entry to the robot competition.

LOLA won the Office Cleanup event at the 1995 Robot Competition and Exhibition, held as part of the Fourteenth International Conference on Artificial Intelligence. The event called for a robot to pick up trash in an unstructured environment and sort it such that the recyclable trash winded up in the recycle bin and the regular trash in the trash bin. The only allowable information lola was given beforehand were model-based descriptions of the trash and recyclables, which it located using color vision. Much of LOLA's success can be attributed to the simple, fast algorithms and methods that also model sensor uncertainty. The ideas and design philosophy that went into LOLA borrow heavily from those of previous competitors' to which we are greatly indebted. These methods and ideas are discussed here.

LOLA's entry in the Office Delivery event of the 1995 Robot Competition and Exhibition, held in conjunction with the Fourteenth International Joint Conference on Artificial Intelligence, was the culmination of a three-month design and implementation period for an indoor navigation system for topological maps. This article describes the major components of the robot's navigation architecture. It also summarizes the experiences and lessons learned from the competition.

CAIR-2 from the Korea Advanced Institute of Science and Technology (KAIST) placed first in the Office Delivery event at the 1995 Robot Competition and Exhibition, held in conjunction with the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI-95). CAIR-2 is a totally self-contained and autonomous mobile robot, and its control architecture incorporates both behavior-based and planner-based approaches. In this article, we present a short description of CAIR-2's hardware, system and control architecture, realtime vision, and speech recognizer.

The 1995 Robot Competition and Exhibition was held in Montreal, Canada, in conjunction with the 1995 International Joint Conference on Artificial Intelligence. The competition was designed to demonstrate state-of-the-art autonomous mobile robots, highlighting such tasks as goal-directed navigation, feature detection, object recognition, identification, and physical manipulation as well as effective human-robot communication. The competition consisted of two separate events: (1) Office Delivery and (2) Office Cleanup. The exhibition also consisted of two events: (1) demonstrations of robotics research that was not related to the contest and (2) robotics focused on aiding people who are mobility impaired. There was also a Robotics Forum for technical exchange of information between robotics researchers. Thus, this year's events covered the gamut of robotics research, from discussions of control strategies to demonstrations of useful prototype application systems.

In 1992, the seemingly unbeatable World Checker Champion Marion Tinsley defended his title against the computer program CHINOOK. After an intense, tightly contested match, Tinsley fought back from behind to win the match by scoring four wins to CHINOOK's two, with 33 draws. This match was the first time in history that a human world champion defended his title against a computer. This article reports on the progress of the checkers (8 3 8 draughts) program CHINOOK since 1992. Two years of research and development on the program culminated in a rematch with Tinsley in August 1994. In this match, after six games (all draws), Tinsley withdrew from the match and relinquished the world championship title to CHINOOK,citing health concerns. CHINOOK has since defended its title in two subsequent matches. It is the first time in history that a computer has won a human-world championship.

(Bledsoe 1976). We didn't know we were being We spent a lot of time reading by ourselves, because most of the time the other grades were having their classes. But we DID learn, and had some pretty died on 4 October 1995 of ALS, good teachers (Bledsoe 1976). Woody was one of the and recalls spending "hours just roaming founders of AI, making early contributions in around, sometimes working mathematics pattern recognition and automated reasoning. He continued to make significant contributions When Woody was 12, his father died. It was to AI throughout his long career. His a devastating blow both emotionally and legacy consists not only of his scientific work financially. As Woody recalled, "We were poor but also of several generations of scientists before, but after papa died in January 1934, who learned from Woody the joy of scientific things got worse" (Bledsoe 1976). He and the research and the way to go about it. Woody's rest of his brothers and sisters worked dreary enthusiasm, his perpetual sense of optimism, 10-hour days to make ends meet. He to humanity offered those who knew him the found work in north Texas driving a tractor all hope and comfort that truly good and great night. After a month, he hopped a freight men do exist. He graduated little farm near Maysville, Oklahoma. He moved to Oklahoma to try his took a job as a dishwasher, working 12-hour luck at farming. Woody was the fourth child days 7 days a week. In for his heroic activities in arranging the April, the restaurant owner forced him back transportation of troops across the Rhine into working 12-hour days, which was too in March, 1945. He left the Rhine bridges except the one at Remagen university without saying goodbye and had been destroyed by the retreating German joined the United States Army. Patton's Third Army decided to cross the Rhine by boats near Frankfurt rather than suffer the delay of waiting for bridge construction. Therefore the went to Officer's Candidate School (OCS) Army Corps of Engineers hauled naval By the time he in 1942, he had been promoted to second landing craft (designed for beach landings) lieutenant. While at OCS, Woody had an by truck across Europe to ferry experience that had a profound effect on him: troops across the Rhine. Bledsoe, by then an Army captain, recalls that there was Another experience at OCS at Fort only light enemy fire during the crossing; Belvoir left a lasting impression on me. His first "research" was experimenting army truck. The simple idea opened the flap and said, "Get out here. of backing the trucks into the water, Let's do the map reading." He would later father a to get on with the work, to finish the son, Greg, born in March 1947. It taught me that "if we have to had two more children, Pam and Lance.

The paper describes an extension of well-founded semantics for logic programs with two types of negation. In this extension information about preferences between rules can be expressed in the logical language and derived dynamically. This is achieved by using a reserved predicate symbol and a naming technique. Conflicts among rules are resolved whenever possible on the basis of derived preference information. The well-founded conclusions of prioritized logic programs can be computed in polynomial time. A legal reasoning example illustrates the usefulness of the approach.