Horvitz noted two emerging trends at the conference and in the AI field. Second is the work in scaling AI to be more integrative. Instead of the ongoing great successes of AI researches on "wedges" of AI expertise and reasoning, there's increasing work on delivering more depth and breadth of capabilities such as sensing, learning, and reasoning. "This is very hard," notes Horvitz, "(but already) I see bits and pieces here and there." Game Playing Competition, the Poker AAI's Twenty-second Conference (AAAI-07) continued a longstanding the 1,025 attendees to choose Competition, and the Human Versus tradition of excellence.

Multiagent Systems" was delivered by Mark W. Spong (University of Illinois (ICINCO 2007) "Toward Human-Machine Cooperation" was delivered by Patrick Millot (Université de Valenciennes, France), who is a renowned professor in Europe. ICINCO received 435 paper submissions, not including workshops, from more than 50 countries, in all continents. Sciences et Techniques de l'Ingénieur are researchers in one of the ICIN-and Robotics (ICINCO 2007) was The conference was also held in cooperation selected for poster presentation. The volume tracks: "Intelligent Control Systems will be published by Springer-Verlag. Autònoma de Barcelona, as a major international forum The two satellite workshops were Spain) and Janan Zaytoon (Centre de to debate technical and scientific the Third International Workshop on Recherche en Sciences et Technologies advances presented by researchers and Multiagent Robotic Systems (MARS de l'Information et de la Communication, developers both from academe and 2007), chaired by Joaquim Filipe, and Universite de Reims Champagne-industry.

This article provides an overview of the nature and role of autonomy for space exploration, with a bias in focus towards describing the relevance of AI technologies. It explores the range of autonomous behavior that is relevant and useful in space exploration and illustrates the range of possible behaviors by presenting four case studies in space-exploration systems, each differing from the others in the degree of autonomy exemplified. Three core requirements are defined for autonomous space systems, and the architectures for integrating capabilities into an autonomous system are described. The article concludes with a discussion of the challenges that are faced currently in developing and deploying autonomy technologies for space.

A number of additional events were associated with the SAT conference, including the well-known SAT competition, the QBF evaluation, the PB evaluation, and the MAX-SAT evaluation. Armin Biere, (CP) techniques for word-level problems professor at the Johannes Kepler University, and their propositional encoding, Linz, Austria, was the invited and satisfiability modulo theories speaker for this special session, having (SMT). Submissions were solicited for addressed design and implementation original research on proof systems and issues in modern SAT solvers. Armin Biere, Marijn Heule, and and extensions of SAT find many practical The conference attracted 80 participants, Knot Pipatsrisawat. The SAT Conference Was Held in Lisbon, Portugal.

The newly emerging field of machine ethics (Anderson and Anderson 2006) is concerned with adding an ethical dimension to machines. Unlike computer ethics -- which has traditionally focused on ethical issues surrounding humans' use of machines -- machine ethics is concerned with ensuring that the behavior of machines toward human users, and perhaps other machines as well, is ethically acceptable. In this article we discuss the importance of machine ethics, the need for machines that represent ethical principles explicitly, and the challenges facing those working on machine ethics. We also give an example of current research in the field that shows that it is possible, at least in a limited domain, for a machine to abstract an ethical principle from examples of correct ethical judgments and use that principle to guide its own behavior.

As a result, all sessions attracted significant interest and participation. After the success of this event, the OPS organizing committee plans to merge this event as a regular special session to the AIIDE conference including recognized keynotes, technical discussion, and, possibly, demo sessions. An additional (Maersk Institute, University of Southern aim of these events is to yield a better Denmark). To learn approaches for optimizing player satisfaction about the latest news about this series in interactive entertainment of events, subscribe to the Google systems. This was the second in parallel to the conference.

(ISAIM 2008).

A geometric framework for understanding multi-category classification is introduced, through which many existing 'all-together' algorithms can be understood. The structure enables parsimonious optimisation, through a direct extension of the binary methodology. The focus is on Support Vector Classification, with parallels drawn to related methods. The ability of the framework to compare algorithms is illustrated by a brief discussion of Fisher consistency. Its utility in improving understanding of multi-category analysis is demonstrated through a derivation of improved generalisation bounds. It is also described how this architecture provides insights regarding how to further improve on the speed of existing multi-category classification algorithms. An initial example of how this might be achieved is developed in the formulation of a straightforward multi-category Sequential Minimal Optimisation algorithm. Proof-of-concept experimental results have shown that this, combined with the mapping of pairwise results, is comparable with benchmark optimisation speeds.

This work is a contribution to prioritized reasoning in logic programming in the presence of preference relations involving atoms. The technique, providing a new interpretation for prioritized logic programs, is inspired by the semantics of Prioritized Logic Programming and enriched with the use of structural information of preference of Answer Set Optimization Programming. Specifically, the analysis of the logic program is carried out together with the analysis of preferences in order to determine the choice order and the sets of comparable models. The new semantics is compared with other approaches known in the literature and complexity analysis is also performed, showing that, with respect to other similar approaches previously proposed, the complexity of computing preferred stable models does not increase.

Logic programming under the answer-set semantics nowadays deals with numerous different notions of program equivalence. This is due to the fact that equivalence for substitution (known as strong equivalence) and ordinary equivalence are different concepts. The former holds, given programs P and Q, iff P can be faithfully replaced by Q within any context R, while the latter holds iff P and Q provide the same output, that is, they have the same answer sets. Notions in between strong and ordinary equivalence have been introduced as theoretical tools to compare incomplete programs and are defined by either restricting the syntactic structure of the considered context programs R or by bounding the set A of atoms allowed to occur in R (relativized equivalence).For the latter approach, different A yield properly different equivalence notions, in general. For the former approach, however, it turned out that any ``reasonable'' syntactic restriction to R coincides with either ordinary, strong, or uniform equivalence. In this paper, we propose a parameterization for equivalence notions which takes care of both such kinds of restrictions simultaneously by bounding, on the one hand, the atoms which are allowed to occur in the rule heads of the context and, on the other hand, the atoms which are allowed to occur in the rule bodies of the context. We introduce a general semantical characterization which includes known ones as SE-models (for strong equivalence) or UE-models (for uniform equivalence) as special cases. Moreover,we provide complexity bounds for the problem in question and sketch a possible implementation method. To appear in Theory and Practice of Logic Programming (TPLP).