3 citations · 9 across the 6 of their papers we have counts for
7 papers
Advancing Lazy-Grounding ASP Solving Techniques -- Restarts, Phase Saving, Heuristics, and More
Antonius Weinzierl, Richard Taupe, Gerhard Friedrich
Answer-Set Programming (ASP) is a powerful and expressive knowledge representation paradigm with a significant number of applications in logic-based AI. The traditional ground-and-…
Conflict Generalisation in ASP: Learning Correct and Effective Non-Ground Constraints
Richard Taupe, Antonius Weinzierl, Gerhard Friedrich
Generalising and re-using knowledge learned while solving one problem instance has been neglected by state-of-the-art answer set solvers. We suggest a new approach that generalises…
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…
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…
RIO: Minimizing User Interaction in Debugging of Knowledge Bases
Patrick Rodler, Kostyantyn Shchekotykhin, Philipp Fleiss +1
The best currently known interactive debugging systems rely upon some meta-information in terms of fault probabilities in order to improve their efficiency. However, misleading met…
RIO: Minimizing User Interaction in Ontology Debugging
Patrick Rodler, Kostyantyn Shchekotykhin, Philipp Fleiss +1
Efficient ontology debugging is a cornerstone for many activities in the context of the Semantic Web, especially when automatic tools produce (parts of) ontologies such as in the f…