Abstraction, Reformulation, and Approximation: 5th International Symposium, SARA 2002, Kananaskis, Alberta, Canada, August 2-4, 2002, Proceedings

Front Cover
Sven Koenig, Robert C. Holte
Springer Science & Business Media, Jul 19, 2002 - Computers - 352 pages
0 Reviews
It has been recognized since the inception of Artificial Intelligence (AI) that abstractions, problem reformulations, and approximations (AR&A) are central to human common sense reasoning and problem solving and to the ability of systems to reason effectively in complex domains. AR&A techniques have been used to solve a variety of tasks, including automatic programming, constraint satisfaction, design, diagnosis, machine learning, search, planning, reasoning, game playing, scheduling, and theorem proving. The primary purpose of AR&A techniques in such settings is to overcome computational intractability. In addition, AR&A techniques are useful for accelerating learning and for summarizing sets of solutions. This volume contains the proceedings of SARA 2002, the fifth Symposium on Abstraction, Reformulation, and Approximation, held at Kananaskis Mountain Lodge, Kananaskis Village, Alberta (Canada), August 2 4, 2002. The SARA series is the continuation of two separate threads of workshops: AAAI workshops in 1990 and 1992, and an ad hoc series beginning with the "Knowledge Compilation" workshop in 1986 and the "Change of Representation and Inductive Bias" workshop in 1988 with followup workshops in 1990 and 1992. The two workshop series merged in 1994 to form the first SARA. Subsequent SARAs were held in 1995, 1998, and 2000.
 

What people are saying - Write a review

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

Contents

Model Checking and Abstraction
1
Reformulation in Planning
18
Spatiotemporal Abstraction of Stochastic Sequential Processes
33
State Space Relaxation and Search Strategies in Dynamic Programming
51
Admissible Moves in TwoPlayer Games
52
Less Effort for More Solutions
64
Symbolic Heuristic Search Using Decision Diagrams
83
On the Construction of HumanAutomation Interfaces by Formal Abstraction
99
The Oracular Constraints Method
290
Performance of Lookahead Control Policies in the Face of Abstractions and Approximations
299
TreeBased State Generalization with Temporally Abstract Actions
308
OntologyDriven Induction of Decision Trees at Multiple Levels of Abstraction
316
Abstracting Imperfect Information Game Trees
324
Using Abstraction for Heuristic Search and Planning
326
Approximation Techniques in Multiagent Learning
328
Abstraction and Reformulation in GraphPlan
330

Pareto Optimization of Temporal Decisions
116
An InformationTheoretic Characterization of Abstraction in Diagnosis and Hypothesis Selection
126
A Tractable Query Cache by Approximation
140
An Algebraic Framework for Abstract Model Checking
152
Action Timing Discretization with IterativeRefinement
170
Some Initial Results
178
Model Minimization in Hierarchical Reinforcement Learning
196
Learning Options in Reinforcement Learning
212
Approximation Techniques for Nonlinear Problems with Continuum of Solutions
224
Complexity and Semantics
242
Abstracting Visual Percepts to Learn Concepts
256
PAC Meditation on Boolean Formulas
274
On the Reformulation of Vehicle Routing Problems and Scheduling Problems
282
Abstract Reasoning for Planning and Coordination
331
Abstraction Techniques and Their Value
333
Reformulation of Nonbinary Constraints
335
Reformulating Combinatorial Optimization as Constraint Satisfaction
336
Autonomous Discovery of Abstractions through Interaction with an Environment
338
Discrete Abstractions of Hybrid Systems
340
Learning SemiLattice Codebooks for Image Compression
342
Research Summary
344
Principled Exploitation of Heuristic Information
345
Reformulation of Temporal Constraint Networks
347
Author Index
348
Copyright

Other editions - View all

Common terms and phrases

Bibliographic information