Computation tree logic CTL* and path quantifiers in the monadic theory of the binary tree
14th International Colloquium on Automata, languages and programming
Handbook of theoretical computer science (vol. B)
On completeness of historical relational query languages
ACM Transactions on Database Systems (TODS)
A hierarchy of temporal logics with past
STACS '94 Selected papers of the eleventh symposium on Theoretical aspects of computer science
Temporal versus first-order logic to query temporal databases
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Temporal logic in information systems
Logics for databases and information systems
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
On the temporal analysis of fairness
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
First-Order Queries over Temporal Databases Inexpressible in Temporal Logic
EDBT '96 Proceedings of the 5th International Conference on Extending Database Technology: Advances in Database Technology
Temporal Query Languages: A Survey
ICTL '94 Proceedings of the First International Conference on Temporal Logic
Temporal Connectives versus Explicit Timestamps in Temporal Query Languages
Proceedings of the International Workshop on Temporal Databases: Recent Advances in Temporal Databases
| Hi-index | 0.01 |
In the propositional case, it is known that temporal logic (TL) and first order logic with timestamp(TS-FO) have the same expressive power. Recent work has proved that, in contrast, there are first order logic queries on timestampda tabases that are not expressible in first order temporal logic: TL is not complete. Specifying a complete implicit temporal query language remains an open problem. We investigate two extensions of TL, namely NTL and RNTL. A strict hierarchy in expressive power among fragments RNTLi of RNTL is established. On the one hand, it leads to the conjecture that RNTL is complete. On the other hand, it provides a new promising perspective towards proving the well-known conjecture that there is a strict hierarchy among the i time-variable fragments TS-FOi of TS-FO.