We investigate the question of how much hybrid machinery can be added to the interval neighbourhood logic PNL and its metric extension MPNL without losing the decidability of their satisfiability problem in N. In particular, we consider the natural hybrid extension of MPNL obtained by adding binders on integer variables ranging over lengths of intervals, thus enabling storage of the length of the current interval undecidable, which is somewhat surprising, being in contrast with the decidability of MPNL, which can be seen as a hybrid language with length constraints only involving constants over interval lengths. These results show that MPNL itself is, in this sense, a maximal decidable (weakly) hybrid extension of PNL. © 2011 Elsevier B.V. All rights reserved.
|Journal||Electronic Notes in Theoretical Computer Science|
|Publication status||Published - 2011|
|Event||International Workshop on Hybrid Logic and Applications - Edinburgh, United Kingdom|
Duration: 10 Jul 2010 → …
|Workshop||International Workshop on Hybrid Logic and Applications|
|Period||10/07/2010 → …|