%0 Journal Article %1 journals/corr/abs-2402-03539 %A Hecher, Markus %A Kiesel, Rafael %D 2024 %J CoRR %K dblp %T Extended Version of: On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions? %U http://dblp.uni-trier.de/db/journals/corr/corr2402.html#abs-2402-03539 %V abs/2402.03539

@article{journals/corr/abs-2402-03539, added-at = {2024-02-12T00:00:00.000+0100}, author = {Hecher, Markus and Kiesel, Rafael}, biburl = {https://www.bibsonomy.org/bibtex/28ad684357ac0fa33463c4fbe88be5d42/dblp}, ee = {https://doi.org/10.48550/arXiv.2402.03539}, interhash = {aa8d4991d2ffa2f5e20a0f3674c9d3d7}, intrahash = {8ad684357ac0fa33463c4fbe88be5d42}, journal = {CoRR}, keywords = {dblp}, timestamp = {2024-04-08T22:37:28.000+0200}, title = {Extended Version of: On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions?}, url = {http://dblp.uni-trier.de/db/journals/corr/corr2402.html#abs-2402-03539}, volume = {abs/2402.03539}, year = 2024 }