Maximal Decidable Fragments of Halpern and Shoham’s Modal Logic of Intervals

DOI10.1007/978-3-642-14162-1_29zbMath1288.03017OpenAlexW1523652916MaRDI QIDQ3587451

Gabriele Puppis, Pietro Sala, Angelo Montanari

Publication date: 7 September 2010

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14162-1_29

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Decidability of theories and sets of sentences (03B25)

Related Items (22)

A complete classification of the expressiveness of interval logics of Allen's relations: the general and the dense cases ⋮ Adding one or more equivalence relations to the interval temporal logic \(\mathsf{AB}\overline{\mathsf{B}}\) ⋮ Checking interval properties of computations ⋮ Sub-propositional Fragments of the Interval Temporal Logic of Allen’s Relations ⋮ On the Expressiveness of the Interval Logic of Allen’s Relations Over Finite and Discrete Linear Orders ⋮ An interval temporal logic characterization of extended \(\omega\)-regular languages ⋮ Model checking for fragments of Halpern and Shoham's interval temporal logic based on track representatives ⋮ Interval temporal logics over strongly discrete linear orders: expressiveness and complexity ⋮ Which fragments of the interval temporal logic HS are tractable in model checking? ⋮ Decidability and complexity of the fragments of the modal logic of Allen's relations over the rationals ⋮ Optimal Tableau Systems for Propositional Neighborhood Logic over All, Dense, and Discrete Linear Orders ⋮ The light side of interval temporal logic: the Bernays-Schönfinkel fragment of CDT ⋮ The dark side of interval temporal logic: marking the undecidability border ⋮ Interval-based temporal functional dependencies: specification and verification ⋮ Hybrid Metric Propositional Neighborhood Logics with Interval Length Binders ⋮ Unnamed Item ⋮ Model checking for fragments of the interval temporal logic HS at the low levels of the polynomial time hierarchy ⋮ Two-sorted Point-Interval Temporal Logics ⋮ Reactive synthesis from interval temporal logic specifications ⋮ The Parametric Complexity of Lossy Counter Machines ⋮ Complexity Hierarchies beyond Elementary ⋮ On coarser interval temporal logics

This page was built for publication: Maximal Decidable Fragments of Halpern and Shoham’s Modal Logic of Intervals