Decidable and Undecidable Fragments of Halpern and Shoham’s Interval Temporal Logic: Towards a Complete Classification

DOI10.1007/978-3-540-89439-1_41zbMath1182.03037MaRDI QIDQ5505583

Davide Bresolin, Dario Della Monica, Angelo Montanari, Guido Sciavicco, Valentin F. Goranko

Publication date: 27 January 2009

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-89439-1_41

Mathematics Subject Classification ID

03B25: Decidability of theories and sets of sentences

03B44: Temporal logic

Related Items

Hybrid Metric Propositional Neighborhood Logics with Interval Length Binders, A complete classification of the expressiveness of interval logics of Allen's relations: the general and the dense cases, Decidability and complexity of the fragments of the modal logic of Allen's relations over the rationals, 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, On coarser interval temporal logics, A survey on temporal logics for specifying and verifying real-time systems, Two-sorted Point-Interval Temporal Logics, 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, Undecidability of the Logic of Overlap Relation over Discrete Linear Orderings