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.
In: Electronic Notes in Theoretical Computer Science, Vol. 273, No. 1, 2011, p. 3-19.Publication: Research - peer-review › Conference article – Annual report year: 2011
Harvard
APA
CBE
MLA
Vancouver
Author
Bibtex
}
RIS
TY - CONF
T1 - Hybrid Metric Propositional Neighborhood Logics with Interval Length Binders
A1 - Della Monica,Dario
A1 - Goranko,Valentin
A1 - Sciavicco,Guido
AU - Della Monica,Dario
AU - Goranko,Valentin
AU - Sciavicco,Guido
PB - Elsevier BV
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.
UR - http://hylocore.ruc.dk/HyLo2010.html
U2 - 10.1016/j.entcs.2011.06.009
DO - 10.1016/j.entcs.2011.06.009
JO - Electronic Notes in Theoretical Computer Science
JF - Electronic Notes in Theoretical Computer Science
SN - 1571-0661
IS - 1
VL - 273
SP - 3
EP - 19
ER -