Treewidth-Aware Complexity in ASP: Not all Positive Cycles are Equally Hard

9 July 2020

Papers citing "Treewidth-Aware Complexity in ASP: Not all Positive Cycles are Equally Hard"

4 / 4 papers shown

Title
Rejection in Abstract Argumentation: Harder Than Acceptance? Johannes Fichte Markus Hecher Yasir Mahmood Arne Meier 39 0 0 20 Aug 2024
Characterizing Structural Hardness of Logic Programs: What makes Cycles and Reachability Hard for Treewidth? Markus Hecher 19 2 0 18 Jan 2023
Treewidth-aware Reductions of Normal ASP to SAT -- Is Normal ASP Harder than SAT after All? Markus Hecher 60 25 0 07 Oct 2022
Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs Viktor Besin Markus Hecher S. Woltran 33 4 0 06 Aug 2021