Expressiveness of Hybrid Temporal Logic on Data Words

DOI10.1016/j.entcs.2011.10.010zbMath1347.03033OpenAlexW2059540619WikidataQ113318196 ScholiaQ113318196MaRDI QIDQ2825412

Thomas Schwentick, Ahmet Kara

Publication date: 7 October 2016

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2011.10.010

zbMATH Keywords

temporal logicsdata wordshybrid logics

Mathematics Subject Classification ID

Logic in computer science (03B70) Temporal logic (03B44)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the freeze quantifier in Constraint LTL: Decidability and complexity
• Branching-time logics repeatedly referring to states
• First-order logic with two variables and unary temporal logic
• LTL with the freeze quantifier and register automata
• Two-variable logic on data words
• Bounded-Variable Fragments of Hybrid Logics
• The complexity of propositional linear temporal logics
• The computational complexity of hybrid temporal logics
• Finite state machines for strings over infinite alphabets

This page was built for publication: Expressiveness of Hybrid Temporal Logic on Data Words