Temporal connectives versus explicit timestamps to query temporal databases

DOI10.1006/jcss.1998.1598zbMath0943.68052OpenAlexW1964306497MaRDI QIDQ1305921

Laurent Herr, Jan Van den Bussche, Serge Abiteboul

Publication date: 17 February 2000

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/b2ddc282304d3d4dd38ab601f0dca57c4957c5a3

zbMATH Keywords

temporal databasesquery languages

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (2)

Verification of relational transducers for electronic commerce ⋮ First-order expressivity for S5-models: Modal vs. two-sorted languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fundamental properties of deterministic and nondeterministic extensions of Datalog
• Computing with first-order logic
• Temporal logic can be more expressive
• To the memory of Arthur Prior Formal properties of ‘now’

This page was built for publication: Temporal connectives versus explicit timestamps to query temporal databases