Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [37 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-02310677
Contributor : Isabelle Gouat <>
Submitted on : Thursday, October 10, 2019 - 1:27:32 PM
Last modification on : Thursday, May 14, 2020 - 6:58:06 PM

File

ictai18.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Sergey Paramonov, Christian Bessière, 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⟩

Share

Metrics

Record views

102

Files downloads

188