@@ -271,16 +271,20 @@ <h2>Notation and Terminology</h2>
271
271
A triple < b > < i > appears in</ i > </ b > a graph G
272
272
if it is in G or
273
273
if the triple term composed by its subject, predicate, and object appears in G.
274
- < p />
274
+ </ p >
275
+
275
276
276
- < p >
277
- For RDF terms t, x and y, we define the < dfn > substitution mapping</ dfn > , t[x/y] inductively as follows:
278
- (1) if t=x, then t[x/y]=y;
279
- (2) if t = (s,p,o) and t ≠ x, then t[x/y]= (s[x/y], p[x/y], o[x/y]=y);
280
- (3) t[x/y]=t, else.
281
- < br /> < br />
282
- For each triple (s,p,o), we set (s,p,o)[x/y]= (s[x/y],p[x/y],o[x/y]). For each graph G, we obtain G[x/y] by applying [x/y] to each triple t in G.
283
- < p />
277
+
278
+
279
+ < p >
280
+ For RDF terms t, x and y, we define the < dfn > substitution mapping</ dfn > , t[x/y] inductively as follows:
281
+ < ol >
282
+ < li > if t=x, then t[x/y]=y; </ li >
283
+ < li > if t = (s,p,o) and t ≠ x, then t[x/y]= (s[x/y], p[x/y], o[x/y]=y);</ li >
284
+ < li > else, t[x/y]=t. </ li >
285
+ </ ol >
286
+ For each triple (s,p,o), we set (s,p,o)[x/y]= (s[x/y],p[x/y],o[x/y]). For each graph G, we obtain G[x/y] by applying [x/y] to each triple t in G.
287
+ </ p >
284
288
285
289
286
290
< p > Suppose that M is a functional mapping from a set of blank
@@ -1085,9 +1089,9 @@ <h4>Patterns of RDF entailment (Informative)</h4>
1085
1089
</ tr >
1086
1090
< tr >
1087
1091
< td class ="othertable "> < dfn > rdfD1</ dfn > </ td >
1088
- < td class ="othertable "> xxx aaa < code > "</ code > sss< code > "^^</ code > ddd < code > . </ code > < br />
1092
+ < td class ="othertable "> ttt and < code > "</ code > sss< code > "^^</ code > ddd appears in ttt < br />
1089
1093
for ddd in D</ td >
1090
- < td class ="othertable "> xxx aaa _:nnn < code > . </ code > < br />
1094
+ < td class ="othertable "> ttt [ < code > " </ code > sss < code > "^^ </ code > /_:nnn] < br />
1091
1095
_:nnn < code > rdf:type</ code > ddd < code > .</ code > </ td >
1092
1096
</ tr >
1093
1097
</ tbody >
@@ -1489,6 +1493,11 @@ <h4>Patterns of RDFS entailment (Informative)</h4>
1489
1493
yyy aaa zzz < code > .</ code > </ td >
1490
1494
< td class ="othertable "> zzz < code > rdf:type</ code > xxx < code > .</ code > </ td >
1491
1495
</ tr >
1496
+ < tr >
1497
+ < td class ="othertable "> < dfn > rdfs4</ dfn > </ td >
1498
+ < td class ="othertable "> ttt and xxx appears in ttt</ td >
1499
+ < td class ="othertable "> xxx < code > rdf:type rdfs:Resource .</ code >
1500
+ </ tr >
1492
1501
< tr >
1493
1502
< td class ="othertable "> < dfn > rdfs5</ dfn > </ td >
1494
1503
< td class ="othertable "> xxx < code > rdfs:subPropertyOf</ code > yyy < code > .</ code > < br />
@@ -1538,34 +1547,16 @@ <h4>Patterns of RDFS entailment (Informative)</h4>
1538
1547
< td class ="othertable "> xxx < code > rdf:type rdfs:Datatype .</ code > </ td >
1539
1548
< td class ="othertable "> xxx < code > rdfs:subClassOf rdfs:Literal .</ code > </ td >
1540
1549
</ tr >
1541
- </ tbody >
1542
- </ table >
1543
-
1544
- < p />
1545
-
1546
- < table id ="rdfs_entailment_patterns_recursive ">
1547
- < tbody >
1548
- < tr >
1549
- < th > </ th >
1550
- < th > If the triple < a > appears in</ a > S:</ th >
1551
- < th > then S RDFS < a > entails recognizing D</ a > :</ th >
1552
- </ tr >
1553
- < tr >
1554
- < td class ="othertable "> < dfn > rdfs4</ dfn > </ td >
1555
- < td class ="othertable "> xxx aaa yyy < code > .</ code > </ td >
1556
- < td class ="othertable "> xxx < code > rdf:type rdfs:Resource .</ code > < br />
1557
- yyy < code > rdf:type rdfs:Resource .</ code > </ td >
1558
- </ tr >
1559
1550
< tr >
1560
1551
< td class ="othertable "> < dfn > rdfs14</ dfn > </ td >
1561
- < td class ="othertable "> xxx yyy <<(aaa bbb ccc)> > < code > .</ code > </ td >
1562
- < td class ="othertable "> the graph S with the appearance replaced with< br />
1563
- xxx yyy _:nnn < code > </ code > < br /> < br />
1552
+ < td class ="othertable "> ttt and <<(aaa bbb ccc)>> appears in ttt</ td >
1553
+ < td class ="othertable "> ttt [<<(aaa bbb ccc)> > /_:nnn]< br />
1564
1554
_:nnn < code > rdf:type rdfs:Proposition .</ code > </ td >
1565
1555
</ tr >
1566
1556
</ tbody >
1567
1557
</ table >
1568
1558
1559
+
1569
1560
< p > As an example of a RDFS entailment involving triple terms using the entailment pattern rdfs14, the following graph —</ p >
1570
1561
1571
1562
< p > < code > ex:a ex:b < < ( ex:c ex:d < < (ex:e ex:f ex:g)> > )> > .</ code > </ p >
0 commit comments