Past-present temporal programs over finite traces
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2023
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866929216880115712 |
|---|---|
| author | Cabalar, Pedro Diéguez, Martín Laferrière, François Schaub, Torsten |
| author_facet | Cabalar, Pedro Diéguez, Martín Laferrière, François Schaub, Torsten |
| contents | Extensions of Answer Set Programming with language constructs from temporal logics, such as temporal equilibrium logic over finite traces (TELf), provide an expressive computational framework for modeling dynamic applications. In this paper, we study the so-called past-present syntactic subclass, which consists of a set of logic programming rules whose body references to the past and head to the present. Such restriction ensures that the past remains independent of the future, which is the case in most dynamic domains. We extend the definitions of completion and loop formulas to the case of past-present formulas, which allows capturing the temporal stable models of a set of past-present temporal programs by means of an LTLf expression. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2307_12620 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Past-present temporal programs over finite traces Cabalar, Pedro Diéguez, Martín Laferrière, François Schaub, Torsten Artificial Intelligence Extensions of Answer Set Programming with language constructs from temporal logics, such as temporal equilibrium logic over finite traces (TELf), provide an expressive computational framework for modeling dynamic applications. In this paper, we study the so-called past-present syntactic subclass, which consists of a set of logic programming rules whose body references to the past and head to the present. Such restriction ensures that the past remains independent of the future, which is the case in most dynamic domains. We extend the definitions of completion and loop formulas to the case of past-present formulas, which allows capturing the temporal stable models of a set of past-present temporal programs by means of an LTLf expression. |
| title | Past-present temporal programs over finite traces |
| topic | Artificial Intelligence |
| url | https://arxiv.org/abs/2307.12620 |