B. B. Geffner-h, Labeled RTDP: Improving the convergence of real-time dynamic programming, Proceedings of the 13th International Conference on Automated Planning and Scheduling (ICAPS-03), pp.12-21, 2003.

G. R. Leach-s and . Dean-t, Model reduction techniques for computing approximately optimal solutions for Markov Decision Processes, pp.1-8, 1997.

G. R. Leach-s and . Dean-t, Bounded-parameter Markov Decision Processes, Artificial Intelligence, vol.122, issue.12, pp.71-109, 2000.

H. P. Botea-a, . Helmert-m, . Bonet-b, and . Koenig-s, Domain-independent construction of pattern database heuristics for cost-optimal planning, Proceedings of the 22nd National Conference of the American Association for Artificial Intelligence (AAAI-07), pp.1007-1012, 2007.

H. M. and H. P. Hoffmann-j, Flexible abstraction heuristics for optimal sequential planning, Proceedings of the 17th International Conference on Automated Planning and Scheduling (ICAPS-07), pp.176-183, 2007.

K. M. Kwiatkowska-m and N. G. Parker-d, A game-based abstractionrefinement framework for Markov Decision Processes, Form, vol.36, issue.3, pp.246-280, 2010.

K. M. and H. J. Helmert-m, How to relax a bisimulation?, Proceedings of the 22nd International Conference on Automated Planning and Scheduling, 2012.

N. R. and H. J. Helmert-m, Computing perfect heuristics in polynomial time: On bisimulation and merge-and-shrink abstraction in optimal planning, Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI'11), pp.1983-1990, 2011.

S. T. Singh-s, Lossy stochastic game abstraction with bounds, Proceedings of the 13th ACM Conference on Electronic Commerce, pp.880-897, 2012.

W. K. Schnizlein-d, . &. Bowling-m, and . Szafron-d, Abstraction pathologies in extensive games, Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems, pp.781-788, 2009.