ResearchTrend.AI
Lower Bounds for QBFs of Bounded Treewidth
v1v2 (latest)

Lower Bounds for QBFs of Bounded Treewidth

Johannes Fichte
Markus Hecher
A. Pfandler
ArXiv (abs)PDFHTML

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?
Characterizing Structural Hardness of Logic Programs: What makes Cycles and Reachability Hard for Treewidth?
Markus Hecher
33
2
0
18 Jan 2023
Treewidth-aware Reductions of Normal ASP to SAT -- Is Normal ASP Harder than SAT after All?
Treewidth-aware Reductions of Normal ASP to SAT -- Is Normal ASP Harder than SAT after All?
Markus Hecher
77
25
0
07 Oct 2022
Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs
Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs
Viktor Besin
Markus Hecher
S. Woltran
48
4
0
06 Aug 2021
Counting Complexity for Reasoning in Abstract Argumentation
Counting Complexity for Reasoning in Abstract Argumentation
Johannes Fichte
Markus Hecher
Arne Meier
41
27
0
28 Nov 2018