## Hybrid Metric Propositional Neighborhood Logics with Interval Length Binders

Publication: Research - peer-review › Conference article – Annual report year: 2011

### Standard

**Hybrid Metric Propositional Neighborhood Logics with Interval Length Binders.** / Della Monica, Dario; Goranko, Valentin; Sciavicco, Guido.

Publication: Research - peer-review › Conference article – Annual report year: 2011

### Harvard

*Electronic Notes in Theoretical Computer Science*, vol 273, no. 1, pp. 3-19. DOI: 10.1016/j.entcs.2011.06.009

### APA

*Hybrid Metric Propositional Neighborhood Logics with Interval Length Binders*.

*Electronic Notes in Theoretical Computer Science*,

*273*(1), 3-19. DOI: 10.1016/j.entcs.2011.06.009

### CBE

### MLA

*Electronic Notes in Theoretical Computer Science*. 2011, 273(1). 3-19. Available: 10.1016/j.entcs.2011.06.009

### Vancouver

### Author

### Bibtex

}

### RIS

TY - CONF

T1 - Hybrid Metric Propositional Neighborhood Logics with Interval Length Binders

AU - Della Monica,Dario

AU - Goranko,Valentin

AU - Sciavicco,Guido

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

U2 - 10.1016/j.entcs.2011.06.009

DO - 10.1016/j.entcs.2011.06.009

M3 - Conference article

VL - 273

SP - 3

EP - 19

JO - Electronic Notes in Theoretical Computer Science

T2 - Electronic Notes in Theoretical Computer Science

JF - Electronic Notes in Theoretical Computer Science

SN - 1571-0661

IS - 1

ER -