Affordable Access

Undecidability of the Logic of Overlap Relation over Discrete Linear Orderings

Publication Date
Online Research Database In Technology
  • Interval Temporal Logics, Overlap Relation, Undecidability, Octant Tiling Problem
External links


The validity/satisfiability problem for most propositional interval temporal logics is (highly) undecidable, under very weak assumptions on the class of interval structures in which they are interpreted. That, in particular, holds for most fragments of Halpern and Shoham’s interval modal logic HS. Still, decidability is the rule for the fragments of HS with only one modal operator, based on an Allen’s relation. In this paper, we show that the logic O of the Overlap relation, when interpreted over discrete linear orderings, is an exception. The proof is based on a reduction from the undecidable octant tiling problem. This is one of the sharpest undecidability result for fragments of HS.

There are no comments yet on this publication. Be the first to share your thoughts.


Seen <100 times