\textsc{Pspace}-completeness of the temporal logic of sub-intervals and suffixes
From MaRDI portal
Publication:6077844
DOI10.1016/j.ic.2023.105083OpenAlexW4386056996MaRDI QIDQ6077844
Pietro Sala, Adriano Peron, Angelo Montanari, Laura Bozzelli
Publication date: 27 September 2023
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2023.105083
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maintaining knowledge about temporal intervals
- Checking interval properties of computations
- Propositional interval neighborhood logics: expressiveness, decidability, and undecidable extensions
- Complexity analysis of a unifying algorithm for model checking interval temporal logic
- Intervals and tenses
- Reasoning about infinite computations
- Model checking for fragments of Halpern and Shoham's interval temporal logic based on track representatives
- Which fragments of the interval temporal logic HS are tractable in model checking?
- Model checking for fragments of the interval temporal logic HS at the low levels of the polynomial time hierarchy
- The dark side of interval temporal logic: marking the undecidability border
- Temporal prepositions and their logic
- Tableaux for Logics of Subinterval Structures over Dense Orderings
- Non-finite Axiomatizability and Undecidability of Interval Temporal Logics with C, D, and T
- “Sometimes” and “not never” revisited
- A Modal Logic for Chopping Intervals
- A propositional modal logic of time intervals
- Interval vs. Point Temporal Logic Model Checking
- On a Temporal Logic of Prefixes and Infixes.
- Satisfiability and model checking for the logic of sub-intervals under the homogeneity assumption
- From linear time to branching time
- The Undecidability of the Logic of Subintervals
This page was built for publication: \textsc{Pspace}-completeness of the temporal logic of sub-intervals and suffixes
