Rafael Kiesel

1
Papers
0
Total Citations

Papers (1)

On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions?

AAAI 2024arXiv
0
citations