Sketched Answer Set Programming - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2018

Sketched Answer Set Programming

Abstract

Answer Set Programming (ASP) is a powerful mod-eling formalism for combinatorial problems. However, writing ASP models can be hard. We propose a novel method, called Sketched Answer Set Programming (SkASP), aimed at facilitating this. In SkASP, the user writes partial ASP programs, in which uncertain parts are left open and marked with question marks. In addition, the user provides a number of positive and negative examples of the desired program behaviour. SkASP then synthesises a complete ASP program. This is realized by rewriting the SkASP program into another ASP program, which can then be solved by traditional ASP solvers. We evaluate our approach on 21 well known puzzles and combinatorial problems inspired by Karps 21 NP-complete problems and on publicly available ASP encodings.
Fichier principal
Vignette du fichier
ictai18.pdf (1.38 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

lirmm-02310677 , version 1 (10-10-2019)

Identifiers

Cite

Sergey Paramonov, Christian Bessiere, Anton Dries, Luc de Raedt. Sketched Answer Set Programming. ICTAI: International Conference on Tools with Artificial Intelligence, Nov 2018, Volos, Greece. pp.694-701, ⟨10.1109/ICTAI.2018.00110⟩. ⟨lirmm-02310677⟩
126 View
232 Download

Altmetric

Share

Gmail Facebook X LinkedIn More