Abstraction, Reformulation, and Approximation

4th International Symposium, SARA 2000 Horseshoe Bay, USA, July 26–29, 2000 Proceedings

Editors:

ISBN: 978-3-540-67839-7 (Print) 978-3-540-44914-0 (Online)

Table of contents (29 chapters)

previous Page of 2
  1. Invited Talks

    1. No Access

      Book Chapter

      Pages 1-25

      Partial Completeness of Abstract Fixpoint Checking

    2. No Access

      Book Chapter

      Pages 26-44

      An Overview of MAXQ Hierarchical Reinforcement Learning

    3. No Access

      Book Chapter

      Pages 45-55

      Recent Progress in the Design and Analysis of Admissible Heuristic Functions

  2. Tutorial

    1. No Access

      Book Chapter

      Pages 57-70

      GIS Databases: From Multiscale to MultiRepresentation

  3. Full Papers

    1. No Access

      Book Chapter

      Pages 71-86

      An Abstraction Framework for Soft Constraints and Its Relationship with Constraint Propagation

    2. No Access

      Book Chapter

      Pages 87-106

      Abstractions for Knowledge Organization of Relational Descriptions

    3. No Access

      Book Chapter

      Pages 107-123

      Grid-Based Histogram Arithmetic for the Probabilistic Analysis of Functions

    4. No Access

      Book Chapter

      Pages 124-143

      Approximating Data in Constraint Databases

    5. No Access

      Book Chapter

      Pages 144-163

      Linearly Bounded Reformulations of Unary Databases

    6. No Access

      Book Chapter

      Pages 164-184

      A CSP Abstraction Framework

    7. No Access

      Book Chapter

      Pages 185-201

      Interactions of Abstractions in Programming

    8. No Access

      Book Chapter

      Pages 202-218

      Reformulation and Approximation in Model Checking

    9. No Access

      Book Chapter

      Pages 219-232

      The Lumberjack Algorithm for Learning Linked Decision Forests

    10. No Access

      Book Chapter

      Pages 233-246

      Reformulating Propositional Satisfiability as Constraint Satisfaction

  4. Extended Abstracts

    1. No Access

      Book Chapter

      Pages 247-259

      Improving the Efficiency of Reasoning Through Structure-Based Reformulation

    2. No Access

      Book Chapter

      Pages 260-270

      Using Feature Hierarchies in Bayesian Network Learning

    3. No Access

      Book Chapter

      Pages 271-280

      On Reformulating Planning as Dynamic Constraint Satisfaction

    4. No Access

      Book Chapter

      Pages 281-290

      Experiments with Automatically Created Memory-Based Heuristics

    5. No Access

      Book Chapter

      Pages 291-301

      Abstraction and Phase Transitions in Relational Learning

  5. Posters

    1. No Access

      Book Chapter

      Pages 303-308

      An Agent-Based Approach to Robust Switching Between Abstraction Levels for Fault Diagnosis

previous Page of 2