Abstract
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.
Abstract (translated)
答案集编程（ASP）是一种强大的组合问题建模形式。但是，编写ASP模型并非易事。我们提出了一种新方法，称为草绘答案集编程（SkASP），旨在支持用户解决此问题。用户编写ASP程序，同时用问号打开不确定部分。此外，用户提供了所需程序行为的许多正面和负面示例。草绘的模型被重写为另一个ASP程序，这是通过传统方法解决的。结果，用户获得了一个功能和可重用的ASP程序来模拟她的问题。我们评估了我们针对21个众所周知的难题和组合问题的方法，这些问题受到Karp的21个NP完全问题的启发，并展示了基于ASP的数据库应用程序的用例。
URL
https://arxiv.org/abs/1705.07429
