[1]
Hecher, M. and Kiesel, R. 2024. On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions?. Proceedings of the AAAI Conference on Artificial Intelligence. 38, 9 (Mar. 2024), 10535–10543. DOI:https://doi.org/10.1609/aaai.v38i9.28923.