Two-sorted Point-Interval Temporal Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
The importance of the past in interval temporal logics: the case of propositional neighborhood logic
Logic Programs, Norms and Action
Adding an Equivalence Relation to the Interval Logic ABB: Complexity and Expressiveness
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
The introduction of Halpern and Shoham's modal logic of intervals (later on called HS) dates back to 1986. Despite its natural semantics, this logic is undecidable over all interesting classes of temporal structures. This discouraged research in this area until recently, when a number of non-trivial decidable fragments have been found. This paper is a contribution towards the complete classification of HS fragments. Different combinations of Allen's interval relations begins (B), meets (A), and later (L), and their inverses Abar, Bbar, and Lbar, have been considered in the literature. We know from previous work that the combination ABBbarAbar is decidable over finite linear orders and undecidable everywhere else. We extend these results by showing that ABBbarLbar is decidable over the class of all (resp., dense, discrete) linear orders, and that it is maximal w.r.t decidability over these classes: adding any other interval modality immediately leads to undecidability.