Hecher M. Characterizing Structural Hardness of Logic Programs: What Makes Cycles and Reachability Hard for Treewidth?. AAAI [Internet]. 2023Jun.26 [cited 2024May13];37(5):6407-15. Available from: https://ojs.aaai.org/index.php/AAAI/article/view/25788