40 citations · 80 across the 13 of their papers we have counts for
13 papers
Learning to Solve and Optimize by Evolving Code
Veronika Semmelrock, Benedetta Strizzolo, Francesco Zuccato +3
Combinatorial and optimization problems are fundamental to many industrial AI applications. Solving large-scale real-world instances of such problems typically requires careful pro…
Specifying and Exploiting Non-Monotonic Domain-Specific Declarative Heuristics in Answer Set Programming
Richard Comploi-Taupe, Gerhard Friedrich, Konstantin Schekotihin +1
Domain-specific heuristics are an essential technique for solving combinatorial problems efficiently. Current approaches to integrate domain-specific heuristics with Answer Set Pro…
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…
The Partner Units Configuration Problem: Completing the Picture
Erich Christian Teppan, Gerhard Friedrich
The partner units problem (PUP) is an acknowledged hard benchmark problem for the Logic Programming community with various industrial application fields like surveillance, electric…
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…
Direct computation of diagnoses for ontology debugging
Kostyantyn Shchekotykhin, Philipp Fleiss, Patrick Rodler +1
Modern ontology debugging methods allow efficient identification and localization of faulty axioms defined by a user while developing an ontology. The ontology development process…
(Re)configuration based on model generation
Gerhard Friedrich, Anna Ryabokon, Andreas A. Falkner +3
Reconfiguration is an important activity for companies selling configurable products or services which have a long life time. However, identification of a set of required changes i…
Interactive ontology debugging: two query strategies for efficient fault localization
Kostyantyn Shchekotykhin, Gerhard Friedrich, Philipp Fleiss +1
Effective debugging of ontologies is an important prerequisite for their broad application, especially in areas that rely on everyday users to create and maintain knowledge bases,…
Query strategy for sequential ontology debugging
Kostyantyn Shchekotykhin, Gerhard Friedrich, Philipp Fleiss +1
Debugging of ontologies is an important prerequisite for their wide-spread application, especially in areas that rely upon everyday users to create and maintain knowledge bases, as…