Search Results for author:
Found 8 papers, 0 papers with code
Decidable Fragments of LTLf Modulo Theories (Extended Version)
We study Linear Temporal Logic Modulo Theories over Finite Traces (LTLfMT), a recently introduced extension of LTL over finite traces (LTLf) where propositions are replaced by first-order formulas and where first-order variables referring to different time points can be compared.
Controller Synthesis for Timeline-based Games
In the timeline-based approach to planning, the evolution over time of a set of state variables (the timelines) is governed by a set of temporal constraints.
Standpoint Linear Temporal Logic
Many complex scenarios require the coordination of agents possessing unique points of view and distinct semantic commitments.
Controller Synthesis for Timeline-based Games
In the timeline-based approach to planning, originally born in the space sector, the evolution over time of a set of state variables (the timelines) is governed by a set of temporal constraints.
A first-order logic characterization of safety and co-safety languages
Moreover, we prove that, when interpreted over finite words, SafetyLTL (resp.
Linear Temporal Logic Modulo Theories over Finite Traces (Extended Version)
This paper studies Linear Temporal Logic over Finite Traces (LTLf) where proposition letters are replaced with first-order formulas interpreted over arbitrary theories, in the spirit of Satisfiability Modulo Theories.
Timeline-based planning: Expressiveness and Complexity
We show that winning strategies for such games can be found in doubly-exponential time.
A game-theoretic approach to timeline-based planning with uncertainty
We define a general concept of timeline-based game and we show that the notion of winning strategy for these games is strictly more general than that of control strategy for dynamically controllable flexible plans.
