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.
View on arXiv@article{becker2025_2506.08150,
title={ Compiling Metric Temporal Answer Set Programming },
author={ Arvid Becker and Pedro Cabalar and Martin Diéguez and Javier Romero and Susana Hahn and Torsten Schaub },
journal={arXiv preprint arXiv:2506.08150},
year={ 2025 }
}