The undecidability of the logic of subintervals

Recommendations

B and D are enough to make the Halpern-Shoham logic undecidable
The dark side of interval temporal logic: marking the undecidability border
Maximal decidable fragments of Halpern and Shoham's modal logic of intervals
Interval temporal logics over strongly discrete linear orders: the complete picture
Undecidability of the logic of overlap relation over discrete linear orderings

Cited in

(26)

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?
Computational complexity of hybrid interval temporal logics
Model checking interval temporal logics with regular expressions
The dark side of interval temporal logic: marking the undecidability border
On coarser interval temporal logics
A complete classification of the expressiveness of interval logics of Allen's relations: the general and the dense cases
Interval temporal logic model checking: the border between good and bad HS fragments
Dyck algebras, interval temporal logic, and posets of intervals
Undecidability of the logic of overlap relation over discrete linear orderings
Mining approximate interval-based temporal dependencies
Checking interval properties of computations
On the complexity of model checking for syntactically maximal fragments of the interval temporal logic HS with regular expressions
B and D are enough to make the Halpern-Shoham logic undecidable
Interval vs. point temporal logic model checking. An expressiveness comparison
Satisfiability and model checking for the logic of sub-intervals under the homogeneity assumption
On a Temporal Logic of Prefixes and Infixes.
\textsc{Pspace}-completeness of the temporal logic of sub-intervals and suffixes
Fuzzy Halpern and Shoham's interval temporal logics
Interval Temporal Logic for Visibly Pushdown Systems
Parametric interval temporal logic over infinite words
Adding the relation \textit{Meets} to the temporal logic of prefixes and infixes makes it EXPSPACE-complete
Decision tree learning with spatial modal logics
A quantitative extension of interval temporal logic over infinite words
Undecidable properties of extensions of the logic of provability
Complexity analysis of a unifying algorithm for model checking interval temporal logic

This page was built for publication: The undecidability of the logic of subintervals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5415296)