Fandinno, Jorge, and Markus Hecher. “Treewidth-Aware Complexity in ASP: Not All Positive Cycles Are Equally Hard”. Proceedings of the AAAI Conference on Artificial Intelligence 35, no. 7 (May 18, 2021): 6312-6320. Accessed May 5, 2024. https://ojs.aaai.org/index.php/AAAI/article/view/16784.