1. Bylander, T.: The computational complexity of propositional STRIPS planning. Artif. Intell. 69(1–2), 165–204 (1994)
2. Chrpa, L., Faber, W., Fiser, D., Morak, M.: Determining action reversibility in STRIPS using answer set programming. In: Workshop Proceedings Co-located with ICLP 2020. CEUR Workshop Proceedings, vol. 2678. CEUR-WS.org (2020). http://ceur-ws.org/Vol-2678/paper2.pdf
3. Chrpa, L., Faber, W., Morak, M.: Universal and uniform action reversibility. In: KR 2021, pp. 651–654 (2021). https://doi.org/10.24963/kr.2021/63
4. Cserna, B., Doyle, W.J., Ramsdell, J.S., Ruml, W.: Avoiding dead ends in real-time heuristic search. In: AAAI 2018, pp. 1306–1313. AAAI Press (2018). https://www.aaai.org/ocs/index.php/AAAI/AAAI18/paper/view/17405
5. Daum, J., Torralba, Á., Hoffmann, J., Haslum, P., Weber, I.: Practical undoability checking via contingent planning. In: ICAPS 2016, pp. 106–114. AAAI Press (2016). http://www.aaai.org/ocs/index.php/ICAPS/ICAPS16/paper/view/13091