Computer Science – Logic in Computer Science
Scientific paper
2010-10-21
Computer Science
Logic in Computer Science
Scientific paper
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 contribute to this effort by showing - what we believe is quite an unexpected result - that the logic of subintervals, the fragment of the Halpern-Shoham where only the operator "during", or D, is allowed, is undecidable over discrete structures. This is surprising as this logic is decidable over dense orders and its reflexive variant is known to be decidable over discrete structures.
Marcinkowski Jerzy
Michaliszyn Jakub
No associations
LandOfFree
The Last Paper on the Halpern-Shoham Interval Temporal Logic does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The Last Paper on the Halpern-Shoham Interval Temporal Logic, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Last Paper on the Halpern-Shoham Interval Temporal Logic will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-424000