M. Hecher, “Characterizing Structural Hardness of Logic Programs: What Makes Cycles and Reachability Hard for Treewidth?”, AAAI, vol. 37, no. 5, pp. 6407-6415, Jun. 2023.