6. SARA 2005:
Airth Castle,
Scotland,
UK
 Jean-Daniel Zucker, Lorenza Saitta (Eds.):
Abstraction, Reformulation and Approximation, 6th International Symposium, SARA 2005, Airth Castle, Scotland, UK, July 26-29, 2005, Proceedings.
Lecture Notes in Computer Science 3607 Springer 2005, ISBN 3-540-27872-9  
  
  
  
  
 
Full Papers
 
- Scot Anderson, Peter Z. Revesz:
 Verifying the Incorrectness of Programs and Automata.
1-13
             
- Natalia N. Beliaeva, Shlomo Zilberstein:
 Generating Admissible Heuristics by Abstraction for Search in Stochastic Domains.
14-29
             
- Abdelbaki Bouguerra, Lars Karlsson:
 Synthesizing Plans for Multiple Domains.
30-43
             
- Krysia Broda, Christopher J. Hogger:
 Abstract Policy Evaluation for Reactive Agents.
44-59
             
- Alberto Delgado, Jorge Andrés Pérez, Camilo Rueda:
 Implementing an Abstraction Framework for Soft Constraints.
60-75
             
- Alan M. Frisch, Brahim Hnich, Ian Miguel, Barbara M. Smith, Toby Walsh:
 Transforming and Refining Abstract Constraint Specifications.
76-91
             
- Ugo Galassi, Attilio Giordana:
 Learning Regular Expressions from Noisy Sequences.
92-106
             
- Sylvain Gelly, Nicolas Bredeche, Michèle Sebag:
 From Factorial and Hierarchical HMM to Bayesian Network: A Representation Change Algorithm.
107-120
             
- Robert C. Holte, Jeffery Grajkowski, Brian Tanner:
 Hierarchical Heuristic Search Revisited.
121-133
             
- Dae-Ki Kang, Jun Zhang, Adrian Silvescu, Vasant Honavar:
 Multinomial Event Model Based Abstraction for Sequence and Text Classification.
134-148
             
- Peep Küngas:
 Petri Net Reachability Checking Is Polynomial with Optimal Abstraction Hierarchies.
149-164
             
- Toni Mancini, Marco Cadoli:
 Detecting and Breaking Symmetries by Reasoning on Problem Specifications.
165-181
             
- Gregory M. Provan:
 Approximate Model-Based Diagnosis Using Preference-Based Compilation.
182-193
             
- Alexander A. Sherstov, Peter Stone:
 Function Approximation via Tile Coding: Automating Parameter Choice.
194-205
             
- Jonathan Teutenberg, Mike Barley:
 Creating Better Abstract Operators.
206-217
             
- Chris Unsworth, Patrick Prosser:
 A Specialised Binary Constraint for the Stable Marriage Problem.
218-233
             
- Pascal Van Hentenryck, Pierre Flener, Justin Pearson, Magnus Ågren:
 Compositional Derivation of Symmetries for Constraint Satisfaction.
234-247
             
Extended Abstracts
 
Invited Talks
 
Research Summaries
 
Copyright © Fri Mar 12 17:20:43 2010
 by Michael Ley (ley@uni-trier.de)