Hecher, M., & Kiesel, R. (2024). Extended Version of: On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions?
Citazione stile Chigago Style (17a edizione)Hecher, Markus, e Rafael Kiesel. Extended Version of: On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions? 2024.
Citatione MLA (9a ed.)Hecher, Markus, e Rafael Kiesel. Extended Version of: On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions? 2024.
Attenzione: Queste citazioni potrebbero non essere precise al 100%.