Zobrazeno 1 - 10
of 61
pro vyhledávání: '"Gigante, Nicola"'
Autor:
Acampora, Renato, Della Monica, Dario, Geatti, Luca, Gigante, Nicola, Montanari, Angelo, Sala, Pietro
Publikováno v:
EPTCS 409, 2024, pp. 5-18
Qualitative timeline-based planning models domains as sets of independent, but interacting, components whose behaviors over time, the timelines, are governed by sets of qualitative temporal constraints (ordering relations), called synchronization rul
Externí odkaz:
http://arxiv.org/abs/2410.22757
First-order linear temporal logic (FOLTL) is a flexible and expressive formalism capable of naturally describing complex behaviors and properties. Although the logic is in general highly undecidable, the idea of using it as a specification language f
Externí odkaz:
http://arxiv.org/abs/2405.20057
Operator Precedence Languages (OPL) have been recently identified as a suitable formalism for model checking recursive procedural programs, thanks to their ability of modeling the program stack. OPL requirements can be expressed in the Precedence Ori
Externí odkaz:
http://arxiv.org/abs/2405.11327
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 differen
Externí odkaz:
http://arxiv.org/abs/2307.16840
Publikováno v:
Logical Methods in Computer Science, Volume 20, Issue 3 (August 27, 2024) lmcs:11639
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. Traditional timeline-based planning systems excel at the integration of planning with execut
Externí odkaz:
http://arxiv.org/abs/2307.12289
Many complex scenarios require the coordination of agents possessing unique points of view and distinct semantic commitments. In response, standpoint logic (SL) was introduced in the context of knowledge integration, allowing one to reason with diver
Externí odkaz:
http://arxiv.org/abs/2304.14243
Linear Temporal Logic (LTL) is the de-facto standard temporal logic for system specification, whose foundational properties have been studied for over five decades. Safety and cosafety properties define notable fragments of LTL, where a prefix of a t
Externí odkaz:
http://arxiv.org/abs/2211.14913
Publikováno v:
EPTCS 370, 2022, pp. 131-146
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. Traditional timeline-based planning systems excel at th
Externí odkaz:
http://arxiv.org/abs/2209.10319
Publikováno v:
Logical Methods in Computer Science, Volume 19, Issue 3 (August 10, 2023) lmcs:10061
Linear Temporal Logic (LTL) is one of the most popular temporal logics, that comes into play in a variety of branches of computer science. Among the various reasons of its widespread use there are its strong foundational properties: LTL is equivalent
Externí odkaz:
http://arxiv.org/abs/2209.02307
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. The resulting logic, called LTLf
Externí odkaz:
http://arxiv.org/abs/2204.13693