Treffer: Compiling Metric Temporal Answer Set Programming

Presented in the following conference: LPNMR 2024: 17th International Conference on Logic Programming and Nonmonotonic Reasoning, Dallas, TX, USA, October 11–14, 2024 ; This version of the conference paper has been accepted for publication, after peer review; it is not the Version of Record and does not reflect post-acceptance improvements, or any corrections. The Version of Record is available online at: https://doi.org/10.1007/978-3-031-74209-5_2. ; [Abstract]: 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. ; This work was partially funded by DFG grant SCHA 550/15, Etoiles Montantes CTASP at Region Pays de la Loire, Xunta de Galicia grant GPC ED431B 2022/33, and MCIN AEI/10.13039/501100011033 grant PID2020-116201GB-I00. ; Xunta de Galicia; ED431B 2022/33 ; Germany. Deutsche Forschungsgemeinschaft (DFG); SCHA 550/15