6 citations · 17 across the 28 of their papers we have counts for
3 papers · 1 filter
DynASP2.5: Dynamic Programming on Tree Decompositions in Action
Johannes K. Fichte, Markus Hecher, Michael Morak +1
A vibrant theoretical research area are efficient exact parameterized algorithms. Very recent solving competitions such as the PACE challenge show that there is also increasing pra…
Default Logic and Bounded Treewidth
Johannes K. Fichte, Markus Hecher, Irina Schindler
In this paper, we study Reiter's propositional default logic when the treewidth of a certain graph representation (semi-primal graph) of the input theory is bounded. We establish a…
Answer Set Solving with Bounded Treewidth Revisited
Johannes Fichte, Markus Hecher, Michael Morak +1
Parameterized algorithms are a way to solve hard problems more efficiently, given that a specific parameter of the input is small. In this paper, we apply this idea to the field of…