5 citations · 5 across the 5 of their papers we have counts for
Showing cs.AIShow all
2 papers · 1 filter
cs.AI2023
Past-present temporal programs over finite traces
Pedro Cabalar, Martín Diéguez, François Laferrière +1
Extensions of Answer Set Programming with language constructs from temporal logics, such as temporal equilibrium logic over finite traces (TELf), provide an expressive computationa…
cs.AI2023★ 5 cited
Metric Temporal Equilibrium Logic over Timed Traces
Arvid Becker, Pedro Cabalar, Martín Diéguez +2
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…