Authors may choose to make their contributions available on their personal Web page provided they create a link to the LNAI volume at the Springer-Verlag server or to the LNCS series Homepage and that, together with the electronic version, they add "© Springer-Verlag".

• Partial Completeness of Abstract Fixpoint Checking
  Patrick Cousot (École normale supérieure)
• An Overview of MAXQ Hierarchical Reinforcement Learning
  Thomas G. Dietterich (Oregon State University)
• Recent Progress in the Design and Analysis of Admissible Heuristic Functions
  Richard E. Korf (University of California, Los Angeles) (Power Point slides)

• GIS Databases: From Multiscale to MultiRepresentation
  Stefano Spaccapietra (Swiss Federal Institute of Technology in Lausanne), Christine Parent (University of Lausanne), Christelle Vangenot (Swiss Federal Institute of Technology in Lausanne)

• An Abstraction Framework for Soft Constraints, And Its Relationship with Constraint Propagation
  Stefano Bistarelli (Università di Pisa), Philippe Codognet (Université Paris VI), Francesca Rossi (Università di Padova)
• Abstractions for Knowledge Organization of Relational Descriptions
  Isabelle Bournaud (Université Paris-Sud), Melanie Courtine (Université Paris VI), Jean-Daniel Zucker (Université Paris VI)
• Grid-based Histogram Arithmetic for the Probabilistic Analysis
  Carlos Carreras, Manuel V. Hermenegildo (Technical University of Madrid)
• Approximating Data in Constraint Databases
  Rui Chen, Min Ouyang, Peter Z. Revesz (University of Nebraska-Lincoln)
• Linearly Bounded Reformulations of Unary Databases
  Rada Chirkova, Michael R. Genesereth (Stanford University)
• A CSP Abstraction Framework
  C. Lecoutre, S. Merchez, F. Boussemart, E. Gregoire (Université d'Artois)
• Interactions of Abstractions in Programming
  Gordon S. Novak Jr. (University of Texas at Austin)
• Reformulation and Approximation in Model Checking
  Peter Z. Revesz (University of Nebraska-Lincoln)
• The Lumberjack Algorithm for Learning Linked Decision Forests
  William T.B. Uther, Manuela M. Veloso (Carnegie Mellon University)
• Reformulating Propositional Satisfiability as Constraint Satisfaction
  Toby Walsh (University of York)

• Improving the Efficiency of Reasoning Through Structure-Based Reformulation
  Eyal Amir, Sheila McIlraith (Stanford University)
• Using Feature Hierarchies in Bayesian Network Learning
  Marie desJardins (SRI International), Lise Getoor, Daphne Koller (Stanford University)
• On Reformulating Planning As Dynamic Constraint Satisfaction
  Jeremy Frank, Ari K. Jonsson, Paul Morris (NASA Ames Research Center) (Power Point slides, PostScript slides )
• Experiments with Automatically Created Memory-Based Heuristics
  Istvan T. Hernadvolgyi, Robert C. Holte (University of Ottawa)
• Abstraction and Phase Transitions in Relational Learning
  Lorenza Saitta (Università del Piemonte Orientale), Jean-Daniel Zucker (Université Paris VI)

• An Agent-Based Approach to Robust Switching Between Abstraction Levels for Fault Diagnosis
  Terrence P. Fries (Coastal Carolina University), James H. Graham (University of Louisville)
• A Compositional Approach to Causality
  T.K. Satish Kumar (Stanford University)
• A Method for Finding Consistent Hypotheses Using Abstraction
  Yoshiaki Okubo, Makoto Haraguchi, Yan Fang Zheng (Hokkaido University)