Interval temporal logics over strongly discrete linear orders: expressiveness and complexity
From MaRDI portal
Publication:477203
DOI10.1016/J.TCS.2014.03.033zbMATH Open1335.03017OpenAlexW2083861746MaRDI QIDQ477203FDOQ477203
Authors: Davide Bresolin, Dario Della Monica, Angelo Montanari, Pietro Sala, Guido Sciavicco 
Publication date: 2 December 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.03.033
Recommendations
- Interval temporal logics over strongly discrete linear orders: the complete picture
- Interval temporal logics over finite linear orders: the complete picture
- Decidability and complexity of the fragments of the modal logic of Allen's relations over the rationals
- On the expressiveness of the interval logic of Allen's relations over finite and discrete linear orders
- On the complexity of fragments of the modal logic of Allen's relations over dense structures
Cites Work
- Maintaining knowledge about temporal intervals
- Many-dimensional modal logics: theory and applications
- Expressiveness and completeness of an interval tense logic
- Two-sorted point-interval temporal logics
- On begins, meets and before
- Decidability of the interval temporal logic \(\operatorname{AB\overline{B}}\) over the natural numbers
- Tableaux for logics of subinterval structures over dense orderings
- Maximal decidable fragments of Halpern and Shoham's modal logic of intervals
- A propositional modal logic of time intervals
- Propositional interval neighborhood logics: expressiveness, decidability, and undecidable extensions
- A Road Map of Interval Temporal Logics and Duration Calculi
- An optimal decision procedure for right propositional neighborhood logic
- An Optimal Tableau-Based Decision Algorithm for Propositional Neighborhood Logic
- On termination and invariance for faulty channel machines
- Title not available (Why is that?)
Cited In (23)
- Fuzzy Halpern and Shoham's interval temporal logics
- Adding the relation \textit{Meets} to the temporal logic of prefixes and infixes makes it EXPSPACE-complete
- Decidable and Undecidable Fragments of Halpern and Shoham’s Interval Temporal Logic: Towards a Complete Classification
- An interval temporal logic characterization of extended \(\omega\)-regular languages
- Decidability and complexity of the fragments of the modal logic of Allen's relations over the rationals
- Adding one or more equivalence relations to the interval temporal logic \(\mathsf{AB}\overline{\mathsf{B}}\)
- On the Expressiveness of the Interval Logic of Allen’s Relations Over Finite and Discrete Linear Orders
- On coarser interval temporal logics
- Unary and two-variable interval logics
- A Road Map of Interval Temporal Logics and Duration Calculi
- Dyck algebras, interval temporal logic, and posets of intervals
- Title not available (Why is that?)
- A New Modal Approach to the Logic of Intervals
- Neural-symbolic temporal decision trees for multivariate time series classification
- Decision tree learning with spatial modal logics
- A Minimal Hybrid Logic for Intervals
- Bounded variability of metric temporal logic
- Reactive synthesis from interval temporal logic specifications
- Interval Temporal Logic for Visibly Pushdown Systems
- Computational complexity of hybrid interval temporal logics
- Title not available (Why is that?)
- Title not available (Why is that?)
- Hybrid fragments of Halpern-Shoham logic and their expressive power
This page was built for publication: Interval temporal logics over strongly discrete linear orders: expressiveness and complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q477203)
