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

Markus Hecher, Rafael Kiesel. On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions?. In Michael J. Wooldridge, Jennifer G. Dy, Sriraam Natarajan, editors, Thirty-Eigth AAAI Conference on Artificial Intelligence, AAAI 2024, Thirty-Sixth Conference on Innovative Applications of Artificial Intelligence, IAAI 2024, Fourteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2014, February 20-27, 2024, Vancouver, Canada. pages 10535-10543, AAAI Press, 2024. [doi]

Abstract

Abstract is missing.