# Temporal Answer Set Programming on Finite Traces

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

## Key facts

- Cited by 10 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 26 Apr 2018.

## Built on by (most cited first, 10 of 10)

- [Planning with Incomplete Information in Quantified Answer Set Programming](https://mlsanity.com/paper/2108.06405/) (2021)
- [Metric Temporal Equilibrium Logic over Timed Traces](https://mlsanity.com/paper/2304.14778/) (2023)
- [On the use of neurosymbolic AI for defending against cyber attacks](https://mlsanity.com/paper/2408.04996/) (2024)
- [Automata for dynamic answer set solving: Preliminary report](https://mlsanity.com/paper/2109.01782/) (2021)
- [Traffic Scenario Logic: A Spatial-Temporal Logic for Modeling and Reasoning of Urban Traffic Scenarios](https://mlsanity.com/paper/2405.13715/) (2024)
- [Automata Techniques for Temporal Answer Set Programming](https://mlsanity.com/paper/2109.08279/) (2021)
- [Quantitative and Stream Extensions of Answer Set Programming](https://mlsanity.com/paper/2109.08281/) (2021)
- [Reactive Answer Set Programming](https://mlsanity.com/paper/2109.10633/) (2021)
- [Past-present temporal programs over finite traces](https://mlsanity.com/paper/2307.12620/) (2023)
- [Metric Dynamic Equilibrium Logic](https://mlsanity.com/paper/2401.10781/) (2024)

## Abstract (arXiv)

In this paper, we introduce an alternative approach to Temporal Answer Set Programming that relies on a variation of Temporal Equilibrium Logic (TEL) for finite traces. This approach allows us to even out the expressiveness of TEL over infinite traces with the computational capacity of (incremental) Answer Set Programming (ASP). Also, we argue that finite traces are more natural when reasoning about action and change. As a result, our approach is readily implementable via multi-shot ASP systems and benefits from an extension of ASP's full-fledged input language with temporal operators. This includes future as well as past operators whose combination offers a rich temporal modeling language. For computation, we identify the class of temporal logic programs and prove that it constitutes a normal form for our approach. Finally, we outline two implementations, a generic one and an extension of clingo.