1 citations · 1 across the 7 of their papers we have counts for
5 papers · 1 filter
Treewidth-Aware Complexity in ASP: Not all Positive Cycles are Equally Hard
Markus Hecher, Jorge Fandinno
It is well-know that deciding consistency for normal answer set programs (ASP) is NP-complete, thus, as hard as the satisfaction problem for classical propositional logic (SAT). Th…
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.…
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…
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…