➦   Reinforcement learning with limited reinforcement: Using Bayes risk for active learning in POMDPs
➦   Local properties in modal logic
➦   Conflict-driven answer set solving: From theory to practice
➦   Learning from others: Exchange of classification rules in intelligent distributed systems
➦   Automated verification of state sequence invariants in general game playing
➦   On the approximability of Dodgson and Young elections
➦   Augmenting tractable fragments of abstract argumentation
➦   Editorial Board
➦   Anytime coalition structure generation in multi-agent systems with positive or negative externalitie
➦   Algorithms for strategyproof classification
➦   Towards fixed-parameter tractable algorithms for abstract argumentation
➦   Communicating open systems
➦   Editorial Board
➦   Importance sampling-based estimation over AND/OR search spaces for graphical models
➦   Patrolling security games: Definition and algorithms for solving large instances with single patroll
➦   A complete solution to the Maximum Density Still Life Problem
➦   Towards mobile intelligence: Learning from GPS history data for collaborative recommendation
➦   Editorial Board
➦   A min-flow algorithm for Minimal Critical Set detection in Resource Constrained Project Scheduling
➦   Information-geometric approach to inferring causal directions
➦   Exploiting symmetries for single- and multi-agent Partially Observable Stochastic Domains
➦   Editorial Board
➦   Qualitative reasoning about relative direction of oriented points
➦   Manipulating the quota in weighted voting games
➦   On the approximation ability of evolutionary optimization with application to minimum set cover
➦   Editorial Board
➦   The influence of k-dependence on the complexity of planning
➦   Editorial Board
➦   Ordered completion for first-order logic programs on finite structures
➦   Foundations of instance level updates in expressive description logics
➦   Decision-theoretic planning with generalized first-order decision diagrams
➦   K⁎: A heuristic search algorithm for finding the k shortest paths
➦   Reasoning about cardinal directions between extended objects: The NP-hardness result
➦   Corrigendum to “Ensembling neural networks: Many could be better than all” [Artificial Intelligence
➦   Editorial Board
➦   Measuring universal intelligence: Towards an anytime intelligence test
➦   Learning complex action models with quantifiers and logical implications
➦   Diagnosing multiple intermittent failures using maximum likelihood estimation
➦   Qualitative reasoning with directional relations
➦   Defeasible inheritance with doubt index and its axiomatic characterization
➦   Agent decision-making in open mixed networks
➦   Analogical model formulation for transfer learning in AP Physics
➦   Editorial Board
➦   The computational complexity of ideal semantics
➦   Reasoning from last conflict(s) in constraint programming
➦   Editorial Board
➦   Uncertainty modelling for vague concepts: A prototype theory approach
➦   The well-designed child
➦   The well-designed young mathematician
➦   Robotics: State of the Art and Future Challenges, Imperial College Press (2008)