Skip Navigation


Journal of Logic and Computation Advance Access originally published online on October 20, 2008
Journal of Logic and Computation 2009 19(2):369-404; doi:10.1093/logcom/exn056
This Article
Right arrow Abstract Freely available
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Bidoit, N.
Right arrow Articles by Objois, M.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author, 2008. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

Original Articles

Fixpoint and While Temporal Query Languages

Nicole Bidoit and Matthieu Objois

Univ. Paris-Sud, UMR 8623 and CNRS, Orsay F-91405, France.

E-mail: nicole.bidoit{at}lri.fr

Received 3 October 2007.

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.

Keywords: Database; temporal databases; temporal logic; query language; fixpoint query; while query



References

  1. Abiteboul S, Herr L, van den Bussche J. Temporal connectives versus explicit timestamps to query temporal databases. Journal of Computer and System Science (1999) 58:54–68.[CrossRef]
  2. Abiteboul S, Hull R, Vianu V. Foundations ofDatabases (1995) Reading, MA: Addison-Wesley.
  3. Abiteboul S, Vianu V. Datalog extensions for databases queries and updates. Journal of Computer and System Science (1991) 43:62–124.[CrossRef]
  4. Abiteboul S, Vianu V. Generic computation and its complexity. In: Proceedings of the 23rd Symposium on the Theory of Computing—Koutsougeras Cris, Vitter Jeff, eds. (1991) New York, NY: ACM. 209–219.
  5. Abiteboul S, Vianu V. Computing with first-order logic. Journal of Computer and System Science (1995) 50:309–335.[CrossRef]
  6. Banieqbal B, Barringer H. Temporal logic with fixed points. In: Temporal Logic in Specification—Banieqbal Behnam, Barringer Howard, Pnueli Amir, eds. (1987) London, UK: Springer-Verlag. 62–74.
  7. Bidoit N, De Amo S. Implicit temporal query languages: towards completeness. In: Proceedings of the 19th conference on Foundations of Software Technology and Theoretical Computer Science—Pandu Rangan C, Raman Venkatesh, Ramanujam Ramaswamy, eds. (1999) London, UK: Springer-Verlag. 245–257. (FSTTCS 1999), LNCS Series.
  8. Bidoit N, De Amo S, Segoufin L. Order independant temporal properties. Journal of Logic and Computation (2004) 14:277–298.[Abstract/Free Full Text]
  9. Bidoit N, Hantry Fr. Relational temporal machines. In: Proceedings of the International Symposium on Temporal Representation and Reasoning (TIME 2007) (2007) Washington, MA: IEEE Computer Society. 23–34.
  10. Bidoit N, Objois M. Temporal query languages expressive power: µTL versus T-WHILE. In: Proceedings of the International Symposium on Temporal Representation and Reasoning (TIME 2007) (2005) Washington, MA: IEEE Computer Society. 74–82.
  11. Chandra AK, Harel D. Structure and complexity of relational queries. Journal of Computer and System Science (1982) 25:99–128.[CrossRef]
  12. Chomicki J, Toman D. Temporal logic in information systems. In: Logic for Databases and Information Systems (1998) Norwell, MA: Kluwer Academic Publisher. 31–70.
  13. Emerson EA. Temporal and modal logic. In: Handbook of Theoretical Computer Science: formal models and semantics Vol. B (1990) Cambridge, MA: MIT Press. 995–1072.
  14. Gurevich Y. Toward a logic tailored for computational complexity. In: Computation and Proof Theory (1984) Berlin/Heidelberg: Springer Verlag. 175–216.
  15. Gurevich Y, Shelah S. Fixed-point extensions of first-order logic. Annals of Pure and Applied Logic (1986) 32:265–280.[CrossRef][Web of Science]
  16. Herr L. Langages de Requête pour les Bases de Données Temporelles (1997) Orsay, France: Université Paris-Sud 11. PhD Thesis.
  17. Kozen D. Results on the propositional µ-calculus. Theoretical Computer Science (1983) 27:333–354.[CrossRef][Web of Science]
  18. Leivant D. Inductive definitions over finite structures. Information and Computation (1990) 89:95–108.[CrossRef][Web of Science]
  19. Manna Z, Pnueli A. The Temporal Logic of Reactive and Concurrent Systems: Specification. (1991) New York: Springer-Verlag.
  20. Moschovakis YN. Elementary Induction on Abstract Structures (1974) New York, NY: American Elsevier Pub. Co.
  21. Prior A. Time and modality. In: John Locke Lectures for 1955–56 (1957) Oxford, UK: Oxford University Press.
  22. Sernadas A. Temporal aspects of logical procedure definition. Information Systems (1980) 5:167–197.[CrossRef][Web of Science]
  23. Toman D. On incompleteness of multi-dimensional first-order temporal logics. In: Proceedings of the 10th International Symposium on Temporal Representation and Reasoning (TIME 2003) (2003) Washington, MA: IEEE Computer Society. 99–106.
  24. Vardi M. A temporal fixpoint calculus. In: Proceedings of the 15th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages—Ferrante Jeanne, Mager P, eds. (1988) New York: ACM. 250–259.
  25. Wolper P. Temporal logic can be more expressive. Information and Control (1983) 56:72–99.[CrossRef][Web of Science]

Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?



This Article
Right arrow Abstract Freely available
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Bidoit, N.
Right arrow Articles by Objois, M.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?