# Compiling Metric Temporal Answer Set Programming

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

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 7 of its 24 references that are in the map.
- First posted on arXiv 9 Jun 2025.

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

- [How to build your own ASP-based system?!](https://mlsanity.com/paper/2008.06692/) (2020)
- [Clingo goes Linear Constraints over Reals and Integers](https://mlsanity.com/paper/1707.04053/) (2017)
- [Clingcon: The Next Generation](https://mlsanity.com/paper/1705.04569/) (2017)
- [MeTeoR: Practical Reasoning in Datalog with Metric Temporal Operators](https://mlsanity.com/paper/2201.04596/) (2022)
- [Towards Metric Temporal Answer Set Programming](https://mlsanity.com/paper/2008.02038/) (2020)
- [Metric Temporal Equilibrium Logic over Timed Traces](https://mlsanity.com/paper/2304.14778/) (2023)
- [Aspartame: Solving Constraint Satisfaction Problems with Answer Set Programming](https://mlsanity.com/paper/1312.6113/) (2013)

## Abstract (arXiv)

We develop a computational approach to Metric Answer Set Programming (ASP) to allow for expressing quantitative temporal constrains, 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.