The complexity of propositional linear temporal logics
Journal of the ACM (JACM)
Handbook of theoretical computer science (vol. B)
The Declarative Past and Imperative Future: Executable Temporal Logic for Interactive Systems
Temporal Logic in Specification
First-order logic with two variables and unary temporal logic
Information and Computation - Special issue: LICS'97
Finite state machines for strings over infinite alphabets
ACM Transactions on Computational Logic (TOCL)
Two-Variable Logic on Words with Data
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
LTL with the Freeze Quantifier and Register Automata
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
On the freeze quantifier in Constraint LTL: Decidability and complexity
Information and Computation
On the constant-depth complexity of k-clique
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
LTL with the freeze quantifier and register automata
ACM Transactions on Computational Logic (TOCL)
Branching-Time Logics Repeatedly Referring to States
Journal of Logic, Language and Information
Bounded-variable fragments of hybrid logics
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
| Hi-index | 0.01 |
Hybrid temporal logic (HTL) on data words can be considered as an extension of the logic LTL^@7 introduced by Demri and Lazic [Stephane Demri and Ranko Lazic. LTL with the freeze quantifier and register automata. In LICS@?06: Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science, pages 17-26, Washington, DC, USA, 2006. IEEE Computer Society]. The paper compares the expressive power of HTL on data words with that of LTL^@7. It is shown that there are properties of data words that can be expressed in HTL with two variables but not in LTL^@7. On the other hand, every property that can be expressed in HTL with one variable can also be expressed in LTL^@7 with one variable. The paper further studies the succinctness of HTL in comparison with LTL^@7 and shows that the number-of-variables hierarchy of HTL is infinite.