B. Bonet and H. Geffner, Planning as heuristic search, Artificial Intelligence, vol.129, issue.1-2, 2001.
DOI : 10.1016/S0004-3702(01)00108-4

A. Botea, M. Müller, and J. Schaeffer, Using component abstraction for automatic generation of macro-actions, p.4, 2004.

R. Brafman and C. Domshlak, Structure and complexity in planning with unary operators, JAIR, vol.18, pp.315-349, 2004.

S. Edelkamp and M. Helmert, Exhibiting knowledge in planning problems to minimize state encoding length The automatic inference of state invariants in TIM, JAIR, vol.9, pp.367-421, 1998.

A. Gerevini and L. Schubert, Inferring state-constraints for domain independent planning, AAAI'98, pp.905-912, 1998.

P. Haslum, Reducing accidental complexity in planning problems, IJCAI'07, pp.1898-1904, 2007.

M. Helmert and C. Domshlak, Landmarks, critical paths and abstractions: What's the difference anyway?, 2009.

M. Helmert, The fast downward planning system, 2006.

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

J. Hoffmann, Where 'ignoring delete lists' works: Local search topology in planning benchmarks, JAIR, vol.24, pp.685-758, 2005.

J. Hoffmann, Analyzing Search Topology Without Running Any Search: On the Connection Between Causal Graphs and h +, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00598248

J. Rintanen, An iterative algorithm for synthesizing invariants, AAAI'00, pp.806-811, 2000.