{"id":"2301.07472","title":"Characterizing Structural Hardness of Logic Programs: What makes Cycles and Reachability Hard for Treewidth?","url":"https://codeofpaper.com/paper/2301.07472","arxiv_url":"https://arxiv.org/abs/2301.07472","published":"2023-01-18","code":"none","best":null,"most_starred_community":null,"implementations":[],"possible_matches":0}