Abstract
The article investigates the expressive power of implicit temporal query languages. These languages are designed while assuming temporal data modelled as sequences of data. So far, two styles of implicit temporal query languages are known: t-while like languages are based on a temporal extension of while with left and right moves; μtl like languages are a fixpoint extension of tl. This article focusses on comparing the expressive power of t-while style languages and μtl languages and provides complementary results with respect to Abiteboul et al. (1999, J. Comput. System Sci.,58, 54–68). The main contribution is the proof of the equivalence of the three following temporal languages: the non-inflationary variant of μtl, the language t-while and more surprisingly the language t-fixpoint.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
