Metric Dynamic Equilibrium Logic

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Becker, Arvid, Cabalar, Pedro, Diéguez, Martín, Fariñas, Luis, Schaub, Torsten, Schuhmann, Anna
Natura: Preprint
Pubblicazione: 2024
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866911760990076928
author Becker, Arvid
Cabalar, Pedro
Diéguez, Martín
Fariñas, Luis
Schaub, Torsten
Schuhmann, Anna
author_facet Becker, Arvid
Cabalar, Pedro
Diéguez, Martín
Fariñas, Luis
Schaub, Torsten
Schuhmann, Anna
contents In temporal extensions of Answer Set Programming (ASP) based on linear-time, the behavior of dynamic systems is captured by sequences of states. While this representation reflects their relative order, it abstracts away the specific times associated with each state. In many applications, however, timing constraints are important like, for instance, when planning and scheduling go hand in hand. We address this by developing a metric extension of linear-time Dynamic Equilibrium Logic, in which dynamic operators are constrained by intervals over integers. The resulting Metric Dynamic Equilibrium Logic provides the foundation of an ASP-based approach for specifying qualitative and quantitative dynamic constraints. As such, it constitutes the most general among a whole spectrum of temporal extensions of Equilibrium Logic. In detail, we show that it encompasses Temporal, Dynamic, Metric, and regular Equilibrium Logic, as well as its classic counterparts once the law of the excluded middle is added.
format Preprint
id arxiv_https___arxiv_org_abs_2401_10781
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Metric Dynamic Equilibrium Logic
Becker, Arvid
Cabalar, Pedro
Diéguez, Martín
Fariñas, Luis
Schaub, Torsten
Schuhmann, Anna
Artificial Intelligence
Logic in Computer Science
In temporal extensions of Answer Set Programming (ASP) based on linear-time, the behavior of dynamic systems is captured by sequences of states. While this representation reflects their relative order, it abstracts away the specific times associated with each state. In many applications, however, timing constraints are important like, for instance, when planning and scheduling go hand in hand. We address this by developing a metric extension of linear-time Dynamic Equilibrium Logic, in which dynamic operators are constrained by intervals over integers. The resulting Metric Dynamic Equilibrium Logic provides the foundation of an ASP-based approach for specifying qualitative and quantitative dynamic constraints. As such, it constitutes the most general among a whole spectrum of temporal extensions of Equilibrium Logic. In detail, we show that it encompasses Temporal, Dynamic, Metric, and regular Equilibrium Logic, as well as its classic counterparts once the law of the excluded middle is added.
title Metric Dynamic Equilibrium Logic
topic Artificial Intelligence
Logic in Computer Science
url https://arxiv.org/abs/2401.10781