# Towards Metric Temporal Answer Set Programming

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

## Key facts

- Cited by 5 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 5 Aug 2020.

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

- [CNL2ASP: converting controlled natural language sentences into ASP](https://mlsanity.com/paper/2311.10505/) (2023)
- [Metric Temporal Equilibrium Logic over Timed Traces](https://mlsanity.com/paper/2304.14778/) (2023)
- [Automata for dynamic answer set solving: Preliminary report](https://mlsanity.com/paper/2109.01782/) (2021)
- [Metric Dynamic Equilibrium Logic](https://mlsanity.com/paper/2401.10781/) (2024)
- [Compiling Metric Temporal Answer Set Programming](https://mlsanity.com/paper/2506.08150/) (2025)

## Abstract (arXiv)

We elaborate upon the theoretical foundations of a metric temporal extension of Answer Set Programming. In analogy to previous extensions of ASP with constructs from Linear Temporal and Dynamic Logic, we accomplish this in the setting of the logic of Here-and-There and its non-monotonic extension, called Equilibrium Logic. More precisely, we develop our logic on the same semantic underpinnings as its predecessors and thus use a simple time domain of bounded time steps. This allows us to compare all variants in a uniform framework and ultimately combine them in a common implementation.