1 citations · 1 across the 7 of their papers we have counts for
3 papers · 1 filter
Structural Decompositions of Epistemic Logic Programs
Markus Hecher, Michael Morak, Stefan Woltran
Epistemic logic programs (ELPs) are a popular generalization of standard Answer Set Programming (ASP) providing means for reasoning over answer sets within the language. This riche…
Lower Bounds for QBFs of Bounded Treewidth
Johannes Klaus Fichte, Markus Hecher, Andreas Pfandler
The problem of deciding the validity (QSAT) of quantified Boolean formulas (QBF) is a vivid research area in both theory and practice. In the field of parameterized algorithmics, t…
Treewidth and Counting Projected Answer Sets
Johannes K. Fichte, Markus Hecher
In this paper, we introduce novel algorithms to solve projected answer set counting (#PAs). #PAs asks to count the number of answer sets with respect to a given set of projected at…