# Sketched Answer Set Programming

**Authors:** Sergey Paramonov, Christian Bessiere, Anton Dries, Luc De Raedt

arXiv: 1705.07429 · 2018-08-23

## TL;DR

Sketched Answer Set Programming (SkASP) is a new method that helps users create ASP models by allowing uncertain parts to be marked and using examples to guide the rewriting process, simplifying ASP modeling.

## Contribution

Introduces SkASP, a novel approach that enables easier ASP model development through sketching and example-guided rewriting, enhancing usability and reusability.

## Key findings

- Successfully applied to 21 puzzles and combinatorial problems.
- Demonstrated effectiveness in a database application case.
- Facilitated easier ASP model creation with uncertain parts.

## 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.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1705.07429/full.md

## Figures

16 figures with captions in the complete paper: https://tomesphere.com/paper/1705.07429/full.md

## References

35 references — full list in the complete paper: https://tomesphere.com/paper/1705.07429/full.md

---
Source: https://tomesphere.com/paper/1705.07429