• Every blank node is either of category unnamedIndividual or meets the structural requirements listed below, in the appropriate table.
  • Such an RDF graph is finite, being constructed from a finite number of finite documents.

    A directed cycle of blank nodes is a sequence of triples t0, t1, ... tn, in which tn = t0, and in which the subjects and objects of all the triples are blank, and in which the object of ti is the subject of ti+1, for i from 0 to n-1.