I found these excercises with solutions, but I do not understand this solution. Can you explain me the Simple Entailment to understand this example: http://cgi.csc.liv.ac.uk/~valli/Comp318/PDF/Entailment.pdf
Given the RDF graph G (expressed in Turtle):
:u rdfs:subClassOf :v .
:u rdfs:domain _:n .
:w rdf:type owl:class .
:w :a :x .
Is the following graph simple-entailed by G? Explain the answer
:u rdfs:domain _:m .
:w :a :x .
Simple Entailment Deduction Rules:
se1:
u a x .
---------
u a _:n .
se2:
u a x .
---------
_:n a x .
Here is the solution:
By applying se1 to the triple
:u rdfs:domain _:n .
we obtain the following graph:
:u rdfs:subClassOf :v .
:u rdfs:domain _:n .
:w rdf:type owl:class .
:w :a :x .
:u rdfs:domain _:m .
Therefore the graph S
:u rdfs:domain _:m .
:w :a :x .
is entailed by G because S ⊆ G