40 citations · 80 across the 13 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.AI2019★ 2 cited
Exploiting Partial Knowledge in Declarative Domain-Specific Heuristics for ASP
Richard Taupe, Konstantin Schekotihin, Peter Schüller +2
Domain-specific heuristics are an important technique for solving combinatorial problems efficiently. We propose a novel semantics for declarative specifications of domain-specific…
cs.AI2019★ 3 cited
Degrees of Laziness in Grounding: Effects of Lazy-Grounding Strategies on ASP Solving
Richard Taupe, Antonius Weinzierl, Gerhard Friedrich
The traditional ground-and-solve approach to Answer Set Programming (ASP) suffers from the grounding bottleneck, which makes large-scale problem instances unsolvable. Lazy groundin…