1. A. Belov, D. Diepold, M.J. Heule and M. Järvisalo, SAT Competition 2014, 2014.
2. A probabilistic analysis of prepositional STRIPS planning;Bylander;Artificial Intelligence,1996
3. P. Cheeseman, B. Kanefsky and W. Taylor, Where the really hard problems are, in: Proceedings of the Twelfth International Joint Conference on Artificial Intelligence (IJCAI), 1991, pp. 331–337.
4. E. Cohen and J.C. Beck, Problem difficulty and the phase transition in heuristic search, in: Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017, pp. 780–786.
5. A. Coles, M. Fox and A. Smith, A new local-search algorithm for forward-chaining planning, in: Proceedings of the Seventeenth International Conference on Automated Planning and Scheduling, ICAPS, 2007, pp. 89–96.