Implementing Metric Temporal Answer Set Programming
Theory and Practice of Logic Programming · 2026-05 · 26 (3-4) · 553-618
DOI: 10.1017/s1471068426100714 ↗Kurz gefasst
Fachartikel in der Zeitschrift Theory and Practice of Logic Programming, online erschienen am 24.09.2026. Verfasst von SUSANA HAHN und 5 weiteren Autor:innen. Die Arbeit nennt 39 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
We develop a computational approach to Metric Answer Set Programming (ASP) to express quantitative temporal constrains, such as durations and deadlines. We investigate two specific fragments: plain metric logic programs, restricted to local temporal constraints, and general metric logic programs, which allow for arbitrary metric formulas. A central challenge in this context is maintaining scalability when dealing with fine-grained timing constraints, which can significantly exacerbate grounding bottleneck of ASP. To address this issue, we propose translations of both fragments into standard ASP and ASP extended with difference constraints, a simplified form of linear constraints, and prove their correctness and completeness. Our implementation, realized via meta-encodings, effectively decouples metric ASP from the granularity of time, resulting in a solution that is independent of time precision.
Zitieren
APA
HAHN, S., BECKER, A., CABALAR, P., DIÉGUEZ, M., ROMERO, J., & SCHAUB, T. (2026). Implementing Metric Temporal Answer Set Programming. Theory and Practice of Logic Programming, 26(3-4), 553-618. https://doi.org/10.1017/s1471068426100714
Vancouver
HAHN S, BECKER A, CABALAR P, DIÉGUEZ M, ROMERO J, SCHAUB T. Implementing Metric Temporal Answer Set Programming. Theory and Practice of Logic Programming. 2026;26(3-4):553-618. doi:10.1017/s1471068426100714
BibTeX
@article{HAHN2026,
author = {HAHN, SUSANA and BECKER, ARVID and CABALAR, PEDRO and DIÉGUEZ, MARTÍN and ROMERO, JAVIER and SCHAUB, TORSTEN},
title = {Implementing Metric Temporal Answer Set Programming},
journal = {Theory and Practice of Logic Programming},
year = {2026},
volume = {26},
number = {3-4},
pages = {553--618},
doi = {10.1017/s1471068426100714}
}
EUVIMED