论文标题
实施动态答案集编程
Implementing Dynamic Answer Set Programming
论文作者
论文摘要
我们介绍了通过动态（和时间）逻辑的语言构造的答案集编程（ASP）扩展的实现，该逻辑提供了用于建模动态应用程序的表现力计算框架。从有限线性痕迹的动态和时间平衡逻辑提供的逻辑基础开始，我们将动态公式的翻译转换为时间逻辑程序。这为我们提供了正常形式的结果，确立了在不同逻辑中公式的较强等效性。我们的翻译依赖于引入辅助原子来保证多项式空间的复杂性，并提供注定要在同一语言上是不可能的嵌入。最后，将动态公式减少到时间逻辑程序使我们能够以统一的方式扩展ASP，并通过暂时的ASP求解器（例如teleingo）实施这两种扩展
We introduce an implementation of an extension of Answer Set Programming (ASP) with language constructs from dynamic (and temporal) logic that provides an expressive computational framework for modeling dynamic applications. Starting from logical foundations, provided by dynamic and temporal equilibrium logics over finite linear traces, we develop a translation of dynamic formulas into temporal logic programs. This provides us with a normal form result establishing the strong equivalence of formulas in different logics. Our translation relies on the introduction of auxiliary atoms to guarantee polynomial space complexity and to provide an embedding that is doomed to be impossible over the same language. Finally, the reduction of dynamic formulas to temporal logic programs allows us to extend ASP with both approaches in a uniform way and to implement both extensions via temporal ASP solvers such as telingo
