Hecher, M. “Characterizing Structural Hardness of Logic Programs: What Makes Cycles and Reachability Hard for Treewidth?”. Proceedings of the AAAI Conference on Artificial Intelligence, vol. 37, no. 5, June 2023, pp. 6407-15, doi:10.1609/aaai.v37i5.25788.