1 citations · 1 across the 7 of their papers we have counts for
6 papers · 1 filter
Treewidth-aware Reductions of Normal ASP to SAT -- Is Normal ASP Harder than SAT after All?
Markus Hecher
Answer Set Programming (ASP) is a paradigm for modeling and solving problems for knowledge representation and reasoning. There are plenty of results dedicated to studying the hardn…
Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs
Viktor Besin, Markus Hecher, Stefan Woltran
Extending the popular Answer Set Programming (ASP) paradigm by introspective reasoning capacities has received increasing interest within the last years. Particular attention is gi…
Solving the Steiner Tree Problem with few Terminals
Johannes K. Fichte, Markus Hecher, Andre Schidler
The Steiner tree problem is a well-known problem in network design, routing, and VLSI design. Given a graph, edge costs, and a set of dedicated vertices (terminals), the Steiner tr…
Counting Complexity for Reasoning in Abstract Argumentation
Johannes K. Fichte, Markus Hecher, Arne Meier
In this paper, we consider counting and projected model counting of extensions in abstract argumentation for various semantics. When asking for projected counts we are interested i…
Exploiting Treewidth for Projected Model Counting and its Limits
Johannes K. Fichte, Michael Morak, Markus Hecher +1
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 projected var…
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…