Hybrid Metric Propositional Neighborhood Logics with Interval Length Binders

Dario Della Monica, Valentin Goranko, Guido Sciavicco

    Research output: Contribution to journalConference articleResearchpeer-review


    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.
    Original languageEnglish
    JournalElectronic Notes in Theoretical Computer Science
    Issue number1
    Pages (from-to)3-19
    Publication statusPublished - 2011
    EventInternational Workshop on Hybrid Logic and Applications - Edinburgh, United Kingdom
    Duration: 10 Jul 2010 → …


    WorkshopInternational Workshop on Hybrid Logic and Applications
    CountryUnited Kingdom
    Period10/07/2010 → …
    Internet address

    Fingerprint Dive into the research topics of 'Hybrid Metric Propositional Neighborhood Logics with Interval Length Binders'. Together they form a unique fingerprint.

    Cite this