Causality is typically treated an all-or-nothing concept; either A is a cause of B or it is not. We extend the definition of causality introduced by Halpern and Pearl (2004a) to take into account the degree of responsibility of A for B. For example, if someone wins an election 11-0, then each person who votes for him is less responsible for the victory than if he had won 6-5. We then define a notion of degree of blame, which takes into account an agent's epistemic state. Roughly speaking, the degree of blame of A for B is the expected degree of responsibility of A for B, taken over the epistemic state of an agent.

Inductive learning is based on inferring a general rule from a finite data set and using it to label new data. In transduction one attempts to solve the problem of using a labeled training set to label a set of unlabeled points, which are given to the learner prior to learning. Although transduction seems at the outset to be an easier task than induction, there have not been many provably useful algorithms for transduction. Moreover, the precise relation between induction and transduction has not yet been determined. The main theoretical developments related to transduction were presented by Vapnik more than twenty years ago. One of Vapnik's basic results is a rather tight error bound for transductive classification based on an exact computation of the hypergeometric tail. While tight, this bound is given implicitly via a computational routine. Our first contribution is a somewhat looser but explicit characterization of a slightly extended PAC-Bayesian version of Vapnik's transductive bound. This characterization is obtained using concentration inequalities for the tail of sums of random variables obtained by sampling without replacement. We then derive error bounds for compression schemes such as (transductive) support vector machines and for transduction algorithms based on clustering. The main observation used for deriving these new error bounds and algorithms is that the unlabeled test points, which in the transductive setting are known in advance, can be used in order to construct useful data dependent prior distributions over the hypothesis space.

Trends in Intelligent Information Knowledge Based Computer Systems. The 18th International FLAIRS Conference seeks high quality, original, Larry Holder, University of Texas at Arlington unpublished submissions in all areas of AI, including, but not limited to, holder@cse.uta.edu The FLAIRS conference offers a set of special tracks, and authors are encouraged to submit papers to a relevant track.

This article reports on the RoboCup-2003 event. RoboCup is no longer just the Soccer World Cup for autonomous robots but has evolved to become a coordinated initiative encompassing four different robotics events: (1) Soccer, (2) Rescue, (3) Junior (focused on education), and (4) a Scientific Symposium. RoboCup-2003 took place from 2 to 11 July 2003 in Padua (Italy); it was colocated with other scientific events in the field of AI and robotics. In this article, in addition to reporting on the results of the games, we highlight the robotics and AI technologies exploited by the teams in the different leagues and describe the most meaningful scientific contributions.

This eclectic keepsake provides a sampling in action' for the first time. Its destruction "You may have read about the outsourcing of what can be found (with links to the full Please may well have been saved, the company today, in cover articles in Time, Wired, keep in mind that (1) the mere mention of said. 'It was a special moment--a robot Business Week.... In New Hampshire, John anything here does not imply any endorsement got blown up instead of a person,' said Kerry was asked about the problem. His whatsoever; (2) the excerpt might not iRobot CEO Colin Angle.... Between 50 answer: 'We have to create the next wave reflect the overall tenor of the article; (3) although and 100 PackBots are now being used in of those kinds of jobs that come from the the articles were initially available Iraq and Afghanistan for battlefield reconnaissance, fact that we're highly educated and deeply online and without charge, few things that "'Conscious robot is not an oxymoron -- Dial'em for Mumbai.

(ICKEDS 2004). This book looks at some of the results of the synergy among AI, cognitive science, and education. Examples include virtual students whose misconceptions force students to reflect on their own knowledge, intelligent tutoring systems, and speech-recognition technology that helps students learn to read. Some of the systems described are already used in classrooms and have been evaluated; a few are still laboratory efforts. The book also addresses cultural and political issues involved in the deployment of new educational technologies.

An adequate natural language description of developments in a real-world scene can be taken as proof of "understanding what is going on." An algorithmic system that generates natural language descriptions from video recordings of road traffic scenes can be said to "understand" its input to the extent that algorithmically generated text is acceptable to the humans judging it. A fuzzy metrictemporal Horn logic (FMTHL) provides a formalism for representing both schematic and instantiated conceptual knowledge about the depicted scene and its temporal development. The resulting conceptual representation mediates in a systematic manner between the spatiotemporal geometric descriptions extracted from video input and a module that generates natural language text. This article outlines a 30-year effort to create such cognitive vision system, indicates its current status, summarizes lessons learned along the way, and discusses open problems against this background.

With the recent technological feasibility of electronic commerce over the Internet, much attention has been given to the design of electronic markets for various types of electronically-tradable goods. Such markets, however, will normally need to function in some relationship with markets for other related goods, usually those downstream or upstream in the supply chain. Thus, for example, an electronic market for rubber tires for trucks will likely need to be strongly influenced by the rubber market as well as by the truck market. In this paper we design protocols for exchange of information between a sequence of markets along a single supply chain. These protocols allow each of these markets to function separately, while the information exchanged ensures efficient global behavior across the supply chain. Each market that forms a link in the supply chain operates as a double auction, where the bids on one side of the double auction come from bidders in the corresponding segment of the industry, and the bids on the other side are synthetically generated by the protocol to express the combined information from all other links in the chain. The double auctions in each of the markets can be of several types, and we study several variants of incentive compatible double auctions, comparing them in terms of their efficiency and of the market revenue.

A novel algorithm for actively trading stocks is presented. While traditional expert advice and ``universal'' algorithms (as well as standard technical trading heuristics) attempt to predict winners or trends, our approach relies on predictable statistical relations between all pairs of stocks in the market. Our empirical results on historical markets provide strong evidence that this type of technical trading can ``beat the market'' and moreover, can beat the best stock in the market. In doing so we utilize a new idea for smoothing critical parameters in the context of expert learning.

NASA Ames Research Center Polish Academy of Sciences URL: www.taai.org.tw/announce/ (PRICAI 2004). (ICKEDS 2004). This book looks at some of the results of the synergy among AI, cognitive science, and education. Examples include virtual students whose misconceptions force students to reflect on their own knowledge, intelligent tutoring systems, and speech recognition technology that helps students learn to read.