Hecher, Markus. “Characterizing Structural Hardness of Logic Programs: What Makes Cycles and Reachability Hard for Treewidth?”. Proceedings of the AAAI Conference on Artificial Intelligence 37, no. 5 (June 26, 2023): 6407-6415. Accessed May 14, 2024. https://ojs.aaai.org/index.php/AAAI/article/view/25788.