Implementing Metric Temporal Answer Set Programming
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910003637518336 |
|---|---|
| author | Becker, Arvid Cabalar, Pedro Diéguez, Martin Hahn, Susana Romero, Javier Schaub, Torsten |
| author_facet | Becker, Arvid Cabalar, Pedro Diéguez, Martin Hahn, Susana Romero, Javier Schaub, Torsten |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_20735 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Implementing Metric Temporal Answer Set Programming Becker, Arvid Cabalar, Pedro Diéguez, Martin Hahn, Susana Romero, Javier Schaub, Torsten Artificial Intelligence Logic in Computer Science I.2.8; I.2.4 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. |
| title | Implementing Metric Temporal Answer Set Programming |
| topic | Artificial Intelligence Logic in Computer Science I.2.8; I.2.4 |
| url | https://arxiv.org/abs/2601.20735 |