Valid Time RDF

Log

  • t.2024.04.01.11: re-reading this on the plane, I'm amazed how much more helpful and concrete this seems now.
  • t.2024.07.24.13 as much as I want it, I'm concerned that valid time is not existence time.
    • at the very least, it shouldn't mean birth-death
      • what if John comes back from the dead?
    • in an immutable data store, valid time needs to be reserved for "this fact was considered valid", from interpretation of "database"
    • doesn't make sense to apply vt to (some) resources, because they are eternal
    • if we use relators, same thing
    • singleton predicates, maybe
    • classic predicates/properties might be interesting... valid time properties
    • you still need a way to refer to resources/entities at a given time, but probably an instant not an interval.

Highlights

  • proposals of temporal extensions to RDF reported in the literatures mostly use RDF reification explicitly or implicitly

Implicit Reification Based Temporal Model

implicit reification based models use different types of abstraction for handling reification. They do not employ reification vocabularies of RDF specifications. Two subcategories follow.

Instantiating-Identifying Concept/Relationship (IIR)

In IIR models, a concept or relationship is reified and further temporalized. Either such relationship is abstracted as a new object, or a concept is viewed as four dimensional and instantiated to have temporal extents. Singleton Property converts each relationship to be universally unique. 4D fluents use concepts that view each resource as a perdurant. Fluents represent properties that change over time

Singleton Property

The formal semantics of the singleton property is derived from the standard RDF and RDFS semantics with the additional semantics extension for the vocabulary rdf:singletonPropertyOf. The singleton property gives rises to three cases of query patterns: data, metadata and mixed patterns which SPARQL supports.

4D Fluents

  • Perdurantism is a philosophical theory of persistence and identity [34], and it is closely related to four dimensionalism. In the four dimensional view, an object that persists through time has distinct temporal parts at every time instant through its existence in time. Furthermore, each persisting object can be considered a four dimensional spacetime worm that stretches across space-time. Slicing the worm at a specific time interval or instant of the time dimension yields a temporal part.
    • t.2024.03.21.08: and endurant

  • "Fluent is a component of Situational Calculus which is a logical language for representing change. [46, 48]. It concerns situations, actions and fluents in a dynamic domain. Actions make the domain change from one situation to another. Fluents are situation-dependent functions for describing the effects of actions. In 4D Fluents model, fluents are properties that change over time [73]. These properties are special cases in that both the domain and range of them are temporal parts of the corresponding entities. "

  • In 4D Fluents model, fluents are properties that change over time [73]. These properties are special cases in that both the domain and range of them are temporal parts of the corresponding entities. TemporalPart is the main class for converting regular entities to 4D spacetime worm ones. OWL-Time ontology of [37] is used as time domain in 4D Fluents model. Particularly, a class TimeInterval derived from the equivalent class of OWL-Time is used for all temporal terms.
  • In Figure 3.5, individuals :John and :SW are two 4D entities. Each entity has temporal parts, :John@i1 and :SW@i1 respectively. The property :enrolled is transformed to a fluent whose domain and range are both temporal parts. Each temporal part is associated with a specific temporal extent , i.e., time interval, that denotes its valid time. One fluent property requires two extra ob- jects, i.e., temporal parts, and two properties, in contrast to reification, that uses one extra object and four properties as illustrated in Figure 2.10.
Advantages
  • "OWL inverse operator and cardinality constraints are available and standard OWL reasoners can be used for inferencing."
  • The 4D Fluents model is within standard RDF and OWL-DL.
  • The running example query can be written in SPARQL 4D Fluents model:
SELECT ?ti ?tf
WHERE {?ts1 :temporalPartOf :John.
?ts2 :temporalPartOf :SW.
?ts1 :enrolled ?ts2.
?ts1 :temporalExt ?i.
?ts2 :temporalExt ?i.
?i :hasBeginning ?ti.
?i :hasEnd ?tf.
}
  • Since the 4D Fluents model imports OWL-Time [37], :i1 in Figure 3.5 is an OWL-Time interval, while ?ti and ?tf in the above query are two OWL-Time instants.

Extended 4D Fluents

  • Batsakis et al. extended 4D Fluents model to incorporate qualitative temporal relations that have unknown temporal information... Semantics of the extended 4D Fluents model is based on the original 4D Fluents model, with the additional temporal semantics needed for qualitative temporal relations.

  • TOQL [5] is the SQL-like query language for Extended 4D Fluents model. To accommodate querying qualitative temporal relations, additionally query constructs, such as ”AT” clause and Allen temporal operators [4], such as before, after, meets, etc., are included in TOQL.

Temporal Web Ontology Language

  • Fransincar et al. proposed an extension of the OWL-DL language, called tOWL [49], for representing time and changes in an ontology. tOWL uses a subset of OWL-DL whose foundation is the logic SHIN (D). This logic is sufficiently expressive and is decidable for a sound and complete reasoning algorithm [45]. The time domain of tOWL handles both instants and intervals that are modeled by rational numbers and a set of partial order relations over them. As a result, an actual time instant, an interval or Allen’s temporal relations [4] are all converted to rational number-based equivalent instants or relations.
  • For modeling changing values, tOWL employs the 4D Fluents model, i.e., perdurantist’s view [73]. tOWL is conceptualized as a layered approach. The foundation layer is OWL-DL and the extended concrete domain is the second layer. Time representation is at the third layer, which is defined by the concrete domain.
  • Figure 3.7 gives the running example in tOWL. Note that tOWL requires separate intervals for :John and :SW. Therefore, a restriction on the equivalence of towl:interval1 and towl:interval2 is enforced by a relation towl:equal in Figure 3.7 which is one more triple used compared to 4D Fluents model in [73].
  • In tOWL, the time domain is based on rational numbers and relations over them. This approach makes tOWL more expressive in representing complex temporal relations. For instance, in Figure 3.7, a temporal constraint towl:interval1 equates towl:interval2 can be expressed with the equality of endpoints of the two intervals.
  • OWL reduces the proliferation of objects by differentiating types of fluents as FluentObjectProperty and FluentDatatypeProperty. For a Fluent- DatatypeProperty, which relates a time slice to a typed value, three triples can be saved due to that the time slice is not needed for a typed value.

Relationship to Entity Conversion (REC)

In REC models, a relationship is transformed to a composite entity. The transformed entity comes in two forms: a new entity that implicitly reifies the original triple, or an abstract object that becomes a term for further use. As an example of REC models, N-ary relations provide a main modeling concept: a triple is objectified as a new entity and can further be associated to properties, such as time.

N-ary relations

In principle, the N-ary relation is a generalization of reification. For each N-ary relation, a new class with an instance is introduced for it as if the relation is objectified. Further property assertions can be made with respect to the newly introduced instance. Figure 3.8 gives the running example in N-ary relations.

The resource :enrolled1 in Figure 3.8 is introduced as a new instance encapsulating both the course name value, SW, and its valid time interval through two properties, :hasCourse and :hasVT. The relation (:John, :enrolled, :SW) is converted to an entity class :Enrollment. The property :enrolled is overloaded, so its range becomes the newly introduced class :Enrollment. Adding time to the original triple, i.e., (John, enrolled, SW), requires three more triples.

N-ary relation approach does not require extension to RDF, RDFS or OWL vocabularies. It simply converts relationships to entities that encapsulate properties. The semantics for N-ary relation approach is based on RDF and RDFS semantics. In Figure 3.8, the new object :enrolled1 may also be represented by a blank node. A blank node does not have any meaning, but acts like a wrapper for grouping related objects.

SELECT ?ti ?tf
WHERE {
:John :enrolled ?e.
?e rdf:type :Enrollment.
?e :hasCourse :SW.
?e :hasVT ?i.
?i :hasBeginning ?ti.
?i :hasFinish ?tf.
}

While N-ary relation approach can be applied to OWL, it would incur overheads. For instance, multiple inverse properties are needed for a N-ary relation. Moreover, the use of cardinality restrictions becomes limiting on some roles that depend on the class of some other roles 53.

Valid-Time Temporal Model

  • O’Connor et al. propose a valid-time temporal model and a SWRL-based [40] query mechanism for manipulating temporal knowledge in OWL ontologies
  • In the valid-time temporal model, any existing OWL class can have temporal aspects as long as it subclasses temporal:Fact, which is the super class of all temporal facts. This avoids significant ontology rewriting in converting an ontology to a temporal version.
  • The temporal expressivity of this model is further enhanced by using SWRL [40] to construct temporal rules. A set of temporal operators that includes Allen’s operators [4] is implemented as library-like built-ins for SWRL rules.
  • Querying the temporal ontology is done by SQWRL

Named Graphs

  • all triples share the same temporal extent are grouped in the same graph
  • In an extreme case that each triple requires a different time reference, a significant amount of named graphs is needed.
  • When triples may need multiple metadata annotation, using Named Graphs model becomes complex.
  • τ SPARQL

RDF+

RDF+ model [62] uses named graphs and triple-level identifiers. Named graphs are used in place of RDF reification. Triple identifiers allow explicit annotation of meta knowledge. RDF+ model has two type of statements: literal and meta knowledge statement. A RDF+ literal statement is a quintuple form (g, s, p, o, θ) where g is the graph’s IRI, s,p,o are standard RDF triple compo- nents, and θ is a statement identifier. Based on the triple identifier in the RDF+ literal statement, the RDF+ meta knowledge statement can be formed as (θ, π, ω). θ is the literal statement identifier, π is the meta knowledge property and ω is the range value of π. The set K of RDF+ literal statements and the set M of RDF+ meta knowledge statements constitute a RDF+ theory,

Discussion

  • There are two temporal models in Instantiating-Identifying Concept/Relationship models. 4D Fluents [73, 6, 7] introduces temporal part for an entity changing over time. Each temporal part corresponds to a distinguishable timestamp. A fluent property associates two temporal parts. On the other hand, Singleton Property [52] ensures every relationship to be universally unique. As a result, an ordinary relationship, such as enrolled, becomes a relationship type.

Valid Time RDF

  • "As a result, a binary relationship actually incurs three timestamps: the valid time of the relationship and two participating entities."
    • t.2024.07.10.10 really? Do entities have timestamps? John might have a birth and death, but relationships involving John don't need to know that.
    • Also, birth-death are not the same as valid.
    • There's an asymmetry with valid time in open-world. if there's no valid-to, can you assume now? not in open-worlds. If there's no valid-from, you just assume it's missing.
      • t.2024.08.03.16 seems like you could use SWRL or

Valid Time RDF

  • In this thesis, we adopt a modeling approach that employs ideas from the 4D view and originated from the study in [66], and propose the Valid Time RDF, or Vtrdf Valid Time Rdf in short
  • VTRDF is based on temporal resource and temporal relationship or temporal fact.
    • temporal resource: RDF-compliance resource equipped with a timestamp to denote its existence in time
      • Each temporal resource is a coalesce of all its temporal parts
        • i.e. wholly present during its existence in time
      • Temporal parts are derived by slicing or projecting a temporal resource on to the time dimension.
    • temporal relationship: a factual assertion that relates qualified temporal resources, formed between either temporal parts or temporal resources provided that the participating parts or resources coexist in time
  • We introduce VTR, an infinite set of valid time resources, as the building block for VTRDF triples and VTRDF graphs
    • valid time resource is a resource with its existence time or valid time
    • In VTRDF, we consider a valid time resource as a collection of all its temporal parts.
    • Assertions can be made with respect to both the collection and any individual temporal part.
    • A temporal resource is a master resource, whereas all its temporal parts are member resources.
    • Projections from the master resource to its temporal parts are possible via projection functions.
    • The temporal aspects of the resources can use valid time, transaction time, or bitemporal.
      • In this research, we focus on the valid time.
      • Hence, we would use valid time resources and temporal resources interchangeably as appropriate

Notations, Namespace, and Time Domain

  • vtrdf: and vtrdfs: refer to the namespace of VTRDF vocabulary and VTRDF Schema vocabulary
  • While the symbol # is used to denote an additional part of the primary resource in the standard RDF model, VTRDF requires a second fragment identifier to accommodate the valid time dimension.
    • t.2024.07.24.11 with slash IRIs, could work too
    • The symbol • is used as a delimiter that separates the first fragment identifier from the valid
  • T is the set of time points with a linear order less-than (<). For simplicity, we use the standard U.S. calendar dates as the unit of time points in the format of month/day/year, such as 1/10/1995
  • Tɪ is the set of time intervals defined over T
  • 0 is the lower bound of the time axis whose interpretation is open for user’s need of data modeling.
  • now is a special constant that represents the current time. Its value will change as time advances.
  • ∞ is a constant that represents the upper bound of the time axis.
  • [0, ∞] is a special interval used to represent the maximal interval

Running Example

  • John enrolled in the Semantic Web course (SW), lived in New York City (NYC), and had a valid time [2/1/2016, 5/31/2016).
    • t.2024.07.24.12 kinda weird choice, seems like enrolled and livedIn are unrelated

Definitions

valid time IRI

Valid Time Literal

  • Let L be an infinite set of standard literals, [0, ∞] the maximal interval, and V T L = L × [0, ∞] be the Cartesian product.
  • A valid time literal lt ∈ V T L represents a literal that is always valid in time.
  • That is, all literals assume a default maximal interval [0, ∞] unless otherwise specified.

Valid Time Data Type

  • Let D be an infinite set of standard data types, [0, ∞] the maximal interval, and V T D = D × [0, ∞] be the Cartesian product. A valid time data type dt ∈ V T D is a data type recognized in the standard RDF with a default maximal interval [0, ∞].
    • Valid time data types are used to annotate valid time literals.
    • A special data type vtrdf:langString[0, ∞] can also be used to denote a language-tagged string value.

Lexical-to-Value Mapping Function V T L2V

  • V T L2V is a partial mapping from the lexical space of valid time literals to the value space V. A valid time literal lt with a valid time data type dt denote the mapped value obtained from the value space. That is, V T L2V (lt, dt) = v where v ∈ V.

Valid Time Property

  • Let P be the set of any properties, including those defined in RDF and RDFS vocabularies [16], TI be the set of intervals, and V T P = P × TI be the Cartesian product of them. A valid time property pt ∈ V T P is any property that is valid during a specified interval i ∈ TI .

Valid Time Blank Node

  • Let B be an infinite set of blank nodes, TI be the set of intervals, and V T B = B × TI be the Cartesian product. A valid time blank node bt ∈ V T B denotes the existence of a resource whose valid time may or may not be known. For simplicity, every valid time blank node in the VTRDF model assumes a default maximal valid interval [0, ∞] unless otherwise specified. A valid time blank node is usually identified by a local identifier.

Valid Time Resource Projection Function

  • A valid time resource projection function...

Valid Time RDF Triple

A Valid Time RDF triple (st, pt, ot) satisfies the temporal constraint, called Temporal Triple Integrity,such that pt is bounded by the interval that is formed by the common valid time of st and ot.

  • In other words, the temporal triple integrity requires that a valid time relationship can only be established between two existing resources with non-disjoint valid time

Predicate Defining Time (PDT) and Resource Modeling Time (RMT)

  • rt takes PDT when it is used in a VTRDF triple as a predicate to define the time of a re- lationship. In this case, PDT corresponds to the interval during which the relationship is valid
  • rt takes RMT when it is used in a VTRDF triple as a subject or an object that eventually involves in a relationship.
    • "RMT is the time that we want to store about the facts into the database."???

Valid Timeslice Operator

  • Given a VTRDF graph Gt and an interval i = [l, u), the valid time slice operator, TS, returns a temporal subgraph of Gt at i
    • t.2024.07.24.12 i.e., it cuts everything down to the interval)

VTRDF Subgraph

  • in addition to the common-sense definition, a "valid timeslice of a VTRDF graph Gt is a temporal subgraph of it."
    • t.2024.07.24.12 is it a typo that fig 4.3 has "now" and fig.4.5 has "infinity"

VTRDF Underlying Triple/Graph

  • basically, de-temporalizing
  • "If two or more triples agree on the subject or object, they are combined to one triple. "
    • t.2024.07.24.13 typo, should be "subject and object"

VTRDF Graph Vocabulary

  • the set of valid time IRIs that appear in Gt excluding valid time literals.

Ground VTRDF Graph

  • no valid time blank nodes

VTRDF Vocabulary

  • VTRDF Vocabulary is formulated as layers and RDF-compliant.

References


Footnotes

  1. Defining N-ary Relations on the Semantic Web˄


Backlinks