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. 2210.03553
  4. Cited By
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?

7 October 2022
Markus Hecher
ArXiv (abs)PDFHTML

Papers citing "Treewidth-aware Reductions of Normal ASP to SAT -- Is Normal ASP Harder than SAT after All?"

7 / 7 papers shown
Title
Solving Decision Theory Problems with Probabilistic Answer Set
  Programming
Solving Decision Theory Problems with Probabilistic Answer Set Programming
Damiano Azzolini
Elena Bellodi
Rafael Kiesel
Fabrizio Riguzzi
44
0
0
21 Aug 2024
Rejection in Abstract Argumentation: Harder Than Acceptance?
Rejection in Abstract Argumentation: Harder Than Acceptance?
Johannes Fichte
Markus Hecher
Yasir Mahmood
Arne Meier
39
0
0
20 Aug 2024
Extended Version of: On the Structural Hardness of Answer Set
  Programming: Can Structure Efficiently Confine the Power of Disjunctions?
Extended Version of: On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions?
Markus Hecher
Rafael Kiesel
30
0
0
05 Feb 2024
IASCAR: Incremental Answer Set Counting by Anytime Refinement
IASCAR: Incremental Answer Set Counting by Anytime Refinement
Johannes Fichte
S. A. Gaggl
Markus Hecher
Dominik Rusovac
45
1
0
13 Nov 2023
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
24
2
0
18 Jan 2023
Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic
  Programs
Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs
Viktor Besin
Markus Hecher
S. Woltran
41
4
0
06 Aug 2021
Treewidth-Aware Complexity in ASP: Not all Positive Cycles are Equally
  Hard
Treewidth-Aware Complexity in ASP: Not all Positive Cycles are Equally Hard
Markus Hecher
Jorge Fandinno
56
10
0
09 Jul 2020
1