Abstraction, Reformulation and Approximation: 6th International Symposium, SARA 2005, Airth Castle, Scotland, UK, July 26-29, 2005. Proceedings

Scot Anderson, Peter Revesz (auth.), Jean-Daniel Zucker, Lorenza Saitta (eds.)3540278729, 9783540278726

This book constitutes the refereed proceedings of the 6th International Symposium on Abstraction, Reformulation, and Approximation, SARA 2005, held in Airth Castle, Scotland, UK in July 2005.

The 17 revised full papers and 8 extended abstracts were carefully reviewed and selected for inclusion in the book. Also included are 3 invited papers and 8 research summaries. All current aspects of abstraction, reformulation, and approximation in the context of human common-sense reasoning, problem solving, and efficiently reasoning in complex domains are addressed. Among the application fields of these techniques are automatic programming, constraint satisfaction, design, diagnosis, machine learning, search, planning, reasoning, game playing, scheduling, and theorem proving.

---

Table of contents :
Front Matter….Pages –
Verifying the Incorrectness of Programs and Automata….Pages 1-13
Generating Admissible Heuristics by Abstraction for Search in Stochastic Domains….Pages 14-29
Synthesizing Plans for Multiple Domains….Pages 30-43
Abstract Policy Evaluation for Reactive Agents….Pages 44-59
Implementing an Abstraction Framework for Soft Constraints….Pages 60-75
Transforming and Refining Abstract Constraint Specifications….Pages 76-91
Learning Regular Expressions from Noisy Sequences….Pages 92-106
From Factorial and Hierarchical HMM to Bayesian Network: A Representation Change Algorithm….Pages 107-120
Hierarchical Heuristic Search Revisited….Pages 121-133
Multinomial Event Model Based Abstraction for Sequence and Text Classification….Pages 134-148
Petri Net Reachability Checking Is Polynomial with Optimal Abstraction Hierarchies….Pages 149-164
Detecting and Breaking Symmetries by Reasoning on Problem Specifications….Pages 165-181
Approximate Model-Based Diagnosis Using Preference-Based Compilation….Pages 182-193
Function Approximation via Tile Coding: Automating Parameter Choice….Pages 194-205
Creating Better Abstract Operators….Pages 206-217
A Specialised Binary Constraint for the Stable Marriage Problem….Pages 218-233
Compositional Derivation of Symmetries for Constraint Satisfaction….Pages 234-247
Solving the 24 Puzzle with Instance Dependent Pattern Databases….Pages 248-260
Combining Feature Selection and Feature Construction to Improve Concept Learning for High Dimensional Data….Pages 261-273
A Qualitative Spatio-temporal Abstraction of a Disaster Space….Pages 274-281
The Cruncher: Automatic Concept Formation Using Minimum Description Length….Pages 282-289
Experiments with Multiple Abstraction Heuristics in Symbolic Verification….Pages 290-304
Probabilistic Abstraction of Uncertain Temporal Data for Multiple Subjects….Pages 305-312
Learning Classifiers Using Hierarchically Structured Class Taxonomies….Pages 313-320
Feature-Discovering Approximate Value Iteration Methods….Pages 321-331
Designing Views to Efficiently Answer Real SQL Queries….Pages 332-346
The Multi-depot Periodic Vehicle Routing Problem….Pages 347-350
Abstract Representation in Painting and Computing….Pages 351-351
Categorizing Gene Expression Correlations with Bioclinical Data: An Abstraction Based Approach….Pages 352-353
Learning Abstract Scheduling Models….Pages 354-355
Knowledge Acquisition on Manipulation of Flow and Water Quality Models….Pages 356-357
Abstraction and Multiple Abstraction in the Symbolic Modeling of the Environment of Mobile Robots….Pages 358-359
Sequential Decision Making Under Uncertainty….Pages 360-361
Automatic State Abstraction for Pathfinding in Real-Time Video Games….Pages 362-364
Model-Based Search….Pages 365-366
Learning Skills in Reinforcement Learning Using Relative Novelty….Pages 367-374
Back Matter….Pages –