The concept of the value-gradient is introduced and developed in the context of reinforcement learning. It is shown that by learning the value-gradients exploration or stochastic behaviour is no longer needed to find locally optimal trajectories. This is the main motivation for using value-gradients, and it is argued that learning value-gradients is the actual objective of any value-function learning algorithm for control problems. It is also argued that learning value-gradients is significantly more efficient than learning just the values, and this argument is supported in experiments by efficiency gains of several orders of magnitude, in several problem domains. Once value-gradients are introduced into learning, several analyses become possible. For example, a surprising equivalence between a value-gradient learning algorithm and a policy-gradient learning algorithm is proven, and this provides a robust convergence proof for control problems using a value function with a general function approximator.

In this paper, we describe a new algorithm that consists in combining an eye-tracker for minimizing the fatigue of a user during the evaluation process of Interactive Evolutionary Computation. The approach is then applied to the Interactive One-Max optimization problem.

Jerne's idiotypic network theory postulates that the immune response involves inter-antibody stimulation and suppression as well as matching to antigens. The theory has proved the most popular Artificial Immune System (ais) model for incorporation into behavior-based robotics but guidelines for implementing idiotypic selection are scarce. Furthermore, the direct effects of employing the technique have not been demonstrated in the form of a comparison with non-idiotypic systems. This paper aims to address these issues. A method for integrating an idiotypic ais network with a Reinforcement Learning based control system (rl) is described and the mechanisms underlying antibody stimulation and suppression are explained in detail. Some hypotheses that account for the network advantage are put forward and tested using three systems with increasing idiotypic complexity. The basic rl, a simplified hybrid ais-rl that implements idiotypic selection independently of derived concentration levels and a full hybrid ais-rl scheme are examined. The test bed takes the form of a simulated Pioneer robot that is required to navigate through maze worlds detecting and tracking door markers.

This paper presents a new type of genetic algorithm for the set covering problem. It differs from previous evolutionary approaches first because it is an indirect algorithm, i.e. the actual solutions are found by an external decoder function. The genetic algorithm itself provides this decoder with permutations of the solution variables and other parameters. Second, it will be shown that results can be further improved by adding another indirect optimisation layer. The decoder will not directly seek out low cost solutions but instead aims for good exploitable solutions. These are then post optimised by another hill-climbing algorithm. Although seemingly more complicated, we will show that this three-stage approach has advantages in terms of solution quality, speed and adaptability to new types of problems over more direct approaches. Extensive computational results are presented and compared to the latest evolutionary and other heuristic approaches to the same data instances.

This paper examines the use of a hierarchical coevolutionary genetic algorithm under different partnering strategies. Cascading clusters of sub-populations are built from the bottom up, with higher-level sub-populations optimising larger parts of the problem. Hence higher-level sub-populations potentially search a larger search space with a lower resolution whilst lower-level sub-populations search a smaller search space with a higher resolution. The effects of different partner selection schemes amongst the sub-populations on solution quality are examined for two constrained optimisation problems. We examine a number of recombination partnering strategies in the construction of higher-level individuals and a number of related schemes for evaluating sub-solutions. It is shown that partnering strategies that exploit problem-specific knowledge are superior and can counter inappropriate (sub)fitness measurements.

Contradiction is often seen as a defect of intelligent systems and a dangerous limitation on efficiency. In this paper we raise the question of whether, on the contrary, it could be considered a key tool in increasing intelligence in biological structures. A possible way of answering this question in a mathematical context is shown, formulating a proposition that suggests a link between intelligence and contradiction. A concrete approach is presented in the well-defined setting of cellular automata. Here we define the models of ``observer'', ``entity'', ``environment'', ``intelligence'' and ``contradiction''. These definitions, which roughly correspond to the common meaning of these words, allow us to deduce a simple but strong result about these concepts in an unbiased, mathematical manner. Evidence for a real-world counterpart to the demonstrated formal link between intelligence and contradiction is provided by three computational experiments.

Crosswords are very popular and represent a useful domain of investigation for modern artificial intelligence. In contrast to solving other celebrated games (such as chess), cracking crosswords requires a paradigm shift towards the ability to handle tasks for which humans require extensive semantic knowledge. This article introduces WebCrow, an automatic crossword solver in which the needed knowledge is mined from the web: clues are solved primarily by accessing the web through search engines and applying natural language processing techniques. In competitions at the European Conference on Artificial Intelligence (ECAI) in 2006 and other conferences this web-based approach enabled WebCrow to outperform its human challengers. Just as chess was once called “the Drosophila of artificial intelligence,” we believe that crossword systems can be useful Drosophila of web-based agents.

The fourth Modeling and Reasoning in Context (MRC) workshop was held on August 20–21, 2007, in conjunction with the Sixth International and Interdisciplinary Conference on Modeling and Using Context, at Roskilde University, Denmark. This year’s workshop included a special track on the role of contextualization in human tasks (CHUT). The overall goal of the workshop was to further the understanding, development, and application of AI methods for context-sensitive information technology.

Is it possible to build a conscious machine? There was an almost generally accepted of AI since its beginnings. The symposium was psychological, philosophical, and the first official place where scholars-- neuroscientific theories of consciousness; coming from different fields as far as (3) it is possible to address consciousness neuroscience and philosophy, psychology not only from neuroscience, and computer science--addressed psychology, and philosophy, the issue of consciousness in a but also from AI; and (4) the role of traditional AI environment. Furthermore, embodiment and situatedness is almost there was a good balance of universally recognized. A recurrent topic was the fact that The participants' talks centered on the topic of the symposium and generated the field of consciousness seems to be lively discussions of their research.

The AAAI video archive is a central source of information about videotapes and films with information about AI that are stored digitally on other sites or physically in institutional archives. For each video, the archive includes a brief description of the contents and personae, one or more representative short clips for classroom or individual use, and the location of the archival copy (for example, at a university library).