Hecher, Markus, and Rafael Kiesel. β€œ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, no. 9 (March 24, 2024): 10535–10543. Accessed May 30, 2026. https://ojs.aaai.org/index.php/AAAI/article/view/28923.