S. Grandcolas and C. Pain-barre, Filtering, decomposition and search space reduction for optimal sequential planning, Proceedings of the Twenty-Second Conference on Artificial Intelligence (AAAI-07), pp.993-998, 2007.
URL : https://hal.archives-ouvertes.fr/hal-02471078

R. E. Korf, Depth-first iterative-deepening: An optimal admissible tree search, Artificial Intelligence, vol.27, pp.97-109, 1985.

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

M. Büttner and J. Rintanen, Improving parallel planning with constraints on the number of operators, Proceedings of the 15th International Conference on Automated Planning and Scheduling, pp.292-299, 2005.

G. Gabriel and S. Grandcolas, Searching optimal parallel plans: A filtering and decomposition approach, proceedings of the 21st International Conference on Tools with Artificial Intelligence, pp.576-580, 2009.
URL : https://hal.archives-ouvertes.fr/hal-02471093

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.

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

Y. Chen, Z. Xing, and W. Zhang, Long-distance mutual exclusion for propositional planning, IJCAI'07: Proceedings of the 20th international joint conference on Artifical intelligence, pp.1840-1845, 2007.

Y. Dimopoulos, B. Nebel, and J. Koehler, Encoding planning problems in nonmonotonic logic programs, ECP '97: Proceedings of the 4th European Conference on Planning, pp.169-181, 1997.

J. Rintanen, K. Heljanko, and I. Niemelä, Planning as satisfiability: parallel plans and algorithms for plan search, Artif. Intell, vol.170, pp.1031-1080, 2006.

M. Wehrle and J. Rintanen, Planning as satisfiability with relaxed ∃-step plans, AI'07: Proceedings of the 20th Australian joint conference on Advances in artificial intelligence, pp.244-253, 2007.