16 citations · 34 across the 3 of their papers we have counts for
4 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…
Constraints, Lazy Constraints, or Propagators in ASP Solving: An Empirical Analysis
Bernardo Cuteri, Carmine Dodaro, Francesco Ricca +1
Answer Set Programming (ASP) is a well-established declarative paradigm. One of the successes of ASP is the availability of efficient systems. State-of-the-art systems are based on…
Improving Scalability of Inductive Logic Programming via Pruning and Best-Effort Optimisation
Mishal Kazmi, Peter Schüller, Yücel Saygın
Inductive Logic Programming (ILP) combines rule-based and statistical artificial intelligence methods, by learning a hypothesis comprising a set of rules given background knowledge…