6 citations · 17 across the 28 of their papers we have counts for
4 papers · 1 filter
IASCAR: Incremental Answer Set Counting by Anytime Refinement
Johannes K. Fichte, Sarah Alice Gaggl, Markus Hecher +1
Answer set programming (ASP) is a popular declarative programming paradigm with various applications. Programs can easily have many answer sets that cannot be enumerated in practic…
Solving Projected Model Counting by Utilizing Treewidth and its Limits
Johannes K. Fichte, Markus Hecher, Michael Morak +2
In this paper, we introduce a novel algorithm to solve projected model counting (PMC). PMC asks to count solutions of a Boolean formula with respect to a given set of projection va…
Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF
Johannes K. Fichte, Robert Ganian, Markus Hecher +2
The QSAT problem, which asks to evaluate a quantified Boolean formula (QBF), is of fundamental interest in approximation, counting, decision, and probabilistic complexity and is al…
Characterizing Structural Hardness of Logic Programs: What makes Cycles and Reachability Hard for Treewidth?
Markus Hecher
Answer Set Programming (ASP) is a problem modeling and solving framework for several problems in KR with growing industrial applications. Also for studies of computational complexi…