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.

翻译：我们开发了一种度量答案集编程（ASP）的计算方法，以支持表达定量时序约束，如持续时间和截止时间。一个核心挑战是在处理细粒度时序约束时保持可扩展性，因为这些约束可能显著加剧ASP的接地瓶颈。为解决此问题，我们利用ASP的差分约束扩展（一种简化形式的线性约束）来外部处理与时间相关的方面。我们的方法有效地将度量ASP与时间粒度解耦，从而产生一个不受时间精度影响的解决方案。