Decidable Fragments of LTLf Modulo Theories (Extended Version)

TL;DR

This paper introduces a new tableau-based method for LTLf Modulo Theories, establishing decidability for certain fragments and providing a complete, sound pruning rule that guarantees termination under specific conditions.

Contribution

It presents a sound and complete pruning rule for LTLfMT tableau, enabling decidability results for new and existing fragments of the logic.

Findings

A new sound and complete pruning rule for LTLfMT tableau.

Decidability results for several LTLfMT fragments.

New proofs of decidability for known classes.

Abstract

We study Linear Temporal Logic Modulo Theories over Finite Traces (LTLfMT), a recently introduced extension of LTL over finite traces (LTLf) where propositions are replaced by first-order formulas and where first-order variables referring to different time points can be compared. In general, LTLfMT was shown to be semi-decidable for any decidable first-order theory (e.g., linear arithmetics), with a tableau-based semi-decision procedure. In this paper we present a sound and complete pruning rule for the LTLfMT tableau. We show that for any LTLfMT formula that satisfies an abstract, semantic condition, that we call finite memory, the tableau augmented with the new rule is also guaranteed to terminate. Last but not least, this technique allows us to establish novel decidability results for the satisfiability of several fragments of LTLfMT, as well as to give new decidability proofs for classes that are already known.