Introducing Time into RDF
Abstract
The resource description framework (RDF) is a metadata model and language recommended by the W3C. This paper presents a framework to incorporate temporal reasoning into RDF, yielding temporal RDF graphs. We present a semantics for these kinds of graphs which includes the notion of temporal entailment and a syntax to incorporate this framework into standard RDF graphs, using the RDF vocabulary plus temporal labels. We give a characterization of temporal entailment in terms of RDF entailment and show that the former does not yield extra asymptotic complexity with respect to nontemporal RDF graphs. We also discuss temporal RDF graphs with anonymous timestamps, providing a theoretical framework for the study of temporal anonymity. Finally, we sketch a temporal query language for RDF, along with complexity results for query evaluation that show that the time dimension preserves the tractability of answers
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Cited by
Sorted by citations
Elsaleh, T., Enshaeifar, S., Rezvani, R., Acton, S. T., Janeiko, V., & Bermudez-Edo, M. (2020) · Sensors · doi:10.3390/s20040953 · Cited by 96 · see citing works
- Authors
- Gutierrez, C., Hurtado, C., & Vaisman, A.
- Affiliations
- University of Chile (CL)
- ORCID
- Vaisman, Alejandro
- Venue
- IEEE Transactions on Knowledge and Data Engineering
- Published
- 2007-02
- Volume
- 19
- Issue
- 2
- Pages
- 207-218
- ISSN
- 1041-4347 (ISSN-L)
- OpenAlex
- W2142738471
- Cited by
- 279
- References
- 0
- Citations by year
- 2026: 5 · 2025: 2 · 2024: 4 · 2023: 8 · 2022: 11 · 2021: 18 · 2020: 16 · 2019: 16 · 2018: 19 · 2017: 11 · 2016: 22 · 2015: 28 · 2014: 14 · 2013: 24 · 2012: 23
- FWCI
- 12.67
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- IEEE Transactions on Knowledge and Data Engineering (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Semantic Web and Ontologies
- Physical Sciences › Computer Science › Artificial Intelligence › Logic, Reasoning, and Knowledge
- Physical Sciences › Computer Science › Information Systems › Library Science and Information Systems
- Keywords
- RDF, temporal reasoning, temporal query languages, query evaluation complexity, computational complexity
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
