# Implementing Metric Temporal Answer Set Programming

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

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- First posted on arXiv 28 Jan 2026.

## Abstract (arXiv)

We develop a computational approach to Metric Answer Set Programming (ASP) to allow for expressing quantitative temporal constraints, like durations and deadlines. A central challenge is to maintain scalability when dealing with fine-grained timing constraints, which can significantly exacerbate ASP's grounding bottleneck. To address this issue, we leverage extensions of ASP with difference constraints, a simplified form of linear constraints, to handle time-related aspects externally. Our approach effectively decouples metric ASP from the granularity of time, resulting in a solution that is unaffected by time precision.