ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1805.05445
  4. Cited By
Exploiting Treewidth for Projected Model Counting and its Limits

Exploiting Treewidth for Projected Model Counting and its Limits

14 May 2018
Johannes Fichte
Michael Morak
Markus Hecher
S. Woltran
ArXiv (abs)PDFHTML

Papers citing "Exploiting Treewidth for Projected Model Counting and its Limits"

3 / 3 papers shown
Title
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
62
25
0
07 Oct 2022
Lower Bounds for QBFs of Bounded Treewidth
Lower Bounds for QBFs of Bounded Treewidth
Johannes Fichte
Markus Hecher
A. Pfandler
41
24
0
02 Oct 2019
Counting Complexity for Reasoning in Abstract Argumentation
Counting Complexity for Reasoning in Abstract Argumentation
Johannes Fichte
Markus Hecher
Arne Meier
29
27
0
28 Nov 2018
1