M. Baioletti, S. Marcugini, and A. Milani, Dpplan: An algorithm for fast solutions extraction from a planning graph, AIPS, pp.13-21, 2000.

A. Blum and M. Furst, Fast planning through planning graph analysis, Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI 95, pp.1636-1642, 1995.

M. B. Do and S. Kambhampati, Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP, Artif. Intell, vol.132, issue.2, pp.151-182, 2001.

P. Haslum and H. Geffner, Admissible heuristics for optimal planning, AIPS, pp.140-149, 2000.

P. Haslum, B. Bonet, and H. Geffner, New admissible heuristics for domain-independent planning, pp.1163-1168, 2005.

J. Hoffmann and B. Nebel, The FF planning system: Fast plan generation through heuristic search, Journal of Artificial Intelligence Research, vol.14, pp.253-302, 2001.

S. Kambhampati, Planning graph as a (dynamic) CSP: Exploiting EBL, DDB and other CSP search techniques in graphplan, Journal of AI Research, vol.12, issue.1, pp.1-34, 2000.

H. A. Kautz and B. Selman, Unifying sat-based and graph-based planning, IJCAI, pp.318-325, 1999.

A. Lopez and F. Bacchus, Generalizing graphplan by formulating planning as a CSP, pp.954-960, 2003.

A. Mackworth, Consistency in networks of relations, In Artificial Intelligence, vol.8, pp.99-118, 1977.

J. Rintanen, P. Van-beek, C. , and X. , A planning algorithm not based on directional search, AAAI/IAAI, pp.585-590, 1998.

T. Vossen, M. Ball, A. Lotem, and D. S. Nau, On the use of integer programming models in ai planning, IJCAI, pp.304-309, 1999.

R. Zhou and E. A. Hansen, Breadth-first heuristic search, pp.92-100, 2004.