Zobrazeno 1 - 10
of 118 300
pro vyhledávání: '"ltl"'
Autor:
Chen, Xinghan1 (AUTHOR) 20114057@bjtu.edu.cn, Tang, Weilin1 (AUTHOR) 22110290@bjtu.edu.cn, Hai, Yuzhilin1 (AUTHOR) 24110262@bjtu.edu.cn, Lang, Maoxiang1 (AUTHOR) 22125829@bjtu.edu.cn, Liu, Yuying1 (AUTHOR), Li, Shiqi2 (AUTHOR) 17114220@bjtu.edu.cn
Publikováno v:
Mathematics (2227-7390). Nov2024, Vol. 12 Issue 21, p3336. 28p.
Autor:
Zhang, Changjian, Kapoor, Parv, Dardik, Ian, Cui, Leyi, Meira-Goes, Romulo, Garlan, David, Kang, Eunsuk
Temporal logic specifications play an important role in a wide range of software analysis tasks, such as model checking, automated synthesis, program comprehension, and runtime monitoring. Given a set of positive and negative examples, specified as t
Externí odkaz:
http://arxiv.org/abs/2412.02905
Reinforcement learning (RL) is a promising method to learn optimal control policies for systems with unknown dynamics. In particular, synthesizing controllers for safety-critical systems based on high-level specifications, such as those expressed in
Externí odkaz:
http://arxiv.org/abs/2411.12019
Autor:
Kamide, Norihiro, Negri, Sara
Publikováno v:
EPTCS 415, 2024, pp. 165-179
A unified Gentzen-style framework for until-free propositional linear-time temporal logic is introduced. The proposed framework, based on infinitary rules and rules for primitive negation, can handle uniformly both a single-succedent sequent calculus
Externí odkaz:
http://arxiv.org/abs/2501.00494
Linear temporal logic (LTL) and, more generally, $\omega$-regular objectives are alternatives to the traditional discount sum and average reward objectives in reinforcement learning (RL), offering the advantage of greater comprehensibility and hence
Externí odkaz:
http://arxiv.org/abs/2410.12175
Linear temporal logic (LTL) has recently been adopted as a powerful formalism for specifying complex, temporally extended tasks in reinforcement learning (RL). However, learning policies that efficiently satisfy arbitrary specifications not observed
Externí odkaz:
http://arxiv.org/abs/2410.04631
Autor:
Ehlers, Rüdiger, Khalimov, Ayrat
Chains of co-B\"uchi automata (COCOA) have recently been introduced as a new canonical representation of omega-regular languages. The co-B\"uchi automata in a chain assign to each omega-word its natural color, which depends only on the language itsel
Externí odkaz:
http://arxiv.org/abs/2410.01021
Standpoint linear temporal logic SLTL is a recent formalism able to model possibly conflicting commitments made by distinct agents, taking into account aspects of temporal reasoning. In this paper, we analyse the computational properties of SLTL. Fir
Externí odkaz:
http://arxiv.org/abs/2408.08557
Autor:
Xuan, Zetong, Wang, Yu
Linear Temporal Logic (LTL) is a formal way of specifying complex objectives for planning problems modeled as Markov Decision Processes (MDPs). The planning problem aims to find the optimal policy that maximizes the satisfaction probability of the LT
Externí odkaz:
http://arxiv.org/abs/2408.05438
This work develops a zero-shot mechanism, Comp-LTL, for an agent to satisfy a Linear Temporal Logic (LTL) specification given existing task primitives trained via reinforcement learning (RL). Autonomous robots often need to satisfy spatial and tempor
Externí odkaz:
http://arxiv.org/abs/2408.04215