v1v2 (latest)

Lower Bounds for QBFs of Bounded Treewidth

2 October 2019

Papers citing "Lower Bounds for QBFs of Bounded Treewidth"

4 / 4 papers shown

Title
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 62 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
Counting Complexity for Reasoning in Abstract Argumentation Johannes Fichte Markus Hecher Arne Meier 29 27 0 28 Nov 2018