telingo = ASP plus Time

We describe telingo, an extension of the ASP system dingo with temporal operators over finite linear time and provide insights into its implementation. telingo takes temporal logic programs as input whose rules contain only future and present operators in their heads and past and present operators in their bodies. Moreover, telingo extends the grammar of dingo's input language with a variety of temporal operators that can even be used to represent nested temporal formulas. By using dingo's interface for manipulating the abstract syntax tree of nonground programs, temporal logic programs are transformed into regular ones before grounding. The resulting regular logic program is then solved incrementally by using dingo's multi-shot interface. Notably, this involves the consecutive unfolding of future temporal operators that is accomplished via external atoms. Finally, we provide an empirical evaluation contrasting standard incremental ASP programs with their temporal counterparts in telingo's input language.