Lower Bounds for QBFs of Bounded Treewidth-Reference-Cited by-同舟云学术

Lower Bounds for QBFs of Bounded Treewidth

Published:2020-07-08 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science
language:
Short-container-title:

Author:

Fichte Johannes K.¹,Hecher Markus²,Pfandler Andreas²

Affiliation:

1. TU Dresden, Germany

2. TU Wien, Austria

Funder

Austrian Science Fund

Deutsche Forschungsgemeinschaft

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3373718.3394756

Reference57 articles.

1. Bounded-width QBF is PSPACE-complete

2. Rehan A. Aziz. 2015. Answer Set Programming: Founded Bounds and Model Counting. Ph.D. Dissertation. Department of Computing and Information Systems The University of Melbourne. Rehan A. Aziz. 2015. Answer Set Programming: Founded Bounds and Model Counting. Ph.D. Dissertation. Department of Computing and Information Systems The University of Melbourne.

3. Dynamic programming on graphs with bounded treewidth

4. A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26

2. Solving Projected Model Counting by Utilizing Treewidth and its Limits;Artificial Intelligence;2023-01

3. Reasoning in Assumption-Based Argumentation Using Tree-Decompositions;Logics in Artificial Intelligence;2023

4. Proceedings 38th International Conference on Logic Programming;Electronic Proceedings in Theoretical Computer Science;2022-08-04

5. Treewidth-aware reductions of normal ASP to SAT – Is normal ASP harder than SAT after all?;Artificial Intelligence;2022-03