Hecher, M., & Kiesel, R. (2024). Extended Version of: On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions?
Chicago Style (17th ed.) CitationHecher, Markus, and Rafael Kiesel. Extended Version of: On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions? 2024.
MLA (9th ed.) CitationHecher, Markus, and Rafael Kiesel. Extended Version of: On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions? 2024.
Warning: These citations may not always be 100% accurate.