Implementing Dynamic Answer Set Programming
This work provides a computational framework for dynamic applications in logic programming, but it is incremental as it builds on existing ASP and temporal logic foundations.
The authors tackled the problem of modeling dynamic applications by extending Answer Set Programming (ASP) with dynamic and temporal logic constructs, resulting in a translation to temporal logic programs with polynomial space complexity and a uniform implementation via temporal ASP solvers.
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