Sketched Answer Set Programming
This addresses the problem of model creation complexity for users of ASP, though it appears incremental as it builds on existing ASP methods.
The authors tackled the difficulty of writing Answer Set Programming (ASP) models by introducing Sketched Answer Set Programming (SkASP), which allows users to mark uncertain parts and provide examples, resulting in functional and reusable ASP programs.
Answer Set Programming (ASP) is a powerful modeling formalism for combinatorial problems. However, writing ASP models is not trivial. We propose a novel method, called Sketched Answer Set Programming (SkASP), aiming at supporting the user in resolving this issue. The user writes an ASP program while marking uncertain parts open with question marks. In addition, the user provides a number of positive and negative examples of the desired program behaviour. The sketched model is rewritten into another ASP program, which is solved by traditional methods. As a result, the user obtains a functional and reusable ASP program modelling her problem. We evaluate our approach on 21 well known puzzles and combinatorial problems inspired by Karp's 21 NP-complete problems and demonstrate a use-case for a database application based on ASP.