HECHER, Markus; KIESEL, Rafael. On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions?. Proceedings of the AAAI Conference on Artificial Intelligence, [S. l.], v. 38, n. 9, p. 10535–10543, 2024. DOI: 10.1609/aaai.v38i9.28923. Disponível em: https://ojs.aaai.org/index.php/AAAI/article/view/28923. Acesso em: 30 may. 2026.