Fandinno, J., & Hecher, M. (2021). Treewidth-Aware Complexity in ASP: Not all Positive Cycles are Equally Hard. Proceedings of the AAAI Conference on Artificial Intelligence, 35(7), 6312-6320. Retrieved from https://ojs.aaai.org/index.php/AAAI/article/view/16784