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

DOI10.1007/978-3-642-14162-1_29zbMath1288.03017MaRDI 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

03B45: Modal logic (including the logic of norms)

03B25: Decidability of theories and sets of sentences

Related Items

Hybrid Metric Propositional Neighborhood Logics with Interval Length Binders, Unnamed Item, The Parametric Complexity of Lossy Counter Machines, An interval temporal logic characterization of extended \(\omega\)-regular languages, 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, Interval temporal logics over strongly discrete linear orders: expressiveness and complexity, 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?, Decidability and complexity of the fragments of the modal logic of Allen's relations over the rationals, Model checking for fragments of the interval temporal logic HS at the low levels of the polynomial time hierarchy, Reactive synthesis from interval temporal logic specifications, 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, On coarser interval temporal logics, Two-sorted Point-Interval Temporal Logics, Complexity Hierarchies beyond Elementary, 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, Optimal Tableau Systems for Propositional Neighborhood Logic over All, Dense, and Discrete Linear Orders