(MAICS 2006). AISB'06 Symposium on Exploration Antecedents and Consequences of Versus Exploitation in Naturally Inspired Emotion. (IIS 2006). (ASM 2006). Please Help Us Celebrate 50 Years of AI at IAAI-06 Join Us in Boston!

The Representations for Multimodal Generation Workshop was held on April 23-25, 2005, at Reykjavik University, Reykjavik, Iceland. The overall goal of this workshop is to further the state of research on multimodal generation by enabling (and getting) people in the field to work together on building systems capable of real-time face-to-face dialog with people. This report summarizes the activities and progress of that meeting.

Utrecht is more than 1,300 years old and located in the center of the Netherlands, about 40 minutes by train from Amsterdam. School (EASSS 2005) for about 120 students, which was organized by Europe's coordination network for agent systems (AgentLink) and was as successful as previous summer schools in Utrecht, Saarbruecken, Prague, Barcelona, Bologna, and Liverpool. Overall, in the theory and practice of AAMAS 2005 had 778 academic and autonomous agents and multiagent industrial participants from 44 countries systems. AAMAS 2005 is the fourth on six continents. The main room of this can with some justification AAMAS 2005 was held on July building, in which the Treaty of claim to be one of the most active.

The program committee selected the paper "Learning to Win: Case-Based Plan Selection in a Real-Time Strategy Game" by David W. Aha (Naval Research Laboratory), The second day featured reasoning research. This report describes the conference in detail. David Aha noted the need Derek Bridge, the University College to enhance the theoretical foundations Case-Based Reasoning (ICCBR) Cork, and Craig Knoblock, the of CBR. College Dublin) stressed the fact that meeting on case-based reasoning ICCBR-05 received 74 paper submissions in recent years we have focused on (CBR). Of these, the program committee needed with respect to experience highlighting the most significant selected 26 for poster presentations modeling and reuse.

These workshops, although quite specialized, have covered areas of great interest for the conference delegates, namely: "Multiagent System Robotics" (MARS), "Biosignal Processing and Classification" (BPC), and "Artificial Neural Networks and Intelligent Information Processing" (ANNIIP). In the program of this conference for publication in the proceedings were included oral presentations (full and for presentation at the conference; papers and short papers) and posters, of these, 166 papers were organized in three simultaneous selected for oral presentation (67 full tracks: "Intelligent Control Systems papers and 99 short papers) and 63 papers and Optimization," "Robotics and Automation," were accepted for poster presentation. Furthermore, less than 60 percent, and the full paper (ICINCO 2005) was held in Barcelona ICINCO 2005 included acceptance ratio was 17 percent.

Although the Lego RCX's has helped guide Sony's own choice of Hitachi H8 microcontroller lists at 16 megahertz next-generation AIBO features and software and 32 kilobytes of memory, the overhead support. As for two-legged platforms, the University of the firmware and interpreter yield of Freiburg has already prototyped a about 10 kilobytes and 500 hertz throughput soccer team of Robosapiens running from for a typical user--slightly better with alternative handheld computers.

MAP is the problem of finding a most probable instantiation of a set of variables given evidence. MAP has always been perceived to be significantly harder than the related problems of computing the probability of a variable instantiation Pr, or the problem of computing the most probable explanation (MPE). This paper investigates the complexity of MAP in Bayesian networks. Specifically, we show that MAP is complete for NP^PP and provide further negative complexity results for algorithms based on variable elimination. We also show that MAP remains hard even when MPE and Pr become easy. For example, we show that MAP is NP-complete when the networks are restricted to polytrees, and even then can not be effectively approximated. Given the difficulty of computing MAP exactly, and the difficulty of approximating MAP while providing useful guarantees on the resulting approximation, we investigate best effort approximations. We introduce a generic MAP approximation framework. We provide two instantiations of the framework; one for networks which are amenable to exact inference Pr, and one for networks for which even exact inference is too hard. This allows MAP approximation on networks that are too complex to even exactly solve the easier problems, Pr and MPE. Experimental results indicate that using these approximation algorithms provides much better solutions than standard techniques, and provide accurate MAP estimates in many cases.

In a peer-to-peer inference system, each peer can reason locally but can also solicit some of its acquaintances, which are peers sharing part of its vocabulary. In this paper, we consider peer-to-peer inference systems in which the local theory of each peer is a set of propositional clauses defined upon a local vocabulary. An important characteristic of peer-to-peer inference systems is that the global theory (the union of all peer theories) is not known (as opposed to partition-based reasoning systems). The main contribution of this paper is to provide the first consequence finding algorithm in a peer-to-peer setting: DeCA. It is anytime and computes consequences gradually from the solicited peer to peers that are more and more distant. We exhibit a sufficient condition on the acquaintance graph of the peer-to-peer inference system for guaranteeing the completeness of this algorithm. Another important contribution is to apply this general distributed reasoning setting to the setting of the Semantic Web through the Somewhere semantic peer-to-peer data management system. The last contribution of this paper is to provide an experimental analysis of the scalability of the peer-to-peer infrastructure that we propose, on large networks of 1000 peers.

The hm admissible heuristics for (sequential and temporal) regression planning are defined by a parameterized relaxation of the optimal cost function in the regression search space, where the parameter m offers a trade-off between the accuracy and computational cost of theheuristic. Existing methods for computing the hm heuristic require time exponential in m, limiting them to small values (m <= 2). The hm heuristic can also be viewed as the optimal cost function in a relaxation of the search space: this paper presents relaxed search, a method for computing this function partially by searching in the relaxed space. The relaxed search method, because it computes hm only partially, is computationally cheaper and therefore usable for higher values of m. The (complete) hm heuristic is combined with partial hm heuristics, for m = 3,..., computed by relaxed search, resulting in a more accurate heuristic. This use of the relaxed search method to improve on the hm heuristic is evaluated by comparing two optimal temporal planners: TP4, which does not use it, and HSP*a, which uses it but is otherwise identical to TP4. The comparison is made on the domains used in the 2004 International Planning Competition, in which both planners participated. Relaxed search is found to be cost effective in some of these domains, but not all. Analysis reveals a characterization of the domains in which relaxed search can be expected to be cost effective, in terms of two measures on the original and relaxed search spaces. In the domains where relaxed search is cost effective, expanding small states is computationally cheaper than expanding large states and small states tend to have small successor states.

The treatment of exogenous events in planning is practically important in many real-world domains where the preconditions of certain plan actions are affected by such events. In this paper we focus on planning in temporal domains with exogenous events that happen at known times, imposing the constraint that certain actions in the plan must be executed during some predefined time windows. When actions have durations, handling such temporal constraints adds an extra difficulty to planning. We propose an approach to planning in these domains which integrates constraint-based temporal reasoning into a graph-based planning framework using local search. Our techniques are implemented in a planner that took part in the 4th International Planning Competition (IPC-4). A statistical analysis of the results of IPC-4 demonstrates the effectiveness of our approach in terms of both CPU-time and plan quality. Additional experiments show the good performance of the temporal reasoning techniques integrated into our planner.