Abstraction, Reformulation and Approximation

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

  • Jean-Daniel Zucker
  • Lorenza Saitta
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3607)

Table of contents

  1. Front Matter
  2. Full Papers

    1. Scot Anderson, Peter Revesz
      Pages 1-13
    2. Abdelbaki Bouguerra, Lars Karlsson
      Pages 30-43
    3. Krysia Broda, Christopher John Hogger
      Pages 44-59
    4. Alberto Delgado, Jorge Andrés Pérez, Camilo Rueda
      Pages 60-75
    5. Alan M. Frisch, Brahim Hnich, Ian Miguel, Barbara M. Smith, Toby Walsh
      Pages 76-91
    6. Ugo Galassi, Attilio Giordana
      Pages 92-106
    7. Sylvain Gelly, Nicolas Bredeche, Michèle Sebag
      Pages 107-120
    8. Robert C. Holte, Jeffery Grajkowski, Brian Tanner
      Pages 121-133
    9. Dae-Ki Kang, Jun Zhang, Adrian Silvescu, Vasant Honavar
      Pages 134-148
    10. Alexander A. Sherstov, Peter Stone
      Pages 194-205
    11. Jonathan Teutenberg, Mike Barley
      Pages 206-217
    12. Chris Unsworth, Patrick Prosser
      Pages 218-233
    13. Pascal Van Hentenryck, Pierre Flener, Justin Pearson, Magnus Ågren
      Pages 234-247
  3. Extended Abstracts

About these proceedings

Keywords

Automat Constraint Satisfaction learning machine learning problem solving proving theorem proving

Editors and affiliations

  • Jean-Daniel Zucker
    • 1
  • Lorenza Saitta
    • 2
  1. 1.UR 079 GEODES, IRDBondyFrance
  2. 2.Dip. di InformaticaUniversità del Piemonte OrientaleAlessandriaItaly

Bibliographic information

  • DOI https://doi.org/10.1007/11527862
  • Copyright Information Springer-Verlag Berlin Heidelberg 2005
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-27872-6
  • Online ISBN 978-3-540-31882-8
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book