Front matter
1-17
Model Checking and Abstraction
Robert P. Kurshan
18-32
Reformulation in Planning
Derek Long, Maria Fox and Muna Hamdi
33-50
Spatiotemporal Abstraction of Stochastic Sequential Processes
Sridhar Mahadevan
51
State Space Relaxation and Search Strategies in Dynamic Programming
Aristide Mingozzi
52-63
Admissible Moves in Two-Player Games
Tristan Cazenave
64-82
Dynamic Bundling: Less Effort for More Solutions
Berthe Y. Choueiry and Amy M. Davis
83-98
Symbolic Heuristic Search Using Decision Diagrams
Eric Hansen, Rong Zhou and Zhengzhu Feng
99-115
On the Construction of Human-Automation Interfaces by Formal Abstraction
Michael Heymann and Asaf Degani
116-125
Pareto Optimization of Temporal Decisions
Lina Khatib, Paul Morris and Robert Morris
126-139
An Information-Theoretic Characterization of Abstraction in Diagnosis and Hypothesis Selection
T. K. Satish Kumar
178-187
A Tractable Query Cache by Approximation
Daniel Miranker, Malcolm C. Taylor and Anand Padmanaban
152-169
An Algebraic Framework for Abstract Model Checking
Supratik Mukhopadhyay and Andreas Podelski
170-177
Action Timing Discretization with Iterative-Refinement
Todd W. Neller
178-195
Formalizing Approximate Objects and Theories: Some Initial Results
Aarati Parmar
196-211
Model Minimization in Hierarchical Reinforcement Learning
Balaraman Ravindran and Andrew G. Barto
212-223
Learning Options in Reinforcement Learning
Martin Stolle and Doina Precup
224-241
Approximation Techniques for Non-linear Problems with Continuum of Solutions
Xuan-Ha Vu, Djamila Sam-Haroud and Marius-Calin Silaghi
242-255
Approximation of Relations by Propositional Formulas: Complexity and Semantics
Bruno Zanuttini
256-273
Abstracting Visual Percepts to Learn Concepts
Jean-Daniel Zucker, Nicolas Bredeche and Lorenza Saitta
274-281
PAC Meditation on Boolean Formulas
Bruno Apolloni, Fabio Baraghini and Giorgio Palmas
282-289
On the Reformulation of Vehicle Routing Problems and Scheduling Problems
J. Christopher Beck, Patrick Prosser and Evgeny Selensky
290-298
The Oracular Constraints Method
T. K. Satish Kumar and Richard Dearden
299-307
Performance of Lookahead Control Policies in the Face of Abstractions and Approximations
Ilya Levner, 1Vadim Bulitko, Omid Madani and Russell Greiner
308-315
TTree: Tree-Based State Generalization with Temporally Abstract Actions
William T. B. Uther and Manuela M. Veloso
316-323
Ontology-Driven Induction of Decision Trees at Multiple Levels of Abstraction
Jun Zhang, Adrian Silvescu and Vasant Honavar
324-325
Abstracting Imperfect Information Game Trees
Darse Billings
326-327
Using Abstraction for Heuristic Search and Planning
Research Summary
Adi Botea
328-329
Approximation Techniques in Multiagent Learning
Michael Bowling
330
Abstraction and Reformulation in GraphPlan
Daniel Buettner
331-332
Abstract Reasoning for Planning and Coordination
Bradley J. Clement
333-334
Research Summary: Abstraction Techniques, and Their Value
Irit Askira Gelman
335
Reformulation of Non-binary Constraints
Robert Glaubius
336-337
Reformulating Combinatorial Optimization as Constraint Satisfaction
T. K. Satish Kumar
338-339
Autonomous Discovery of Abstractions through Interaction with an Environment
Amy McGovern
340-341
Interface Verification: Discrete Abstractions of Hybrid Systems
Meeko Oishi
342-343
Learning Semi-lattice Codebooks for Image Compression
Research Summary
Yoshiaki Okubo and Xiaobo Li
344
Research Summary
Marc Pickett
345-346
Principled Exploitation of Heuristic Information
Research Summary
Wheeler Ruml
347
Reformulation of Temporal Constraint Networks
Lin Xu
Back matter