Abstraction, Reformulation, and Approximation

7th International Symposium, SARA 2007, Whistler, Canada, July 18-21, 2007. Proceedings

Editors:

ISBN: 978-3-540-73579-3 (Print) 978-3-540-73580-9 (Online)

Table of contents (42 chapters)

previous Page of 3
  1. Front Matter

    Pages -

  2. Invited Talks (Abstracts)

    1. No Access

      Book Chapter

      Pages 1-1

      State Abstraction in Real-Time Heuristic Search

    2. No Access

      Book Chapter

      Pages 2-3

      Abstraction and Reformulation in the Generation of Constraint Models

    3. No Access

      Book Chapter

      Pages 4-4

      A Framework for Integrating Optimization and Constraint Programming

  3. Research Papers

    1. No Access

      Book Chapter

      Pages 5-19

      DFS-Tree Based Heuristic Search

    2. No Access

      Book Chapter

      Pages 20-34

      Partial Pattern Databases

    3. No Access

      Book Chapter

      Pages 35-49

      CDB-PV: A Constraint Database-Based Program Verifier

    4. No Access

      Book Chapter

      Pages 50-63

      Generating Implied Boolean Constraints Via Singleton Consistency

    5. No Access

      Book Chapter

      Pages 64-79

      Reformulating Constraint Satisfaction Problems to Improve Scalability

    6. No Access

      Book Chapter

      Pages 80-92

      Reformulating Global Constraints: The Slide and Regular Constraints

    7. No Access

      Book Chapter

      Pages 93-108

      Relaxation of Qualitative Constraint Networks

    8. No Access

      Book Chapter

      Pages 109-123

      Dynamic Domain Abstraction Through Meta-diagnosis

    9. No Access

      Book Chapter

      Pages 124-138

      Channeling Abstraction

    10. No Access

      Book Chapter

      Pages 139-154

      Approximate Model-Based Diagnosis Using Greedy Stochastic Search

    11. No Access

      Book Chapter

      Pages 155-168

      Combining Perimeter Search and Pattern Database Abstractions

    12. No Access

      Book Chapter

      Pages 169-183

      Solving Satisfiability in Ground Logic with Equality by Efficient Conversion to Propositional Logic

    13. No Access

      Book Chapter

      Pages 184-199

      Tailoring Solver-Independent Constraint Models: A Case Study with Essence′ and Minion

    14. No Access

      Book Chapter

      Pages 200-214

      A Meta-CSP Model for Optimal Planning

    15. No Access

      Book Chapter

      Pages 215-229

      Reformulation for Extensional Reasoning

    16. No Access

      Book Chapter

      Pages 230-242

      An Abstract Theory and Ontology of Motion Based on the Regions Connection Calculus

    17. No Access

      Book Chapter

      Pages 243-257

      Computing and Using Lower and Upper Bounds for Action Elimination in MDP Planning

previous Page of 3