7 citations · 20 across the 8 of their papers we have counts for
8 papers
Smart Expansion Techniques for ASP-based Interactive Configuration
Lucia Balážová, Richard Comploi-Taupe, Susana Hahn +2
Product configuration is a successful application of Answer Set Programming (ASP). However, challenges are still open for interactive systems to effectively guide users through the…
Inductive Learning of Declarative Domain-Specific Heuristics for ASP
Richard Comploi-Taupe
Domain-specific heuristics are a crucial technique for the efficient solving of problems that are large or computationally hard. Answer Set Programming (ASP) systems support declar…
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…
Applying Incremental Answer Set Solving to Product Configuration
Richard Comploi-Taupe, Giulia Francescutto, Gottfried Schenner
In this paper, we apply incremental answer set solving to product configuration. Incremental answer set solving is a step-wise incremental approach to Answer Set Programming (ASP).…
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…