BEHNKE, G.; STEINMETZ, M. On the Computational Complexity of Stackelberg Planning and Meta-Operator Verification. Proceedings of the International Conference on Automated Planning and Scheduling, [S. l.], v. 34, n. 1, p. 20-24, 2024. DOI: 10.1609/icaps.v34i1.31456. Disponível em: https://ojs.aaai.org/index.php/ICAPS/article/view/31456. Acesso em: 26 jul. 2024.