Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Abstraction, Reformulation, and Approximation

5th International Symposium, SARA 2002, Kananaskis, Alberta, Canada, August 2-4, 2002, Proceedings

  • Conference proceedings
  • © 2002

Overview

Editors:
  1. Sven Koenig

    1. College of Computing, Georgia Institute of Technology, Atlanta, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Robert C. Holte

    1. Department of Computing Science, Universtity of Alberta, Edmonton, Canada

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 2371)

Part of the book sub series: Lecture Notes in Artificial Intelligence (LNAI)

Included in the following conference series:

Conference proceedings info: SARA 2002.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

About this book

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.

Similar content being viewed by others

Keywords

Table of contents (39 papers)

  1. Front Matter

    Pages I-XI
    Download chapter PDF

  2. Invited Presentations

    1. Model Checking and Abstraction

      • Robert P. Kurshan
      Pages 1-17

    2. Reformulation in Planning

      • Derek Long, Maria Fox, Muna Hamdi
      Pages 18-32

    3. Spatiotemporal Abstraction of Stochastic Sequential Processes

      • Sridhar Mahadevan
      Pages 33-50

    4. State Space Relaxation and Search Strategies in Dynamic Programming

      • Aristide Mingozzi
      Pages 51-51

  3. Invited Presentations

    1. Admissible Moves in Two-Player Games

      • Tristan Cazenave
      Pages 52-63

    2. Dynamic Bundling: Less Effort for More Solutions

      • Berthe Y. Choueiry, Amy M. Davis
      Pages 64-82

    3. Symbolic Heuristic Search Using Decision Diagrams

      • Eric Hansen, Rong Zhou, Zhengzhu Feng
      Pages 83-98

    4. On the Construction of Human-Automation Interfaces by Formal Abstraction

      • Michael Heymann, Asaf Degani
      Pages 99-115

    5. Pareto Optimization of Temporal Decisions

      • Lina Khatib, Paul Morris, Robert Morris
      Pages 116-125

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

      • T. K. Satish Kumar
      Pages 126-139

    7. A Tractable Query Cache by Approximation

      • Daniel Miranker, Malcolm C. Taylor, Anand Padmanaban
      Pages 140-151

    8. An Algebraic Framework for Abstract Model Checking

      • Supratik Mukhopadhyay, Andreas Podelski
      Pages 152-169

    9. Action Timing Discretization with Iterative-Refinement

      • Todd W. Neller
      Pages 170-177

    10. Formalizing Approximate Objects and Theories: Some Initial Results

      • Aarati Parmar
      Pages 178-195

    11. Model Minimization in Hierarchical Reinforcement Learning

      • Balaraman Ravindran, Andrew G. Barto
      Pages 196-211

    12. Learning Options in Reinforcement Learning

      • Martin Stolle, Doina Precup
      Pages 212-223

    13. Approximation Techniques for Non-linear Problems with Continuum of Solutions

      • Xuan-Ha Vu, Djamila Sam-Haroud, Marius-Calin Silaghi
      Pages 224-241

    14. Approximation of Relations by Propositional Formulas: Complexity and Semantics

      • Bruno Zanuttini
      Pages 242-255

    15. Abstracting Visual Percepts to Learn Concepts

      • Jean-Daniel Zucker, Nicolas Bredeche, Lorenza Saitta
      Pages 256-273
Back to top

Other volumes

  1. Abstraction, Reformulation, and Approximation

Editors and Affiliations

  • College of Computing, Georgia Institute of Technology, Atlanta, USA

    Sven Koenig

  • Department of Computing Science, Universtity of Alberta, Edmonton, Canada

    Robert C. Holte

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation