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. 2108.03022
  4. Cited By
Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic
  Programs

Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs

6 August 2021
Viktor Besin
Markus Hecher
S. Woltran
ArXiv (abs)PDFHTML

Papers citing "Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs"

2 / 2 papers shown
Title
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
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
1