Winning Snake: Design Choices in Multi-Shot ASP
Open Access
- 1 July 2024
- journal article
- research article
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 24 (4) , 772-789
Abstract
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 compiles and 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 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.Keywords
All Related Versions
This publication has 21 references indexed in Scilit:
- Hamiltonian Cycle Reconfiguration with Answer Set Programming2023
- Solving Vehicle Equipment Specification Problems with Answer Set Programming2023
- Clingraph: ASP-Based Visualization2022
- The complexity of snake and undirected NCL variantsTheoretical Computer Science, 2018
- Multi-shot ASP solving with clingoTheory and Practice of Logic Programming, 2018
- The ASP System DLV: Advancements and ApplicationsKI - Künstliche Intelligenz, 2018
- Blending Lazy-Grounding and CDNL Search for Answer-Set Solving2017
- Improved answer-set programming encodings for abstract argumentationTheory and Practice of Logic Programming, 2015
- WASP: A Native ASP Solver Based on Constraint LearningLecture Notes in Computer Science, 2013
- Answer Set Programming for Single-Player Games in General Game PlayingLecture Notes in Computer Science, 2009