Article
Version 1
Preserved in Portico This version is not peer-reviewed
DECLAREd: A Polytime LTLf Fragment
Version 1
: Received: 5 March 2024 / Approved: 5 March 2024 / Online: 6 March 2024 (07:31:34 CET)
Version 2 : Received: 10 March 2024 / Approved: 11 March 2024 / Online: 11 March 2024 (13:18:45 CET)
Version 2 : Received: 10 March 2024 / Approved: 11 March 2024 / Online: 11 March 2024 (13:18:45 CET)
A peer-reviewed article of this Preprint also exists.
Bergami, G. DECLAREd: A Polytime LTLf Fragment. Logics 2024, 2, 79-111. Bergami, G. DECLAREd: A Polytime LTLf Fragment. Logics 2024, 2, 79-111.
Abstract
This paper considers a specific fragment of Linear Temporal Logic for Finite traces, DECLAREd, which, to the best of our knowledge, we prove for the first time to be a {polytime} fragment of LTLf. We derive this in terms of the following ancillary results: we propose a set of novel LTLf equivalence rules that, when applied to \LTLf specifications, lead to an equivalent specification which can be computed faster by any existing verified temporal artificial intelligence task. We also introduce the concept of temporal non-simultaneity, prescribing that two activities shall never satisfy the same atom, and temporal short-circuit, that occurs when a specification interpreted in LTL would accept an infinitely long trace while, on LTLf, it can be rewritten so to postulate the absence of certain activity labels. We test these considerations over formal synthesis (Lydia), SAT-Solvers (AALTAF) and formal verification (KnoBAB) tools, where formal verification can be also run on top of a relational database and can be therefore expressed in terms of relational query answering. We show that all these benefit from the aforementioned assumptions, as running their tasks over a rewritten equivalent specification will improve their running times.
Keywords
LTLf; Declare; Verified Artificial Intelligence; Equational logic and rewriting
Subject
Computer Science and Mathematics, Logic
Copyright: This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Comments (0)
We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.
Leave a public commentSend a private comment to the author(s)
* All users must log in before leaving a comment