arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2408.08150cs.AI
收藏

制胜贪吃蛇:多轮ASP中的设计选择

Winning Snake: Design Choices in Multi-Shot ASP

TU Dresden(德累斯顿工业大学);cfaed(德累斯顿电子中心)

Elisa Böhl, Stefan Ellmauthaler, Sarah Alice Gaggl

AI总结:

本文通过解决贪吃蛇游戏,展示了多轮答案集编程中重用逻辑程序部分的不同技术,并比较了五种clingo实现的性能,利用clingraph生成图像表示。

摘要:

答案集编程是一种被充分理解且成熟的问题求解与知识表示范式。由于其在科学和工业中的多种应用,它已在更广泛的受众中变得更加突出。先进编程和建模技术的持续发展定期扩展了开发者和用户的工具集。本文通过解决街机游戏贪吃蛇,展示了重用逻辑程序部分(多轮)的不同技术。该游戏特别有趣,因为可以通过解决其底层的哈密顿回路NP难问题来确保胜利。我们将展示在clingo中的五种动手实现,并通过实证评估比较它们的性能。此外,我们的实现利用clingraph生成游戏进度的简单而信息丰富的图像表示。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑