RDFS Inference, Consistency, …

• Using the RDFS Interpretations, the notion of consistency, inference, etc, follows the general model theory definitions

• The “RDF Semantics” document also includes an algorithm for R ⊧RDFS S:

• • extend R with new triplets recursively as long as there is a change, using a set of “entailement rules”; this yields E(R)
  • R ⊧RDFS S if and only if S is a subgraph of E(R) (there are some extra complications with typed literals and blank nodes)
  • it can be proven that this algorithm works

• In the algorithmic world, this is referred to as “forward chaining”