Metric Propositional Neighborhood Logic with an Equivalence Relation

The propositional interval logic of temporal neighborhood (PNL for short) features two modalities that make it possible to access intervals adjacent to the right (modality xAy) and to the left (modality xAy) of the current interval. PNL stands at a central position in the realm of interval temporal logics, as it is expressive enough to encode meaningful temporal conditions and decidable (undecidability rules over interval temporal logics, while PNL is NEXPTIME-complete). Moreover, it is expressively complete with respect to FO2|<;|. Various extensions of PNL have been studied in the literature, including metric, hybrid, and first-order ones. Here, we study the effects of the addition of an equivalence relation ~ to Metric PNL (MPNL~). We first show that finite satisfiability for PNL extended with ~ is still NEXPTIME-complete. Then, we prove that finite satisfiability for MPNL~ can be reduced to the decidable 0-0 reach ability problem for vector addition systems and vice versa (EXPSPACE-hardness immediately follows).