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

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

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.

Author(s): Robert P. Kurshan (auth.), Sven Koenig, Robert C. Holte (eds.)
Series: Lecture Notes in Computer Science 2371 : Lecture Notes in Artificial Intelligence
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2002

Language: English
Pages: 352
Tags: Artificial Intelligence (incl. Robotics); Mathematical Logic and Formal Languages; Logics and Meanings of Programs

Model Checking and Abstraction....Pages 1-17
Reformulation in Planning....Pages 18-32
Spatiotemporal Abstraction of Stochastic Sequential Processes....Pages 33-50
State Space Relaxation and Search Strategies in Dynamic Programming....Pages 51-51
Admissible Moves in Two-Player Games....Pages 52-63
Dynamic Bundling: Less Effort for More Solutions....Pages 64-82
Symbolic Heuristic Search Using Decision Diagrams....Pages 83-98
On the Construction of Human-Automation Interfaces by Formal Abstraction....Pages 99-115
Pareto Optimization of Temporal Decisions....Pages 116-125
An Information-Theoretic Characterization of Abstraction in Diagnosis and Hypothesis Selection....Pages 126-139
A Tractable Query Cache by Approximation....Pages 140-151
An Algebraic Framework for Abstract Model Checking....Pages 152-169
Action Timing Discretization with Iterative-Refinement....Pages 170-177
Formalizing Approximate Objects and Theories: Some Initial Results....Pages 178-195
Model Minimization in Hierarchical Reinforcement Learning....Pages 196-211
Learning Options in Reinforcement Learning....Pages 212-223
Approximation Techniques for Non-linear Problems with Continuum of Solutions....Pages 224-241
Approximation of Relations by Propositional Formulas: Complexity and Semantics....Pages 242-255
Abstracting Visual Percepts to Learn Concepts....Pages 256-273
PAC Meditation on Boolean Formulas....Pages 274-281
On the Reformulation of Vehicle Routing Problems and Scheduling Problems....Pages 282-289
The Oracular Constraints Method....Pages 290-298
Performance of Lookahead Control Policies in the Face of Abstractions and Approximations....Pages 299-307
TTree: Tree-Based State Generalization with Temporally Abstract Actions....Pages 308-315
Ontology-Driven Induction of Decision Trees at Multiple Levels of Abstraction....Pages 316-323
Abstracting Imperfect Information Game Trees....Pages 324-325
Using Abstraction for Heuristic Search and Planning....Pages 326-327
Approximation Techniques in Multiagent Learning....Pages 328-329
Abstraction and Reformulation in GraphPlan....Pages 330-330
Abstract Reasoning for Planning and Coordination....Pages 331-332
Research Summary: Abstraction Techniques, and Their Value....Pages 333-334
Reformulation of Non-binary Constraints....Pages 335-335
Reformulating Combinatorial Optimization as Constraint Satisfaction....Pages 336-337
Autonomous Discovery of Abstractions through Interaction with an Environment....Pages 338-339
Interface Verification: Discrete Abstractions of Hybrid Systems....Pages 340-341
Learning Semi-lattice Codebooks for Image Compression....Pages 342-343
Research Summary....Pages 344-344
Principled Exploitation of Heuristic Information....Pages 345-346
Reformulation of Temporal Constraint Networks....Pages 347-347