On a Temporal Logic of Prefixes and Infixes.

DOI10.4230/LIPIcs.MFCS.2020.21OpenAlexW3082308102MaRDI QIDQ5089182

Laura Bozzelli, Angelo Montanari, Adriano Peron, Pietro Sala

Publication date: 18 July 2022

Full work available at URL: https://doi.org/10.4230/LIPIcs.MFCS.2020.21

zbMATH Keywords

complexitysatisfiabilityinterval temporal logicstar-free regular languages

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

\textsc{Pspace}-completeness of the temporal logic of sub-intervals and suffixes

Cites Work

• Unnamed Item
• Checking interval properties of computations
• Intervals and tenses
• Which fragments of the interval temporal logic HS are tractable in model checking?
• Complexity Hierarchies beyond Elementary
• Non-finite Axiomatizability and Undecidability of Interval Temporal Logics with C, D, and T
• B and D Are Enough to Make the Halpern–Shoham Logic Undecidable
• A Modal Logic for Chopping Intervals
• Interval Logics and ωB-Regular Languages
• Satisfiability and model checking for the logic of sub-intervals under the homogeneity assumption
• Adding an Equivalence Relation to the Interval Logic ABB: Complexity and Expressiveness
• The Undecidability of the Logic of Subintervals
• A Road Map of Interval Temporal Logics and Duration Calculi

This page was built for publication: On a Temporal Logic of Prefixes and Infixes.