Abstraction, Reformulation, and Approximation : 5th International Symposium, SARA 2002, Kananaskis, Alberta, Canada, August 2-4, 2002, Proceedings / edited by Sven Koenig, Robert C. Holte.

Format:

Book

Contributor:

Koenig, Sven, 1964- editor.

Holte, Robert C., editor.

SpringerLink (Online service)

Series:

Computer Science (Springer-11645)

Lecture notes in computer science. Lecture notes in artificial intelligence ; 2371.

Lecture Notes in Artificial Intelligence ; 2371

Language:

English

Subjects (All):

Artificial intelligence.

Computers.

Logic, Symbolic and mathematical.

Computer logic.

Artificial Intelligence.

Theory of Computation.

Mathematical Logic and Formal Languages.

Logics and Meanings of Programs.

Local Subjects:

Artificial Intelligence.

Theory of Computation.

Mathematical Logic and Formal Languages.

Logics and Meanings of Programs.

Physical Description:

1 online resource (XI, 352 pages).

Edition:

First edition 2002.

Contained In:

Springer eBooks

Place of Publication:

Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2002.

System Details:

text file PDF

Summary:

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.

Contents:

Invited Presentations

Model Checking and Abstraction

Reformulation in Planning

Spatiotemporal Abstraction of Stochastic Sequential Processes

State Space Relaxation and Search Strategies in Dynamic Programming

Invited Presentations

Admissible Moves in Two-Player Games

Dynamic Bundling: Less Effort for More Solutions

Symbolic Heuristic Search Using Decision Diagrams

On the Construction of Human-Automation Interfaces by Formal Abstraction

Pareto Optimization of Temporal Decisions

An Information-Theoretic Characterization of Abstraction in Diagnosis and Hypothesis Selection

A Tractable Query Cache by Approximation

An Algebraic Framework for Abstract Model Checking

Action Timing Discretization with Iterative-Refinement

Formalizing Approximate Objects and Theories: Some Initial Results

Model Minimization in Hierarchical Reinforcement Learning

Learning Options in Reinforcement Learning

Approximation Techniques for Non-linear Problems with Continuum of Solutions

Approximation of Relations by Propositional Formulas: Complexity and Semantics

Abstracting Visual Percepts to Learn Concepts

Short Presentations

PAC Meditation on Boolean Formulas

On the Reformulation of Vehicle Routing Problems and Scheduling Problems

The Oracular Constraints Method

Performance of Lookahead Control Policies in the Face of Abstractions and Approximations

TTree: Tree-Based State Generalization with Temporally Abstract Actions

Ontology-Driven Induction of Decision Trees at Multiple Levels of Abstraction

Research Summaries

Abstracting Imperfect Information Game Trees

Using Abstraction for Heuristic Search and Planning

Approximation Techniques in Multiagent Learning

Abstraction and Reformulation in GraphPlan

Abstract Reasoning for Planning and Coordination

Research Summary: Abstraction Techniques, and Their Value

Reformulation of Non-binary Constraints

Reformulating Combinatorial Optimization as Constraint Satisfaction

Autonomous Discovery of Abstractions through Interaction with an Environment

Interface Verification: Discrete Abstractions of Hybrid Systems

Learning Semi-lattice Codebooks for Image Compression

Research Summary

Principled Exploitation of Heuristic Information

Reformulation of Temporal Constraint Networks.

Other Format:

Printed edition:

ISBN:

978-3-540-45622-3

9783540456223

Access Restriction:

Restricted for use by site license.