no code implementations • 19 Jan 2024 • Arvid Becker, Pedro Cabalar, Martín Diéguez, Luis Fariñas, Torsten Schaub, Anna Schuhmann
In temporal extensions of Answer Set Programming (ASP) based on linear-time, the behavior of dynamic systems is captured by sequences of states.
no code implementations • 24 Jul 2023 • Pedro Cabalar, Martín Diéguez, François Laferrière, Torsten Schaub
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.
no code implementations • 27 Jun 2023 • Juan Pablo Aguilera, Martín Diéguez, David Fernández-Duque, Brett McLean
We then show that these two semantics indeed define one and the same logic: the statements that are valid for the real-valued semantics are the same as those that are valid for the bi-relational semantics.
no code implementations • 28 Apr 2023 • Arvid Becker, Pedro Cabalar, Martín Diéguez, Torsten Schaub, Anna Schuhmann
We address this by developing a metric extension of linear-time temporal equilibrium logic, in which temporal operators are constrained by intervals over natural numbers.
1 code implementation • 4 Sep 2021 • Pedro Cabalar, Martín Diéguez, Susana Hahn, Torsten Schaub
On the one hand, we elaborate upon a transformation of dynamic formulas into alternating automata that relies on meta-programming in ASP.
no code implementations • 17 Feb 2020 • Pedro Cabalar, Martín Diéguez, Torsten Schaub, François Laferrière
We introduce an implementation of an extension of Answer Set Programming (ASP) with language constructs from dynamic (and temporal) logic that provides an expressive computational framework for modeling dynamic applications.
no code implementations • 30 Dec 2019 • Philippe Balbiani, Joseph Boudou, Martín Diéguez, David Fernández-Duque
We consider intuitionistic variants of linear temporal logic with `next', `until' and `release' based on expanding posets: partial orders equipped with an order-preserving transition function.
no code implementations • 10 Apr 2017 • Joseph Boudou, Martín Diéguez, David Fernández-Duque
We introduce the logic $\sf ITL^e$, an intuitionistic temporal logic based on structures $(W,\preccurlyeq, S)$, where $\preccurlyeq$ is used to interpret intuitionistic implication and $S$ is a $\preccurlyeq$-monotone function used to interpret temporal modalities.
Logic
no code implementations • 19 Sep 2016 • Felicidad Aguado, Pedro Cabalar, Martín Diéguez, Gilberto Pérez, Concepción Vidal
In this note we consider the problem of introducing variables in temporal logic programs under the formalism of "Temporal Equilibrium Logic" (TEL), an extension of Answer Set Programming (ASP) for dealing with linear-time modal operators.