ISBN: 3-540-67839-5
TITLE: Abstraction, Reformulation, and Approximation
AUTHOR: Choueiry, Berthe Y.; Walsh, Toby (Eds.)
TOC:

Invited Talks
Partial Completeness of Abstract Fixpoint Checking 1
Patrick Cousot (cole normale suprieure)
An Overviewof MAXQ Hierarchical Reinforcement Learning 26
Thomas G. Dietterich (Oregon State University)
Recent Progress in the Design and Analysis of Admissible Heuristic Functions 45
Richard E. Korf (University of California, Los Angeles)
Tutorial
GIS Databases: From Multiscale to MultiRepresentation 57
Stefano Spaccapietra (Swiss Federal Institute of Technology in Lausanne), Christine Parent (University of Lausanne), Christelle Vangenot (Swiss Federal Institute of Technology in Lausanne)
Full Papers
An Abstraction Framework for Soft Constraints and Its Relationship with Constraint Propagation 71
Stefano Bistarelli (Universit a di Pisa), Philippe Codognet (Universit Paris VI), Francesca Rossi (Universit a di Padova)
Abstractions for Knowledge Organization of Relational Descriptions 87
Isabelle Bournaud (Universit Paris-Sud), Mlanie Courtine, Jean-Daniel Zucker (Universit Paris VI)
Grid-Based Histogram Arithmetic for the Probabilistic Analysis
of Functions 107
Carlos Carreras, Manuel V. Hermenegildo (Technical University of
Madrid)
Approximating Data in Constraint Databases124
Rui Chen, Min Ouyang, Peter Z. Revesz (University of
Nebraska-Lincoln)
Linearly Bounded Reformulations of Unary Databases 144
Rada Chirkova, Michael R. Genesereth (Stanford University)
A CSP Abstraction Framework 164
Christophe Lecoutre, Sylvain Merchez, Frdric Boussemart, Eric Grgoire (Universit d'Artois)
Interactions of Abstractions in Programming 185
Gordon S. Novak Jr. (University of Texas at Austin)
Reformulation and Approximation in Model Checking 202
Peter Z. Revesz (University of Nebraska-Lincoln)
The Lumberjack Algorithm for Learning Linked Decision Forests 219
William T.B. Uther, Manuela M. Veloso (Carnegie Mellon University)
Reformulating Propositional Satisfiability as Constraint Satisfaction 233
Toby Walsh (University of York)
Extended Abstracts
Improving the Efficiency of Reasoning Through Structure-Based Reformulation 247
Eyal Amir, Sheila McIlraith (Stanford University)
Using Feature Hierarchies in Bayesian Network Learning 260
Marie desJardins (SRI International), Lise Getoor, Daphne Koller (Stanford University)
On Reformulating Planning as Dynamic Constraint Satisfaction 271
Jeremy Frank, Ari K. Jnsson, Paul Morris (NASA Ames Research Center)
Experiments with Automatically Created Memory-Based Heuristics 281
Istvn T. Herndvlgyi, Robert C. Holte (University of Ottawa)
Abstraction and Phase Transitions in Relational Learning 291
Lorenza Saitta (Universit a del Piemonte Orientale), Jean-Daniel Zucker (Universit Paris VI)
Posters
An Agent-Based Approach to Robust Switching Between Abstraction Levels for Fault Diagnosis 303
Terrence P. Fries (Coastal Carolina University), James H. Graham (University of Louisville)
A Compositional Approach to Causality 309
T.K. Satish Kumar (Stanford University)
A Method for Finding Consistent Hypotheses Using Abstraction 313
Yoshiaki Okubo, Makoto Haraguchi, Yan Fang Zheng (Hokkaido University)
Research Summaries
Program Synthesis and Transformation Techniques for Simulation, Optimization, and Constraint Satisfaction 317
Thomas Ellman (Vassar College)
Using and Learning Abstraction Hierarchies for Planning 320
David Furcy (Georgia Institute of Technology)
Learning Probabilistic Relational Models 322
Lise Getoor (Stanford University)
Synergy between Compositional Modeling and Bayesian Networks 324
T.K. Satish Kumar (Stanford University)
A CSP Abstraction Framework 326
Christophe Lecoutre, Sylvain Merchez, Frdric Boussemart, Eric Grgoire (Universit d'Artois)
Answering Queries with Database Restrictions 328
Chen Li (Stanford University)
Research Summary 330
Gordon S. Novak Jr. (University of Texas at Austin)
Author Index 333
END
