Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
2001.04219
Cited By
Structural Decompositions of Epistemic Logic Programs
13 January 2020
Markus Hecher
Michael Morak
S. Woltran
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"Structural Decompositions of Epistemic Logic Programs"
6 / 6 papers shown
Title
Solving Projected Model Counting by Utilizing Treewidth and its Limits
Johannes Fichte
Markus Hecher
Michael Morak
Patrick Thier
S. Woltran
104
8
0
30 May 2023
Treewidth-aware Reductions of Normal ASP to SAT -- Is Normal ASP Harder than SAT after All?
Markus Hecher
62
25
0
07 Oct 2022
Thirty years of Epistemic Specifications
Jorge Fandinno
Wolfgang Faber
Michael Gelfond
KELM
43
11
0
17 Aug 2021
Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs
Viktor Besin
Markus Hecher
S. Woltran
38
4
0
06 Aug 2021
Exploiting Database Management Systems and Treewidth for Counting
Johannes Fichte
Markus Hecher
Patrick Thier
S. Woltran
35
24
0
13 Jan 2020
Lower Bounds for QBFs of Bounded Treewidth
Johannes Fichte
Markus Hecher
A. Pfandler
44
24
0
02 Oct 2019
1