We investigate the complexity of the model checking problem for hybrid logics. We provide model checking algorithms for various hybrid fragments and we prove PSPACE-completeness for hybrid fragments including binders. We complement and motivate our complexity results with an application of model checking in hybrid logic to the problems of query and constraint evaluation for semistructured data.
Model checking for hybrid logics (with an application to semistructured data)
FRANCESCHET, Massimo;
2006-01-01
Abstract
We investigate the complexity of the model checking problem for hybrid logics. We provide model checking algorithms for various hybrid fragments and we prove PSPACE-completeness for hybrid fragments including binders. We complement and motivate our complexity results with an application of model checking in hybrid logic to the problems of query and constraint evaluation for semistructured data.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
