Winning Snake: Design Choices in Multi-Shot ASP

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Böhl, Elisa, Ellmauthaler, Stefan, Gaggl, Sarah Alice
Format: Preprint
Veröffentlicht: 2024
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866929682748801024
author Böhl, Elisa
Ellmauthaler, Stefan
Gaggl, Sarah Alice
author_facet Böhl, Elisa
Ellmauthaler, Stefan
Gaggl, Sarah Alice
contents Answer set programming is a well-understood and established problem-solving and knowledge representation paradigm. It has become more prominent amongst a wider audience due to its multiple applications in science and industry. The constant development of advanced programming and modeling techniques extends the toolset for developers and users regularly. This paper demonstrates different techniques to reuse logic program parts (multi-shot) by solving the arcade game snake. This game is particularly interesting because a victory can be assured by solving the underlying NP-hard problem of Hamiltonian Cycles. We will demonstrate five hands-on implementations in clingo and compare their performance in an empirical evaluation. In addition, our implementation utilizes clingraph to generate a simple yet informative image representation of the game's progress.
format Preprint
id arxiv_https___arxiv_org_abs_2408_08150
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Winning Snake: Design Choices in Multi-Shot ASP
Böhl, Elisa
Ellmauthaler, Stefan
Gaggl, Sarah Alice
Artificial Intelligence
Answer set programming is a well-understood and established problem-solving and knowledge representation paradigm. It has become more prominent amongst a wider audience due to its multiple applications in science and industry. The constant development of advanced programming and modeling techniques extends the toolset for developers and users regularly. This paper demonstrates different techniques to reuse logic program parts (multi-shot) by solving the arcade game snake. This game is particularly interesting because a victory can be assured by solving the underlying NP-hard problem of Hamiltonian Cycles. We will demonstrate five hands-on implementations in clingo and compare their performance in an empirical evaluation. In addition, our implementation utilizes clingraph to generate a simple yet informative image representation of the game's progress.
title Winning Snake: Design Choices in Multi-Shot ASP
topic Artificial Intelligence
url https://arxiv.org/abs/2408.08150