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.
@article{arxiv.2601.20735,
title = {Implementing Metric Temporal Answer Set Programming},
author = {Arvid Becker and Pedro Cabalar and Martin Diéguez and Susana Hahn and Javier Romero and Torsten Schaub},
journal= {arXiv preprint arXiv:2601.20735},
year = {2026}
}