Induction and deduction are two opposite operations in data-mining applications. Induction extracts knowledge in the form of, say, rules or decision trees from existing data, and deduction applies induction results to interpret new data. An intelligent learning database (ILDB) system integrates machine-learning techniques with database and knowledge base technology. It starts with existing database technology and performs both induction and deduction. The integration of database technology, induction (from machine learning), and deduction (from knowledge-based sys-tems) plays a key role in the construction of ILDB systems, as does the design of efficient induction and deduction algorithms. This article presents a system structure for ILDB systems and discusses practical issues for ILDB applications, such as instance selection and structured induction.

As the English striker Gary Lineker famously said, "Football is a very simple game. For 90 minutes, 22 men go running after the ball, and at the end, the Germans win." Although the game is simple, analyzing it can be hard. Just what makes one team better than another? How much difference do tactics make? Is there really such a thing as a "lucky win?" Here, we try to answer these questions in the context of RoboCup. We take the giant set of log data produced by the simulator tournaments from 1997 to 1999 and feed it to a data-munching program that produces statistics on important game features. Using these statistics, we identify precisely what has improved in RoboCup and what still requires further work. Plus, because the data muncher can work in real time, we can also release it as a proxy server for RoboCup. This proxy server gives all RoboCup developers instant access to statistics while a game is in progress and is a promising step toward an important goal: understanding RoboCup.

In practice, by calculating the distance between ball center and robot geometrical center, the robot is commanded to rotate around the ball center. Figure 1 shows a picture of our player robot. Our fast robotics research centers to construct a team of image-processing algorithm can process as robots that could play indoor soccer with many as 16 frames a second and can recognize another team according certain rules and regulations. Our team became done using a wireless network under TCP champion among 21 teams in the middlesize-league (transmission control protocol) protocols. Therefore, player robot, a particular mechanics was we designed a special mechanics that provided designed and implemented that, together with a fast and flexible omnidirectional movement the motor's current feedbacks, to a good extent especially when looking for the ball and dribbling. Therefore, object finding and one castor wheel in the rear.

The Eighth Annual Mobile Robot Competition and Exhibition was held as part of the Sixteenth National Conference on Artificial Intelligence in Orlando, Florida, 18 to 22 July. The goals of these robot events are to foster the sharing of research and technology, allow research groups to showcase their achievements, encourage students to enter robotics and AI fields at both the undergraduate and graduate level, and increase awareness of the field. The 1999 events included two robot contests; a new, long-term robot challenge; an exhibition; and a National Botball Championship for high school teams sponsored by the KISS Institute. Each of these events is described in detail in this article.

The CMUNITED-99 simulator team became the 1999 RoboCup simulator league champion by winning all 8 of its games, outscoring opponents by a combined score of 110-0. CMUNITED-99 builds on the successful CMUNITED-98 implementation but also improves on it in many ways. This article gives an overview of CMUNITED-99's improvements over CMUNITED-98.

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.

Austin, Texas, the "live music capital For more information about AAAI is pleased to announce the continued Conferences/conferences.html. Expository Writing Award will be presented members. AAAI is delighted to announce the 31-August 3 in Austin, Texas. This The conference will be held July collocation of SARA-2000 with AAAIaward joins the two special awards 31-August 3, 2000, at the Austin Convention 2000. The Symposium on Abstraction, established last year, the AAAI Classic Center and Hyatt Regency Reformulation, and Approximation Paper Award and the AAAI Distinguished Austin in Austin, Texas. AAAI-2000 will be held July 26-29, just outside Austin in Lago Vista on Lake Travis, Service Award. For more information about The AAAI Effective Expository Writing the Innovative Applications of SARA-2000, please visit sara2000.unl. Award honors the author(s) of a Artificial Intelligence, the Mobile edu/ high-quality, effective piece of writing, Robot Competition and Exhibition, AAAI also welcomes SARA-2000 as accessible to the general public or the Intelligent Systems Demonstrations, our first affiliate conference. For more to a broad AI audience (not just a subarea), the Robot Building Laboratory, information about the AAAI Affiliates written within the last two and the Doctoral Consortium. New Program, please write to Carol Hamilton years. The contribution should be for 2000 will be a technical paper at hamilton@aaai.org. Nominated papers must be Uncertainty: Operations Research AAAI is pleased to announce the continuation in English and must have been published Meets AI (Again)"; Justine Cassell, of its Student Abstract and in a publicly accessible place "Why Do We Need a Body Anyway?"; Poster Program, the SIGART/AAAI (for example, periodical, hard copy, or Carla Gomes, "Structure, Duality, and Doctoral Consortium, and the AAAI online journal but not only as a web Randomization: Common Themes in Scholarship and Volunteer Programs. The author(s) AI and OR"; James Hendler, "Missed Students interested in attending the of the award-winning paper(s) will Perceptions: AI versus the Funding National Conference on Artificial receive a $2500 prize (shared if more Agencies"; Geoff Hinton, "Modeling Intelligence in Austin, July 31-August than one author) as well as lodging High-Dimensional Data Distributions 3, 2000, should consult the AAAI web and travel to the National Conference by Combining Simple Experts"; Rich site for further information about all on Artificial Intelligence.

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.

The Association for the Advancement of Artificial Intelligence, in cooperation, with Stanford University's Department of Com-puter Science, presented the 1999 Spring Symposium Series on 22 to 24 March 1999 at Stanford University. The titles of the seven symposia were (1) Agents with Adjustable Autonomy, (2) Artificial Intelligence and Computer Games, (3) Artificial Intelligence in Equipment Maintenance Service and Support, (4) Hybrid Systems and AI: Modeling, Analysis, and Control of Discrete + Continuous Systems, (5) Intelligent Agents in Cyberspace, (6) Predictive Toxicology of Chemicals: Experiences and Impact of AI Tools, and (7) Search Techniques for Problem Solving under Uncertainty and Incomplete Information.

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.