Compiling Metric Temporal Answer Set Programming Article Swipe

PDF

Related Concepts

No concepts available.

Arvid Becker , Pedro Cabalar , Martín Diéguez , Javier Romero , Susana Hahn , Torsten Schaub ·

YOU? · · 2025 · Open Access · · DOI: https://doi.org/10.48550/arxiv.2506.08150 · OA: W4417255469

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.