M. Hecher and R. Kiesel, “On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions?”, AAAI, vol. 38, no. 9, pp. 10535–10543, Mar. 2024.