Zobrazeno 1 - 10
of 346
pro vyhledávání: '"MONTANARI, ANGELO"'
This paper focuses on succinctness results for fragments of Linear Temporal Logic with Past (LTL) devoid of binary temporal operators like until, and provides methods to establish them. We prove that there is a family of cosafety languages (Ln)_{n>=1
Externí odkaz:
http://arxiv.org/abs/2401.09860
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
In this paper, we study the finite satisfiability problem for the logic BE under the homogeneity assumption. BE is the cornerstone of Halpern and Shoham's interval temporal logic, and features modal operators corresponding to the prefix (a.k.a. "Begi
Externí odkaz:
http://arxiv.org/abs/2304.11483
Autor:
Bernardini, Andrea, Brunello, Andrea, Gigli, Gian Luigi, Montanari, Angelo, Saccomanno, Nicola
Publikováno v:
Artificial Intelligence in Medicine, Volume 118, 2021
Obstructive Sleep Apnea Syndrome (OSAS) is the most common sleep-related breathing disorder. It is caused by an increased upper airway resistance during sleep, which determines episodes of partial or complete interruption of airflow. The detection an
Externí odkaz:
http://arxiv.org/abs/2302.05179
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
The ever more accurate search for deep analysis in customer data is a really strong technological trend nowadays, quite appealing to both private and public companies. This is particularly true in the contact center domain, where speech analytics is
Externí odkaz:
http://arxiv.org/abs/2203.06396
Publikováno v:
EPTCS 346, 2021, pp. 179-194
The choice of the right trade-off between expressiveness and complexity is the main issue in interval temporal logic. In their seminal paper, Halpern and Shoham showed that the satisfiability problem for HS (the temporal logic of Allen's relations) i
Externí odkaz:
http://arxiv.org/abs/2109.08320
Publikováno v:
EPTCS 346, 2021, pp. 152-165
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:
http://arxiv.org/abs/2109.08319