16 citations · 69 across the 11 of their papers we have counts for
3 papers · 1 filter
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…
Abstraction for Zooming-In to Unsolvability Reasons of Grid-Cell Problems
Thomas Eiter, Zeynep G. Saribatur, Peter Schüller
Humans are capable of abstracting away irrelevant details when studying problems. This is especially noticeable for problems over grid-cells, as humans are able to disregard certai…
Partial Compilation of ASP Programs
Bernardo Cuteri, Carmine Dodaro, Francesco Ricca +1
Answer Set Programming (ASP) is a well-known declarative formalism in logic programming. Efficient implementations made it possible to apply ASP in many scenarios, ranging from ded…