Shleyfman, Alexander. 2021. “On Computational Complexity of Automorphism Groups in Classical Planning”. Proceedings of the International Conference on Automated Planning and Scheduling 29 (1):428-36. https://doi.org/10.1609/icaps.v29i1.3507.