Zobrazeno 1 - 10
of 16
pro vyhledávání: '"Luca Geatti"'
Publikováno v:
Logical Methods in Computer Science, Vol Volume 20, Issue 3 (2024)
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:
https://doaj.org/article/055f668710ac43e28a154938847376e7
Publikováno v:
Logical Methods in Computer Science, Vol Volume 19, Issue 3 (2023)
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:
https://doaj.org/article/819b5736fa194b1bad0ddbda3b5ae1b8
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 277, Iss Proc. GandALF 2018, Pp 176-190 (2018)
In this paper, we propose a novel one-pass and tree-shaped tableau method for Timed Propositional Temporal Logic and for a bounded variant of its extension with past operators. Timed Propositional Temporal Logic (TPTL) is a real-time temporal logic,
Externí odkaz:
https://doaj.org/article/9149dd04c4184ef3b9f147d468ecd7b8
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::22b18cd29b5a71797ba5bee8f042cdf6
http://arxiv.org/abs/2209.10319
http://arxiv.org/abs/2209.10319
Publikováno v:
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence.
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:
https://explore.openaire.eu/search/publication?articleId=doi_________::9d3d5768010a3b6af84a3daee23d5da0
https://doi.org/10.24963/ijcai.2022/366
https://doi.org/10.24963/ijcai.2022/366
Publikováno v:
Tools and Algorithms for the Construction and Analysis of Systems
Tools and Algorithms for the Construction and Analysis of Systems ISBN: 9783030451899
TACAS (1)
Tools and Algorithms for the Construction and Analysis of Systems ISBN: 9783030451899
TACAS (1)
The initialization of complex cyber-physical systems often requires the interaction of various components that must start up with strict timing requirements on the provision of signals (power, refrigeration, light, etc.). In order to safely allow an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c19d430cf4fc3917e94d155eb10b9c73
http://europepmc.org/articles/PMC7439741
http://europepmc.org/articles/PMC7439741
Publikováno v:
SSRN Electronic Journal.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0235c2f7ef0c8e8b7c3842f29f31d662
https://doi.org/10.2139/ssrn.4105340
https://doi.org/10.2139/ssrn.4105340
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030992521
Linear Temporal Logic ($$\mathsf {LTL}$$ LTL ) is one of the most popular temporal logics, that comes into play in a variety of branches of computer science. Its widespread use is also due to its strong foundational properties. One of them is Kamp’
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ce86ff1fbdaf920310ac39ef66ab7348
https://doi.org/10.1007/978-3-030-99253-8_13
https://doi.org/10.1007/978-3-030-99253-8_13
Publikováno v:
Information Processing Letters. 179:106319
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::724c2c64012bd8f7fa842b7f26b8d71e
https://doi.org/10.1016/j.ipl.2022.106319
https://doi.org/10.1016/j.ipl.2022.106319
Publikováno v:
GandALF
Extended Bounded Response LTL with Past (LTLEBR+P) is a safety fragment of Linear Temporal Logic with Past (LTL+P) that has been recently introduced in the context of reactive synthesis. The strength of LTLEBR+P is a fully symbolic compilation of for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c1441a63ab038265246f2e41630b3111
http://arxiv.org/abs/2109.08319
http://arxiv.org/abs/2109.08319