Skip to content

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

Markus Hecher, Rafael Kiesel

VenueA*AAAI
Year2024
ProceedingsAAAI

Browse the full AAAI paper archive.