ResearchTrend.AI
Structural Decompositions of Epistemic Logic Programs

Structural Decompositions of Epistemic Logic Programs

Markus Hecher
Michael Morak
S. Woltran
ArXiv (abs)PDFHTML

Papers citing "Structural Decompositions of Epistemic Logic Programs"

6 / 6 papers shown
Title
Solving Projected Model Counting by Utilizing Treewidth and its Limits
Solving Projected Model Counting by Utilizing Treewidth and its Limits
Johannes Fichte
Markus Hecher
Michael Morak
Patrick Thier
S. Woltran
116
8
0
30 May 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
85
25
0
07 Oct 2022
Thirty years of Epistemic Specifications
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
Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs
Viktor Besin
Markus Hecher
S. Woltran
54
4
0
06 Aug 2021
Exploiting Database Management Systems and Treewidth for Counting
Exploiting Database Management Systems and Treewidth for Counting
Johannes Fichte
Markus Hecher
Patrick Thier
S. Woltran
57
24
0
13 Jan 2020
Lower Bounds for QBFs of Bounded Treewidth
Lower Bounds for QBFs of Bounded Treewidth
Johannes Fichte
Markus Hecher
A. Pfandler
61
24
0
02 Oct 2019