C. Bäckström and I. Klein, Planning in polynomial time: the SAS-PUBS class, Computational Intelligence, vol.7, issue.3, 1991.
DOI : 10.1016/0004-3702(87)90052-X

C. Bäckström and B. Nebel, PLANNING, Computational Intelligence, vol.7, issue.3, pp.625-655, 1995.
DOI : 10.1016/0004-3702(94)90005-1

A. L. Blum and M. L. Furst, Fast planning through planning graph analysis, Artificial Intelligence, vol.90, issue.1-2, pp.279-298, 1997.
DOI : 10.1016/S0004-3702(96)00047-1
URL : http://doi.org/10.1016/s0004-3702(96)00047-1

B. Bonet and H. Geffner, Planning as heuristic search, Artificial Intelligence, vol.129, issue.1-2, pp.5-33, 2001.
DOI : 10.1016/S0004-3702(01)00108-4
URL : http://doi.org/10.1016/s0004-3702(01)00108-4

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

R. Brafman and C. Domshlak, Structure and complexity in planning with unary operators, Journal of Artificial Intelligence Research, vol.18, pp.315-349, 2003.

T. Bylander, The computational complexity of propositional STRIPS planning, Artificial Intelligence, vol.69, issue.1-2, pp.165-204, 1994.
DOI : 10.1016/0004-3702(94)90081-7

A. Cesta and D. Borrajo, Recent Advances in AI Planning, ECP'01 6th European Conference on Planning (ECP'01), 2001.

H. Chen and O. Giménez, Causal graphs and structurally restricted planning, Journal of Computer and System Sciences, vol.76, issue.7, pp.579-592, 2010.
DOI : 10.1016/j.jcss.2009.10.013
URL : http://doi.org/10.1016/j.jcss.2009.10.013

C. Domshlak and Y. Dinitz, Multi-agent offline coordination: Structure and complexity, pp.34-43, 2001.

S. Edelkamp and M. Helmert, Exhibiting Knowledge in Planning Problems to Minimize State Encoding Length, Recent Advances in AI Planning. 5th European Conference on Planning (ECP'99), pp.135-147, 1999.
DOI : 10.1007/10720246_11

M. Fox and D. Long, The automatic inference of state invariants in TIM, Journal of Artificial Intelligence Research, vol.9, pp.367-421, 1998.

M. Fox and D. Long, The detection and exploitation of symmetry in planning problems, Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI'99), pp.956-961, 1999.

M. R. Garey and D. S. Johnson, Computers and Intractability?A Guide to the Theory of NP-Completeness, 1979.

A. Gerevini, A. Saetti, and I. Serina, Planning through stochastic local search and temporal action graphs, Journal of Artificial Intelligence Research, vol.20, pp.239-290, 2003.

A. Gerevini and L. Schubert, Inferring state-constraints for domain independent planning, Proceedings of the 15th National Conference of the American Association for Artificial Intelligence (AAAI'98), pp.905-912, 1998.

O. Giménez and A. Jonsson, The complexity of planning problems with simple causal graphs, Journal of Artificial Intelligence Research, vol.31, pp.319-351, 2008.

O. Giménez and A. Jonsson, The influence of k-dependence on the complexity of planning, Gerevini et al, pp.138-145, 2009.
DOI : 10.1016/j.artint.2011.12.002

O. Giménez and A. Jonsson, Planning over chain causal graphs for variables with domains of size 5 is NP-hard, Journal of Artificial Intelligence Research, vol.34, pp.675-706, 2009.

P. Haslum, Reducing accidental complexity in planning problems, Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI'07), pp.1898-1903, 2007.

M. Helmert, Complexity results for standard benchmark domains in planning, Artificial Intelligence, vol.143, issue.2, pp.219-262, 2003.
DOI : 10.1016/S0004-3702(02)00364-8

M. Helmert, A planning heuristic based on causal graph analysis, pp.161-170, 2004.

M. Helmert, The fast downward planning system, Journal of Artificial Intelligence Research, vol.26, pp.191-246, 2006.

M. Helmert, Concise finite-domain representations for PDDL planning tasks, Artificial Intelligence, vol.173, issue.5-6, pp.5-6, 2009.
DOI : 10.1016/j.artint.2008.10.013

M. Helmert and C. Domshlak, Landmarks, critical paths and abstractions: What's the difference anyway?, Gerevini et al, pp.162-169, 2009.

J. Hoffmann, Utilizing Problem Structure in Planning: A Local Search Approach, Lecture Notes in Artificial Intelligence, vol.2854, 2003.
DOI : 10.1007/b93903

J. Hoffmann, Where 'ignoring delete lists' works: Local search topology in planning benchmarks, Journal of Artificial Intelligence Research, vol.24, pp.685-758, 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.

J. Hoffmann and B. Nebel, RIFO revisited: Detecting relaxed irrelevance, pp.325-336, 2001.

J. Hoffmann, J. Porteous, and L. Sebastia, Ordered landmarks in planning, Journal of Artificial Intelligence Research, vol.22, pp.215-278, 2004.

A. Jonsson, The role of macros in tractable planning, Journal of Artificial Intelligence Research, vol.36, pp.471-511, 2009.

P. Jonsson and C. Bäckström, Incremental planning, European Workshop on Planning, 1995.

P. Jonsson and C. Bäckström, State-variable planning under structural restrictions: algorithms and complexity, Artificial Intelligence, vol.100, issue.1-2, pp.125-176, 1998.
DOI : 10.1016/S0004-3702(98)00003-4
URL : http://doi.org/10.1016/s0004-3702(98)00003-4

E. Karpas and C. Domshlak, Cost-optimal planning with landmarks, Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI'09), pp.1728-1733, 2009.

M. Katz and C. Domshlak, New islands of tractability of cost-optimal planning, Journal of Artificial Intelligence Research, vol.32, pp.203-288, 2008.

M. Katz and C. Domshlak, Structural patterns heuristics via fork decomposition, Proceedings of the 18th International Conference on Automated Planning and Scheduling (ICAPS'08), pp.182-189, 2008.

C. Knoblock, Automatically generating abstractions for planning, Artificial Intelligence, vol.68, issue.2, pp.243-302, 1994.
DOI : 10.1016/0004-3702(94)90069-8
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.32.4337

D. Long and M. Fox, Automatic synthesis and use of generic types in planning, Proceedings of the 5th International Conference on Artificial Intelligence Planning Systems (AIPS'00), pp.196-205, 2000.

D. V. Mcdermott, Using regression-match graphs to control search in planning, Artificial Intelligence, vol.109, issue.1-2, pp.111-159, 1999.
DOI : 10.1016/S0004-3702(99)00010-7

B. Nebel, Y. Dimopoulos, and J. Koehler, Ignoring irrelevant facts and operators in plan generation, Recent Advances in AI Planning. 4th European Conference on Planning (ECP'97), pp.338-350, 1997.
DOI : 10.1007/3-540-63912-8_97

S. Richter, M. Helmert, and M. Westphal, Landmarks revisited, Proceedings of the 23rd National Conference of the American Association for Artificial Intelligence (AAAI'08), pp.975-982, 2008.

S. Richter and M. Westphal, The LAMA planner: Guiding cost-based anytime planning with landmarks, Journal of Artificial Intelligence Research, vol.39, pp.127-177, 2010.

J. Rintanen, An iterative algorithm for synthesizing invariants, Proceedings of the 17th National Conference of the American Association for Artificial Intelligence (AAAI'00), pp.806-811, 2000.

M. Roberts and A. Howe, Learning from planner performance, Artificial Intelligence, vol.173, issue.5-6, pp.636-561, 2009.
DOI : 10.1016/j.artint.2008.11.009
URL : http://doi.org/10.1016/j.artint.2008.11.009

V. Vidal, A lookahead strategy for heuristic search planning, pp.150-160, 2004.

B. C. Williams and P. P. Nayak, A reactive planner for a model-based executive, Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI'97), pp.1178-1185, 1997.