Database Paper Browser

Back to papers

Temporal versus First-Order Logic to Query Temporal Databases

Summary: Shows that for temporal databases modeled via timestamped relations, first-order logic on the timestamp representation strictly subsumes (extended) temporal logic in the predicate/relational case, unlike the propositional setting. Novel proof via a communication-complexity argument constructing FO queries on timestamps that are not definable in temporal logic. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1076
Venue
PODS
Year
1996
Pagerank
8.1634739e-05
Overall Rank
2,760 | 80.81%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Rank Citing Paper Year Venue Pagerank
1,875 Verification of Communicating Data-Driven Web Services 2006 PODS 0.00010243508
1,928 Foundations of Data-Aware Process Analysis: A Database Theory Perspective 2013 PODS 0.00010061483
3,494 Specification and Verification of Data-driven Web Services 2004 PODS 7.040662e-05
6,830 Temporal Alignment 2012 SIGMOD 4.9136035e-05
8,833 Verification of Relational Transducers for Electronic Commerce 2000 PODS 4.439447e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
1,583 Temporal Logic & Historical Databases 1991 VLDB 0.00011259345
1,996 A Temporal Relational Algebra as a Basis for Temporal Relational Completeness 1990 VLDB 9.8377097e-05
Previous Page 1 / 1 Next

Semantically Similar Papers