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

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

18 January 2023

ArXiv (abs)PDF HTML

Papers citing "Characterizing Structural Hardness of Logic Programs: What makes Cycles and Reachability Hard for Treewidth?"

Title
No papers