A Standard Grammar for Temporal Logics on Finite Traces
Marco Favorito

TL;DR
This paper proposes a standard grammar for various temporal logic formalisms on finite traces to improve interoperability among tools, addressing the current lack of a unified syntax.
Contribution
It introduces a unified standard grammar for multiple finite-trace temporal logics, facilitating tool interoperability and consistency.
Findings
A comprehensive standard grammar for LTLf, LDLf, PLTLf, and PLDLf.
Improved interoperability among tools supporting finite-trace temporal logics.
Clarification of syntax differences and commonalities across formalisms.
Abstract
The heterogeneity of tools that support temporal logic formulae poses several challenges in terms of interoperability. In particular, a standard syntax for temporal logic on finite traces, despite similar to the one for infinite traces, is currently missing. This document proposes a standard grammar for several temporal logic formalisms interpreted over finite traces, like Linear Temporal Logic (LTLf), Linear Dynamic Logic (LDLf), Pure-Past Linear Temporal Logic (PLTLf) and Pure-Past Linear Dynamic Logic (PLDLf).
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSemantic Web and Ontologies · Logic, Reasoning, and Knowledge · Advanced Database Systems and Queries
