6 citations · 17 across the 28 of their papers we have counts for
4 papers · 1 filter
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…
Inconsistency Proofs for ASP: The ASP-DRUPE Format
Mario Alviano, Carmine Dodaro, Johannes K. Fichte +3
Answer Set Programming (ASP) solvers are highly-tuned and complex procedures that implicitly solve the consistency problem, i.e., deciding whether a logic program admits an answer…
Answer Set Solving exploiting Treewidth and its Limits
Markus Hecher
Parameterized algorithms have been subject to extensive research of recent years and allow to solve hard problems by exploiting a parameter of the corresponding problem instances.…
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…