Hecher, M. (2023). Characterizing Structural Hardness of Logic Programs: What Makes Cycles and Reachability Hard for Treewidth?. Proceedings of the AAAI Conference on Artificial Intelligence, 37(5), 6407-6415. https://doi.org/10.1609/aaai.v37i5.25788