The importance of the past in interval temporal logics: the case of propositional neighborhood logic
Logic Programs, Norms and Action
A survey on temporal logics for specifying and verifying real-time systems
Frontiers of Computer Science: Selected Publications from Chinese Universities
An epistemic Halpern-Shoham logic
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
The Halpern-Shoham logic is a modal logic of time intervals. Some effort has been put in last ten years to classify fragments of this beautiful logic with respect to decidability of its satisfiability problem. We complete this classification by showing - what we believe is quite an unexpected result - that the logic of subintervals, the fragment of the Halpern -- Shoham logic where only the operator ``during'', or D, is allowed, is undecidable over discrete structures. This is surprising as this, apparently very simple, logic is decidable over dense orders and its reflexive variant is known to be decidable over discrete structures. Our result subsumes a lot of previous negative results for the discrete case, like the undecidability for ABE, BD, ADB, and so on [2], [5].