Skip to main content
  • Conference proceedings
  • © 2005

Abstraction, Reformulation and Approximation

6th International Symposium, SARA 2005, Airth Castle, Scotland, UK, July 26-29, 2005, Proceedings

Editors:

(view affiliations)

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

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

Conference series link(s): SARA: International Symposium on Abstraction, Reformulation, and Approximation

Conference proceedings info: SARA 2005.

Buying options

eBook
USD 84.99
Price excludes VAT (USA)
  • ISBN: 978-3-540-31882-8
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD 109.00
Price excludes VAT (USA)

This is a preview of subscription content, access via your institution.

Table of contents (36 papers)

  1. Front Matter

  2. Full Papers

    1. Verifying the Incorrectness of Programs and Automata

      • Scot Anderson, Peter Revesz
      Pages 1-13
    2. Synthesizing Plans for Multiple Domains

      • Abdelbaki Bouguerra, Lars Karlsson
      Pages 30-43
    3. Abstract Policy Evaluation for Reactive Agents

      • Krysia Broda, Christopher John Hogger
      Pages 44-59
    4. Implementing an Abstraction Framework for Soft Constraints

      • Alberto Delgado, Jorge Andrés Pérez, Camilo Rueda
      Pages 60-75
    5. Transforming and Refining Abstract Constraint Specifications

      • Alan M. Frisch, Brahim Hnich, Ian Miguel, Barbara M. Smith, Toby Walsh
      Pages 76-91
    6. Learning Regular Expressions from Noisy Sequences

      • Ugo Galassi, Attilio Giordana
      Pages 92-106
    7. From Factorial and Hierarchical HMM to Bayesian Network: A Representation Change Algorithm

      • Sylvain Gelly, Nicolas Bredeche, Michèle Sebag
      Pages 107-120
    8. Hierarchical Heuristic Search Revisited

      • Robert C. Holte, Jeffery Grajkowski, Brian Tanner
      Pages 121-133
    9. Multinomial Event Model Based Abstraction for Sequence and Text Classification

      • Dae-Ki Kang, Jun Zhang, Adrian Silvescu, Vasant Honavar
      Pages 134-148
    10. Function Approximation via Tile Coding: Automating Parameter Choice

      • Alexander A. Sherstov, Peter Stone
      Pages 194-205
    11. Creating Better Abstract Operators

      • Jonathan Teutenberg, Mike Barley
      Pages 206-217
    12. A Specialised Binary Constraint for the Stable Marriage Problem

      • Chris Unsworth, Patrick Prosser
      Pages 218-233
    13. Compositional Derivation of Symmetries for Constraint Satisfaction

      • Pascal Van Hentenryck, Pierre Flener, Justin Pearson, Magnus Ågren
      Pages 234-247

Other Volumes

  1. Abstraction, Reformulation and Approximation

    6th International Symposium, SARA 2005, Airth Castle, Scotland, UK, July 26-29, 2005. Proceedings

Keywords

  • Automat
  • Constraint Satisfaction
  • learning
  • machine learning
  • problem solving
  • proving
  • theorem proving

Editors and Affiliations

  • UR 079 GEODES, IRD, Bondy, France

    Jean-Daniel Zucker

  • Dip. di Informatica, Università del Piemonte Orientale, Alessandria, Italy

    Lorenza Saitta

Bibliographic Information

Buying options

eBook
USD 84.99
Price excludes VAT (USA)
  • ISBN: 978-3-540-31882-8
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD 109.00
Price excludes VAT (USA)