Article

Free access

Temporal versus first-order logic to query temporal databases

Authors:

Serge Abiteboul,

Laurent Herr,

Jan Van den BusscheAuthors Info & Claims

PODS '96: Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems

Pages 49 - 57

https://doi.org/10.1145/237661.237674

Published: 03 June 1996 Publication History

PDF eReader

References

[1]

S. Abiteboul, R. Hull and V. Vianu, Foundations of Databases, Addison-Wesley, Reading- Massachusetts. 1994.

Digital Library

Google Scholar

[2]

S. Abiteboul, L. Herr, and J. Van den Bussche. Temporal connectives versus explicit timestamps in temporal query languages. In J. Clifford and A. Tuzhilin, editors, Recent Advances in Temporal Databases, Workshops in Computing, pages 43-57. Springer-Verlag, 1995.

Digital Library

Google Scholar

[3]

J. Chomicki. Temporal query languages: a survey. In D.M. Gabbay and H.J. Ohlbach, editors, Temporal Logic: ICTL '9#, volume 827 of Lecture Notes in Computer Science, pages 506-534. Springer-Verlag, 1994.

Digital Library

Google Scholar

[4]

E.A. Emerson. Temporal and modal logic. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B. Elsevier, 1990.

Digital Library

Google Scholar

[5]

D. Gabbay. The declarative past and the imperative future: Executable temporal logic for interactive systems. In B. Banieqbal, B. Barringer, and A. Pnueli, editors, Temporal Logic in Specification, volume 398 of Lecture Notes in Computer Science, pages 409-448. Springer-Verlag, 1989.

Digital Library

Google Scholar

[6]

D. Gabbay and P. McBrien. Temporal logic and historical databases. In Proceedings 17th International Conference on Very Large Databases, pages 423-430, 1991.

Digital Library

Google Scholar

[7]

D.M. Gabbay, I. Hodkinson, and M. Reynolds. Temporal Logic, Mathematical Foundations and Computational Aspects, volume 1 of Oxford Logic Guides.

Digital Library

Google Scholar

[8]

D. Perrin. Finite automata. In j. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B. Elsevier, 1990. Oxford University Press, 1994.

Google Scholar

[9]

H. Kamp. Formal properties of'now'. Theoria, 37:227-273, 1971.

Crossref

Google Scholar

[10]

J.A.W. Kamp. Tense Logic and the Theory of Linear Order. PhD thesis, University of California, Los Angeles, 1968.

Google Scholar

[11]

C.H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.

Google Scholar

[12]

L. Segoufin. Temporal logic and games. INRIA, VERSO, 1995.

Google Scholar

[13]

D. Toman and D. Niwinski. First-order queries over temporal databases inexpressible in temporal logic. Dept. of Com p. and Info. Science, Kansas State University, 1995. To appear in Proceedings 5th international Conference on Extending Database Technology, Avignon, France, March 1996.

Digital Library

Google Scholar

[14]

A. Tuzhilin and J. Clifford. A temporal relational algebra as a basis for temporal relational completeness. In D. McLeod, R. Sacks- Davis, and H. Schek, editors, Proceedings of the 16th International Conference on Very Large Data Bases, pages 13-23. Morgan Kaufmann, 1990.

Digital Library

Google Scholar

[15]

P. Wolper. Temporal logic can be more expressive. Information and Control, 56:72- 93, 1983.

Crossref

Google Scholar

[16]

A. C.-C. Yao. Some complexity questions related to distributive computing. In Proceedings 11th A CM Symposium on the Theory of Computing, pages 294-300, 1979.

Digital Library

Google Scholar

Cited By

View all

Rybakov MShkatov D(2021)Undecidability of QLTL and QCTL with two variables and one monadic predicate letterLogical Investigations10.21146/2074-1472-2021-27-2-93-12027:2(93-120)Online publication date: 19-Dec-2021
https://doi.org/10.21146/2074-1472-2021-27-2-93-120
Chomicki JToman D(2018)Temporal Logic in Database Query LanguagesEncyclopedia of Database Systems10.1007/978-1-4614-8265-9_402(3992-3998)Online publication date: 7-Dec-2018
https://doi.org/10.1007/978-1-4614-8265-9_402
Toman D(2018)Point-Stamped Temporal ModelsEncyclopedia of Database Systems10.1007/978-1-4614-8265-9_269(2770-2775)Online publication date: 7-Dec-2018
https://doi.org/10.1007/978-1-4614-8265-9_269
Show More Cited By

Index Terms

Temporal versus first-order logic to query temporal databases
1. Information systems
  1. Data management systems
    1. Database management system engines
      1. Database query processing
2. Theory of computation

Recommendations

First-Order Temporal Verification in Practice

First-order temporal logic, the extension of first-order logic with operators dealing with time, is a powerful and expressive formalism with many potential applications. This expressive logic can be viewed as a framework in which to investigate problems ...
Temporal Connectives versus Explicit Timestamps to Query Temporal Databases

Temporal databases can be queried either by query languages working directly on a timestamp representation or by languages using an implicit access to time via temporal connectives. We study the differences in expressive power between these two ...
Constructive linear-time temporal logic: Proof systems and Kripke semantics

In this paper we study a version of constructive linear-time temporal logic (LTL) with the ''next'' temporal operator. The logic is originally due to Davies, who has shown that the proof system of the logic corresponds to a type system for binding-time ...

Comments

Information & Contributors

Information

Published In

PODS '96: Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems

June 1996

249 pages

ISBN:0897917812

DOI:10.1145/237661

Chairman:
Richard Hull
Univ. of Colorado

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 03 June 1996

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SIGMOD/PODS96

Sponsor:

SIGMOD/PODS96: Joint ACM SIGMOD International Conference on Management of Data and ACM Symposium on Principles of Database Systems

June 4 - 6, 1996

Quebec, Montreal, Canada

Acceptance Rates

PODS '96 Paper Acceptance Rate 22 of 84 submissions, 26%;

Overall Acceptance Rate 642 of 2,707 submissions, 24%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

38
Total Citations
View Citations
639
Total Downloads

Downloads (Last 12 months)61
Downloads (Last 6 weeks)17

Reflects downloads up to 13 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Rybakov MShkatov D(2021)Undecidability of QLTL and QCTL with two variables and one monadic predicate letterLogical Investigations10.21146/2074-1472-2021-27-2-93-12027:2(93-120)Online publication date: 19-Dec-2021
https://doi.org/10.21146/2074-1472-2021-27-2-93-120
Chomicki JToman D(2018)Temporal Logic in Database Query LanguagesEncyclopedia of Database Systems10.1007/978-1-4614-8265-9_402(3992-3998)Online publication date: 7-Dec-2018
https://doi.org/10.1007/978-1-4614-8265-9_402
Toman D(2018)Point-Stamped Temporal ModelsEncyclopedia of Database Systems10.1007/978-1-4614-8265-9_269(2770-2775)Online publication date: 7-Dec-2018
https://doi.org/10.1007/978-1-4614-8265-9_269
Böhlen MJensen CSnodgrass R(2018)Nonsequenced SemanticsEncyclopedia of Database Systems10.1007/978-1-4614-8265-9_1052(2506-2507)Online publication date: 7-Dec-2018
https://doi.org/10.1007/978-1-4614-8265-9_1052
Chomicki JToman D(2017)Temporal Logic in Database Query LanguagesEncyclopedia of Database Systems10.1007/978-1-4899-7993-3_402-2(1-6)Online publication date: 13-Jan-2017
https://doi.org/10.1007/978-1-4899-7993-3_402-2
Toman D(2017)Point-Stamped Temporal ModelsEncyclopedia of Database Systems10.1007/978-1-4899-7993-3_269-2(1-6)Online publication date: 22-Mar-2017
https://doi.org/10.1007/978-1-4899-7993-3_269-2
Dignös ABöhlen MGamper JJensen C(2016)Extending the Kernel of a Relational DBMS with Comprehensive Support for Sequenced Temporal QueriesACM Transactions on Database Systems10.1145/296760841:4(1-46)Online publication date: 2-Nov-2016
https://dl.acm.org/doi/10.1145/2967608
Böhlen MJensen CSnodgrass R(2016)Nonsequenced SemanticsEncyclopedia of Database Systems10.1007/978-1-4899-7993-3_1052-2(1-3)Online publication date: 5-Dec-2016
https://doi.org/10.1007/978-1-4899-7993-3_1052-2
Calvanese DDe Giacomo GMontali MHull RFan W(2013)Foundations of data-aware process analysisProceedings of the 32nd ACM SIGMOD-SIGACT-SIGAI symposium on Principles of database systems10.1145/2463664.2467796(1-12)Online publication date: 22-Jun-2013
https://dl.acm.org/doi/10.1145/2463664.2467796
Damaggio EDeutsch AVianu V(2012)Artifact systems with data dependencies and arithmeticACM Transactions on Database Systems10.1145/2338626.233862837:3(1-36)Online publication date: 6-Sep-2012
https://dl.acm.org/doi/10.1145/2338626.2338628
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

First-Order Temporal Verification in Practice

Temporal Connectives versus Explicit Timestamps to Query Temporal Databases

Constructive linear-time temporal logic: Proof systems and Kripke semantics

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

First-Order Temporal Verification in Practice

Temporal Connectives versus Explicit Timestamps to Query Temporal Databases

Constructive linear-time temporal logic: Proof systems and Kripke semantics

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations