Complexity and succinctness issues for linear-time hybrid logics

Laura Bozzelli, Ruggero Lanotte. Complexity and succinctness issues for linear-time hybrid logics. Theoretical Computer Science, 411(2):454-469, 2010. [doi]

Abstract

Abstract is missing.