Competitions were held at Since the first competition in 1997 (Kitano Fukuoka Dome Baseball Stadium from 19 to 23 1998), RoboCup has grown into an international June followed by the International RoboCup joint research project in which about Symposium on 24 to 25 June. It is one of RoboCup is an attempt to foster intelligent the most ambitious projects of the twenty-first robotics research by providing a standard century. RoboCup currently consists of three problem, the ultimate goal of which is to divisions: (1) RoboCupSoccer, a move toward build a team of 11 humanoid robots that the final goal; (2) RoboCupRescue, a serious social can beat the human World Cup champion application of rescue activities for any kind soccer team by 2050. It's obvious that of disaster; and (3) RoboCupJunior, an international building a robot to play a soccer game is an education-based initiative designed to immense challenge; readers might therefore introduce young students to robotics. It is our intention to use since 1997 and showed its epoch-making new RoboCup as a vehicle to promote robotics standard for future RoboCups. One thousand and AI research by offering a publicly appealing four team members from 188 teams from 30 but formidable challenge (Asada et nations around the world participated. It included al. 1999; Kitano et al. 1997). The humanoid league is a big challenge knowledge, this was the largest robotic event with a long-term, high-impact goal, which in history.

Bayesian belief networks have grown to prominence because they provide compact representations for many problems for which probabilistic inference is appropriate, and there are algorithms to exploit this compactness. The next step is to allow compact representations of the conditional probabilities of a variable given its parents. In this paper we present such a representation that exploits contextual independence in terms of parent contexts; which variables act as parents may depend on the value of other variables. The internal representation is in terms of contextual factors (confactors) that is simply a pair of a context and a table. The algorithm, contextual variable elimination, is based on the standard variable elimination algorithm that eliminates the non-query variables in turn, but when eliminating a variable, the tables that need to be multiplied can depend on the context. This algorithm reduces to standard variable elimination when there is no contextual independence structure to exploit. We show how this can be much more efficient than variable elimination when there is structure to exploit. We explain why this new method can exploit more structure than previous methods for structured belief network inference and an analogous algorithm that uses trees.

Unary operator domains -- i.e., domains in which operators have a single effect -- arise naturally in many control problems. In its most general form, the problem of STRIPS planning in unary operator domains is known to be as hard as the general STRIPS planning problem -- both are PSPACE-complete. However, unary operator domains induce a natural structure, called the domain's causal graph. This graph relates between the preconditions and effect of each domain operator. Causal graphs were exploited by Williams and Nayak in order to analyze plan generation for one of the controllers in NASA's Deep-Space One spacecraft. There, they utilized the fact that when this graph is acyclic, a serialization ordering over any subgoal can be obtained quickly. In this paper we conduct a comprehensive study of the relationship between the structure of a domain's causal graph and the complexity of planning in this domain. On the positive side, we show that a non-trivial polynomial time plan generation algorithm exists for domains whose causal graph induces a polytree with a constant bound on its node indegree. On the negative side, we show that even plan existence is hard when the graph is a directed-path singly connected DAG. More generally, we show that the number of paths in the causal graph is closely related to the complexity of planning in the associated domain. Finally we relate our results to the question of complexity of planning with serializable subgoals.

Life meetings have grown from small www.comp.hkbu.edu.hk/IAT03/

In the span of a few months, the AI community lost four important figures. The fall of 2002 marked the passing of Ray Reiter, for whom a memorial article by Jack Minker appears in this issue. As the issue was going to press, AI lost Saul Amarel, Norm Nielsen, and Charles Rosen. This section of AI Magazine commemorates these friends, leaders, and AI pioneers. We thank Tom Mitchell and Casimir Kulikowski for their memorial to Saul Amarel, Ray Perrault for his remembrance of Norm Nielsen, and Peter Hart and Nils Nilsson for their tribute to Charles Rosen. The AI community mourns our lost colleagues and gratefully remembers their contributions, which meant so much to so many and to the advancement of artificial intelligence as a whole.

However, even if you become aware of the value of a chance event, for example, with a new behavior of a customer in the market you are selling in, it is still hard to persuade your colleagues to make actions in response to the rare event. "Interesting keywords arose, such as "You had a symposium on the creation The Symposium on Etiquette for Human-Computer "So was it a conference on knowledge Work began its meeting--with discovery inviting philosophers?" The first invited talk In this symposium, we had 17 papers, Jeanne Comeau, an author, speaker, gave us deep insight into customer 2 invited lectures, and 14 other and teacher on etiquette and the director networks in the market, and the last speakers. Six countries (Japan, United of the Etiquette School of panel extended to management, persuasion, States, United Kingdom, Germany, Boston. Comeau taught us a great communication, and trust, Portugal, and the Czech Republic) deal about etiquette's history and and so on.

The proliferation of online information sources has led to an increased use of wrappers for extracting data from Web sources. While most of the previous research has focused on quick and efficient generation of wrappers, the development of tools for wrapper maintenance has received less attention. This is an important research problem because Web sources often change in ways that prevent the wrappers from extracting data correctly. We present an efficient algorithm that learns structural information about data from positive examples alone. We describe how this information can be used for two wrapper maintenance applications: wrapper verification and reinduction. The wrapper verification system detects when a wrapper is not extracting correct data, usually because the Web source has changed its format. The reinduction algorithm automatically recovers from changes in the Web source by identifying data on Web pages so that a new wrapper may be generated for this source. To validate our approach, we monitored 27 wrappers over a period of a year. The verification algorithm correctly discovered 35 of the 37 wrapper changes, and made 16 mistakes, resulting in precision of 0.73 and recall of 0.95. We validated the reinduction algorithm on ten Web sources. We were able to successfully reinduce the wrappers, obtaining precision and recall values of 0.90 and 0.80 on the data extraction task.

This paper evaluates the different tasks carried out in the translation of pronominal anaphora in a machine translation (MT) system. The MT interlingua approach named AGIR (Anaphora Generation with an Interlingua Representation) improves upon other proposals presented to date because it is able to translate intersentential anaphors, detect co-reference chains, and translate Spanish zero pronouns into English---issues hardly considered by other systems. The paper presents the resolution and evaluation of these anaphora problems in AGIR with the use of different kinds of knowledge (lexical, morphological, syntactic, and semantic). The translation of English and Spanish anaphoric third-person personal pronouns (including Spanish zero pronouns) into the target language has been evaluated on unrestricted corpora. We have obtained a precision of 80.4% and 84.8% in the translation of Spanish and English pronouns, respectively. Although we have only studied the Spanish and English languages, our approach can be easily extended to other languages such as Portuguese, Italian, or Japanese.

This paper presents an evolutionary algorithm with a new goal-sequence domination scheme for better decision support in multi-objective optimization. The approach allows the inclusion of advanced hard/soft priority and constraint information on each objective component, and is capable of incorporating multiple specifications with overlapping or non-overlapping objective functions via logical "OR" and "AND" connectives to drive the search towards multiple regions of trade-off. In addition, we propose a dynamic sharing scheme that is simple and adaptively estimated according to the on-line population distribution without needing any a priori parameter setting. Each feature in the proposed algorithm is examined to show its respective contribution, and the performance of the algorithm is compared with other evolutionary optimization methods. It is shown that the proposed algorithm has performed well in the diversity of evolutionary search and uniform distribution of non-dominated individuals along the final trade-offs, without significant computational effort. The algorithm is also applied to the design optimization of a practical servo control system for hard disk drives with a single voice-coil-motor actuator. Results of the evolutionary designed servo control system show a superior closed-loop performance compared to classical PID or RPT approaches.

The size and complexity of software and hardware systems have significantly increased in the past years. As a result, it is harder to guarantee their correct behavior. One of the most successful methods for automated verification of finite-state systems is model checking. Most of the current model-checking systems use binary decision diagrams (BDDs) for the representation of the tested model and in the verification process of its properties. Generally, BDDs allow a canonical compact representation of a boolean function (given an order of its variables). The more compact the BDD is, the better performance one gets from the verifier. However, finding an optimal order for a BDD is an NP-complete problem. Therefore, several heuristic methods based on expert knowledge have been developed for variable ordering. We propose an alternative approach in which the variable ordering algorithm gains 'ordering experience' from training models and uses the learned knowledge for finding good orders. Our methodology is based on offline learning of pair precedence classifiers from training models, that is, learning which variable pair permutation is more likely to lead to a good order. For each training model, a number of training sequences are evaluated. Every training model variable pair permutation is then tagged based on its performance on the evaluated orders. The tagged permutations are then passed through a feature extractor and are given as examples to a classifier creation algorithm. Given a model for which an order is requested, the ordering algorithm consults each precedence classifier and constructs a pair precedence table which is used to create the order. Our algorithm was integrated with SMV, which is one of the most widely used verification systems. Preliminary empirical evaluation of our methodology, using real benchmark models, shows performance that is better than random ordering and is competitive with existing algorithms that use expert knowledge. We believe that in sub-domains of models (alu, caches, etc.) our system will prove even more valuable. This is because it features the ability to learn sub-domain knowledge, something that no other ordering algorithm does.