Succinctness of Cosafety Fragments of LTL via Combinatorial Proof Systems (extended version)
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 …
(LTL) devoid of binary temporal operators like until, and provides methods to establish them …
Succinctness issues for LTLf and safety and cosafety fragments of LTL
Abstract Linear Temporal Logic over finite traces (LTL f) has proved itself to be an important
and effective formalism in formal verification as well as in artificial intelligence. Pure past LTL …
and effective formalism in formal verification as well as in artificial intelligence. Pure past LTL …
Succinctness of Cosafety Fragments of LTL via Combinatorial Proof Systems
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 …
(LTL) devoid of binary temporal operators like until, and provides methods to establish them …
Towards the exact complexity of realizability for Safety LTL
We study the realizability and strong satisfiability problems for Safety LTL, a syntactic
fragment of Linear Temporal Logic (Image 1) capturing safe formulas. While it is well-known …
fragment of Linear Temporal Logic (Image 1) capturing safe formulas. While it is well-known …
Regular Transformations in Sequential Optimization & Reinforcement Learning
T Dohmen - 2024 - search.proquest.com
Sequential optimization is a subfield of mathematical optimization---lying at the confluence
of decision theory, operations research, game theory, artificial intelligence, and stochastic …
of decision theory, operations research, game theory, artificial intelligence, and stochastic …