Markus Hecher

Treewidth-Aware Complexity in ASP: Not all Positive Cycles are Equally Hard

2020 · arXiv (Cornell University)

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). The best algorithms to solve these problems take exponential …

Quantitative Reasoning and Structural Complexity for Claim-Centric Argumentation

2023

Argumentation is a well-established formalism for nonmonotonic reasoning and a vibrant area of research in AI. Claim-augmented argumentation frameworks (CAFs) have been introduced to deploy a conclusion-oriented perspective. CAFs expand argumentation frameworks by an additional …

FastFound: Easing the ASP Bottleneck via Predicate-Decoupled Grounding

2025

The grounding bottleneck in Answer Set Programming prohibits large instances from being solved. This is caused by a combinatorial explosion in the grounding phase of standard ground&solve systems. A promising alternative is Body-Decoupled Grounding (BDG), …