[1]
Bachor, P., Dekker, P.M. and Behnke, G. 2025. Is This Plan Necessarily Redundant? On the Computational Complexity of Unobserved Domain Learning. Proceedings of the International Conference on Automated Planning and Scheduling. 35, 1 (Sep. 2025), 11-20. DOI:https://doi.org/10.1609/icaps.v35i1.36096.