Characterizing Structural Hardness of Logic Programs: What Makes Cycles and Reachability Hard for Treewidth?

Markus Hecher

Browse the full AAAI paper archive.