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

动态回答集编程的计算方法

Computational methods for Dynamic Answer Set Programming

University of Potsdam(波茨坦大学)

Susana Hahn

AI总结:

针对传统动态逻辑在动态问题建模中灵活性与集成性不足的问题,本研究通过集成动态、时态和度量逻辑概念扩展回答集编程(ASP),以增强其对复杂动态问题的建模与推理能力,提升在工业场景的适用性。

摘要:

在日常生活和工业场景中,我们经常遇到需要对时间和度量约束进行推理的动态问题,包括调度、路由和生产排序等任务。传统动态逻辑可解决这些需求,但往往缺乏全面问题建模所需的灵活性和集成性。本研究旨在扩展回答集编程(ASP,一种强大的声明式问题解决方法)以有效处理动态领域,通过将动态、时态和度量逻辑的概念集成到ASP中,开发能建模复杂动态问题并执行高效推理任务的稳健系统,从而增强ASP在工业场景中的适用性。

英文摘要:

In our daily lives and industrial settings, we often encounter dynamic problems that require reasoning over time and metric constraints. These include tasks such as scheduling, routing, and production sequencing. Dynamic logics have traditionally addressed these needs but often lack the flexibility and integration required for comprehensive problem modeling. This research aims to extend Answer Set Programming (ASP), a powerful declarative problem-solving approach, to handle dynamic domains effectively. By integrating concepts from dynamic, temporal, and metric logics into ASP, we seek to develop robust systems capable of modeling complex dynamic problems and performing efficient reasoning tasks, thereby enhancing ASPs applicability in industrial contexts.

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

↑