# Past-present temporal programs over finite traces

arXiv: https://arxiv.org/abs/2307.12620 · HTML: https://mlsanity.com/paper/2307.12620/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 5 of its 40 references that are in the map.
- First posted on arXiv 24 Jul 2023.

## Builds on (most cited first, 5 of 5)

- [Graph Neural Networks Meet Neural-Symbolic Computing: A Survey and Perspective](https://mlsanity.com/paper/2003.00330/) (2020)
- [Clingo = ASP + Control: Preliminary Report](https://mlsanity.com/paper/1405.3694/) (2014)
- [Temporal Answer Set Programming on Finite Traces](https://mlsanity.com/paper/1804.10227/) (2018)
- [On the complexity of Temporal Equilibrium Logic](https://mlsanity.com/paper/1503.00043/) (2015)
- [On Loop Formulas with Variables](https://mlsanity.com/paper/2307.10226/) (2023)

## Abstract (arXiv)

Extensions of Answer Set Programming with language constructs from temporal logics, such as temporal equilibrium logic over finite traces (TELf), provide an expressive computational framework for modeling dynamic applications. In this paper, we study the so-called past-present syntactic subclass, which consists of a set of logic programming rules whose body references to the past and head to the present. Such restriction ensures that the past remains independent of the future, which is the case in most dynamic domains. We extend the definitions of completion and loop formulas to the case of past-present formulas, which allows capturing the temporal stable models of a set of past-present temporal programs by means of an LTLf expression.