Techreport3052: Unterschied zwischen den Versionen
Aus International Center for Computational Logic
Sarah Gaggl (Diskussion | Beiträge) (Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Elisa |ErsterAutorNachname=Böhl |FurtherAuthors=Stefan Ellmauthaler; Sarah Alice Gaggl }} {{Techreport |Title=Winning Snake: Design Choices in Multi-Shot ASP |Year=2024 |Month=August |Institution=arXiv.org |Type=to appear in Theory and Practice of Logic Programming (TPLP), Proceedings of ICLP 2024 |Archivierungsnummer=arXiv:2408.08150 }} {{Publikation Details |Abstract=Answer set programming is a well-unders…“) |
Sarah Gaggl (Diskussion | Beiträge) Keine Bearbeitungszusammenfassung |
||
| Zeile 15: | Zeile 15: | ||
|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 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. | |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 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. | ||
|DOI Name=https://doi.org/10.48550/arXiv.2408.08150 | |DOI Name=https://doi.org/10.48550/arXiv.2408.08150 | ||
|Projekt= | |Projekt=Cfaed, InnoSale, NAVAS, ScaDS.AI | ||
|Forschungsgruppe=Logische Programmierung und Argumentation, Wissensbasierte Systeme | |Forschungsgruppe=Logische Programmierung und Argumentation, Wissensbasierte Systeme | ||
}} | }} | ||
Aktuelle Version vom 19. Dezember 2024, 15:59 Uhr
Winning Snake: Design Choices in Multi-Shot ASP
Elisa BöhlElisa Böhl, Stefan EllmauthalerStefan Ellmauthaler, Sarah Alice GagglSarah Alice Gaggl
Elisa Böhl, Stefan Ellmauthaler, Sarah Alice Gaggl
Winning Snake: Design Choices in Multi-Shot ASP
Technical Report, arXiv.org, volume arXiv:2408.08150, August 2024. to appear in Theory and Practice of Logic Programming (TPLP), Proceedings of ICLP 2024
Winning Snake: Design Choices in Multi-Shot ASP
Technical Report, arXiv.org, volume arXiv:2408.08150, August 2024. to appear in Theory and Practice of Logic Programming (TPLP), Proceedings of ICLP 2024
- KurzfassungAbstract
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. - Projekt:Project: Cfaed, InnoSale, NAVAS, ScaDS.AI
- Forschungsgruppe:Research Group: Logische Programmierung und ArgumentationLogic Programming and Argumentation, Wissensbasierte SystemeKnowledge-Based Systems
@techreport{BEG2024,
author = {Elisa B{\"{o}}hl and Stefan Ellmauthaler and Sarah Alice Gaggl},
title = {Winning Snake: Design Choices in Multi-Shot {ASP}},
institution = {arXiv.org},
year = {2024},
month = {August},
doi = {https://doi.org/10.48550/arXiv.2408.08150}
}
