[1]
Fandinno, J. and 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 (May 2021), 6312-6320. DOI:https://doi.org/10.1609/aaai.v35i7.16784.