Abstraction, Reformulation, and Approximation: 4th International Symposium, SARA 2000 Horseshoe Bay, USA, July 26-29, 2000 Proceedings

Front Cover
Berthe Y. Choueiry, Toby Walsh
Springer Science & Business Media, Jul 17, 2000 - Computers - 336 pages
0 Reviews
This volume contains the proceedings of SARA 2000, the fourth Symposium on Abstraction, Reformulations, and Approximation (SARA). The conference was held at Horseshoe Bay Resort and Conference Club, Lake LBJ, Texas, July 26– 29, 2000, just prior to the AAAI 2000 conference in Austin. Previous SARA conferences took place at Jackson Hole in Wyoming (1994), Ville d’Est ́erel in Qu ́ebec (1995), and Asilomar in California (1998). The symposium grewout of a series of workshops on abstraction, approximation, and reformulation that had taken place alongside AAAI since 1989. This year’s symposium was actually scheduled to take place at Lago Vista Clubs & Resort on Lake Travis but, due to the resort’s failure to pay taxes, the conference had to be moved late in the day. This mischance engendered eleventh-hour reformulations, abstractions, and resource re-allocations of its own. Such are the perils of organizing a conference. This is the ?rst SARA for which the proceedings have been published in the LNAI series of Springer-Verlag. We hope that this is a re?ection of the increased maturity of the ?eld and that the increased visibility brought by the publication of this volume will help the discipline grow even further. Abstractions, reformulations, and approximations (AR&A) have found - plications in a variety of disciplines and problems including automatic progr- ming, constraint satisfaction, design, diagnosis, machine learning, planning, qu- itative reasoning, scheduling, resource allocation, and theorem proving. The - pers in this volume capture a cross-section of these application domains.
 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

Partial Completeness of Abstract Fixpoint Checking
1
An Overview of MAXQ Hierarchical Reinforcement Learning
26
Recent Progress in the Design and Analysis of Admissible Heuristic Functions
45
From Multiscale to MultiRepresentation
56
An Abstraction Framework for Soft Constraints and Its Relationship with Constraint Propagation
71
Abstractions for Knowledge Organization of Relational Descriptions
87
GridBased Histogram Arithmetic for the Probabilistic Analysis of Functions
107
Approximating Data in Constraint Databases
124
On Reformulating Planning as Dynamic Constraint Satisfaction
271
Experiments with Automatically Created MemoryBased Heuristics
281
Abstraction and Phase Transitions in Relational Learning
291
An AgentBased Approach to Robust Switching Between Abstraction Levels for Fault Diagnosis
303
A Compositional Approach to Causality
309
A Method for Finding Consistent Hypotheses Using Abstraction
313
Program Synthesis and Transformation Techniques for Simulation Optimization and Constraint Satisfaction
317
Using and Learning Abstraction Hierarchies for Planning
320

Linearly Bounded Reformulations of Unary Databases
144
A CSP Abstraction Framework
164
Interactions of Abstractions in Programming
185
Reformulation and Approximation in Model Checking
202
The Lumberjack Algorithm for Learning Linked Decision Forests
219
Reformulating Propositional Satisfiability as Constraint Satisfaction
233
Improving the Efficiency of Reasoning Through StructureBased Reformulation
247
Using Feature Hierarchies in Bayesian Network Learning
260
Learning Probabilistic Relational Models
322
Synergy between Compositional Modeling and Bayesian Networks
324
A CSP Abstraction Framework
326
Answering Queries with Database Restrictions
328
Research Summary
330
Author Index
332
Copyright

Other editions - View all

Common terms and phrases

About the author (2000)

NICTA and University of New South Wales

Bibliographic information