8:45-8:50
 Workshop Welcome
8:50-10:30
 Session I
(Session chair: Patrik Haslum)
  1. Developing Domain-Independent Search Control for Europa2
    Sara Bernardini, David E. Smith

  2. Finding Admissible Bounds for Over-subscription Planning Problems
    J. Benton, Menkes van den Briel, Subbarao Kambhampati

  3. Fluent Merging: A General Technique to Improve Reachability Heuristics and Factored Planning
    Menkes van den Briel, Subbarao Kambhampati, Thomas Vossen

  4. Local Search Topology: Implications for Planner Performance
    Mark Roberts, Adele Howe
10:30-11:00
 Coffee Break
11:00-12:15
 Session II
(Session chair: Malte Helmert)
  1. Improving Relaxed-Plan-Based Heuristics
    Jorge A. Baier

  2. The Causal Graph Heuristic is the Additive Heuristic plus Context
    Hector Geffner

  3. Logical Encodings With No Time Indexes for Defining and Computing Admissible Heuristics for Planning
    Miquel Ramirez, Blai Bonet, Hector Geffner
12:15-14:00
 Lunch Break
14:00-15:20
 Session III
(Session chair: Hector Geffner)
  1. ICAPS-07 Best Paper Award Talk
    Flexible Abstraction Heuristics for Optimal Sequential Planning
    Malte Helmert, Patrik Haslum, Joerg Hoffmann

  2. Structural Patterns Heuristics: Basic Idea and Concrete Instance
    Michael Katz, Carmel Domshlak

  3. Set-Additive and TSP Heuristics for Planning with Action Costs and Soft Goals
    Emil Keyder, Hector Geffner
15:20-16:00
 Coffee Break
16:00-17:15
 Session IV
(Session chair: TBD)
  1. Symbolic Shortest Paths Planning
    Stefan Edelkamp

  2. How Good is Almost Perfect?
    Malte Helmert, Gabriele Röger

  3. Accuracy of Admissible Heuristic Functions in Selected Planning Domains
    Malte Helmert, Robert Mattmüller