You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: shacl12-core/index.html
+18-18Lines changed: 18 additions & 18 deletions
Original file line number
Diff line number
Diff line change
@@ -266,7 +266,7 @@ <h3>Terminology</h3>
266
266
<divclass="term-def-header">Property Value and Path</div>
267
267
<div>
268
268
A <dfndata-lt="properties">property</dfn> is an <a>IRI</a>.
269
-
An <a>RDF term</a><code>n</code> has a <dfndata-lt="values|property value|property values">value</dfn><code>v</code>
269
+
An <a>RDF term</a><code>n</code> has a <dfndata-lt="value|values|property value|property values">value</dfn><code>v</code>
270
270
for property <code>p</code> in an <a>RDF graph</a> if there is an <a>RDF triple</a> in the graph
271
271
with <a>subject</a><code>n</code>, <a>predicate</a><code>p</code>, and <a>object</a><code>v</code>.
272
272
The phrase "Every value of P in graph G ..." means "Every object of a triple in G with predicate P ...".
@@ -282,14 +282,14 @@ <h3>Terminology</h3>
282
282
<divclass="def">
283
283
<divclass="term-def-header">SHACL Lists</div>
284
284
<div>
285
-
<spandata-syntax-rule="SHACL-list">A <dfndata-lt="SHACL lists">SHACL list</dfn> in an RDF graph <code>G</code> is an <a>IRI</a> or a <a>blank node</a>
285
+
<spandata-syntax-rule="SHACL-list">A <dfn>SHACL list</dfn> in an RDF graph <code>G</code> is an <a>IRI</a> or a <a>blank node</a>
286
286
that is either <code>rdf:nil</code> (provided that <code>rdf:nil</code> has no <a>value</a>
287
287
for either <code>rdf:first</code> or <code>rdf:rest</code>), or has exactly one <a>value</a>
288
288
for the property <code>rdf:first</code> in <code>G</code> and exactly one <a>value</a>
289
289
for the property <code>rdf:rest</code> in <code>G</code> that is also a SHACL list in <code>G</code>,
290
290
and the list does not have itself as a value of the property path <code>rdf:rest+</code> in <code>G</code>.</span>
291
291
<br>
292
-
The <dfndata-lt="member">members</dfn> of any SHACL list except <code>rdf:nil</code> in an RDF
292
+
The <dfndata-lt="members|member">members</dfn> of any SHACL list except <code>rdf:nil</code> in an RDF
293
293
graph <code>G</code> consist of its value for <code>rdf:first</code> in <code>G</code> followed by
294
294
the members in <code>G</code> of its value for <code>rdf:rest</code> in <code>G</code>.
295
295
The SHACL list <code>rdf:nil</code> has no members in any RDF graph.
@@ -1199,7 +1199,7 @@ <h3>Constraints, Parameters and Constraint Components</h3>
1199
1199
</p>
1200
1200
<p>
1201
1201
For a <a>constraint component</a><code>C</code> with <a>mandatory parameters</a><code>p1</code>, ... <code>pn</code>,
1202
-
a <a>shape</a><code>s</code> in a <a>shapes graph</a><code>SG</code><em>declares</em> a <dfndata-lt="constraints">constraint</dfn>
1202
+
a <a>shape</a><code>s</code> in a <a>shapes graph</a><code>SG</code><em>declares</em> a <dfn>constraint</dfn>
1203
1203
that has <dfn>kind</dfn><code>C</code> with <a>mandatory parameter</a><a>values</a><code><p1,v1></code>, ... <code><pn,vn></code>
1204
1204
in <code>SG</code> when <code>s</code> has <code>vi</code> as a <a>value</a> for <code>pi</code> in <code>SG</code>.
1205
1205
For constraint components with <a>optional parameters</a>, the constraint declaration consists of the <a>values</a> that the shape has for all mandatory and optional parameters of that component.
@@ -1294,7 +1294,7 @@ <h3>Constraints, Parameters and Constraint Components</h3>
1294
1294
}</pre></div></div>
1295
1295
</aside>
1296
1296
<p>
1297
-
Constraint components are associated with <dfndata-lt="validator|validators">validators</dfn>, which provide instructions (for example expressed via SPARQL queries)
1297
+
Constraint components are associated with <dfn>validators</dfn>, which provide instructions (for example expressed via SPARQL queries)
1298
1298
on how the parameters are used to validate data.
1299
1299
Validating an <a>RDF term</a> against a <a>shape</a> involves validating the term against each <a>constraint</a> where the
1300
1300
shape has <a>values</a> for all <a>mandatory parameters</a> of the <a>component</a> of the <a>constraint</a>,
@@ -1309,7 +1309,7 @@ <h3>Constraints, Parameters and Constraint Components</h3>
1309
1309
<sectionid="focusNodes">
1310
1310
<h3>Focus Nodes</h3>
1311
1311
<p>
1312
-
An <a>RDF term</a> that is <a>validated</a> against a <a>shape</a> using the triples from a <a>data graph</a> is called a <dfndata-lt="focus node|focus nodes">focus node</dfn>.
1312
+
An <a>RDF term</a> that is <a>validated</a> against a <a>shape</a> using the triples from a <a>data graph</a> is called a <dfn>focus node</dfn>.
1313
1313
</p>
1314
1314
<p><em>The remainder of this section is informative.</em></p>
1315
1315
<p>
@@ -1330,7 +1330,7 @@ <h3>Targets</h3>
1330
1330
<a>triples</a> with the <a>shape</a> as the <a>subject</a> and certain properties described in this document
1331
1331
(e.g., <code>sh:targetClass</code>) as <a>predicates</a>.
1332
1332
Target declarations can be used to produce <a>focus nodes</a> for a <a>shape</a>.
1333
-
The <dfndata-lt="targets">target</dfn> of a <a>target declaration</a> is the set of RDF terms produced
1333
+
The <dfn>target</dfn> of a <a>target declaration</a> is the set of RDF terms produced
1334
1334
by applying the rules described in the remainder of this section to the <a>data graph</a>.
1335
1335
The <dfndata-lt="target of the shape">target of a shape</dfn> is the union of all RDF terms produced by the individual
1336
1336
<a>targets</a> that are declared by the <a>shape</a> in the <a>shapes graph</a>.
@@ -2201,7 +2201,7 @@ <h4>Deactivating Shapes and Constraints</h4>
2201
2201
<sectionid="node-shapes">
2202
2202
<h3>Node Shapes</h3>
2203
2203
<pclass="syntax">
2204
-
A <dfndata-lt="node shapes">node shape</dfn> is a <a>shape</a> in the <a>shapes graph</a> that
2204
+
A <dfn>node shape</dfn> is a <a>shape</a> in the <a>shapes graph</a> that
2205
2205
is not the <a>subject</a> of a <a>triple</a> with <code>sh:path</code> as its <a>predicate</a>.
2206
2206
It is recommended, but not required, for a <a>node shape</a> to be declared as a <a>SHACL instance</a> of <code>sh:NodeShape</code>.
2207
2207
<spandata-syntax-rule="NodeShape-path-maxCount"><a>SHACL instances</a> of <code>sh:NodeShape</code> cannot have a <a>value</a> for the property <code>sh:path</code>.</span>
@@ -2215,7 +2215,7 @@ <h3>Node Shapes</h3>
2215
2215
<sectionid="property-shapes">
2216
2216
<h3>Property Shapes</h3>
2217
2217
<pclass="syntax">
2218
-
<spandata-syntax-rule="PropertyShape">A <dfndata-lt="property shapes">property shape</dfn> is a <a>shape</a> in the <a>shapes graph</a>
2218
+
<spandata-syntax-rule="PropertyShape">A <dfn>property shape</dfn> is a <a>shape</a> in the <a>shapes graph</a>
2219
2219
that is the <a>subject</a> of a <a>triple</a> that has <code>sh:path</code> as its <a>predicate</a>.</span>
2220
2220
<spandata-syntax-rule="path-maxCount">A shape has at most one <a>value</a> for <code>sh:path</code>.</span>
2221
2221
<spandata-syntax-rule="path-node">The <a>value</a> of <code>sh:path</code> in a property shape is a <a>well-formed</a>
The following sub-sections provide syntax rules of <a>well-formed</a><a>SHACL property paths</a>
2343
2343
together with mapping rules to <ahref="https://www.w3.org/TR/sparql12-query/#pp-language">SPARQL 1.2 property paths</a>.
2344
2344
These rules define the <dfn>path mapping</dfn><code>path(p,G)</code> in an RDF graph <code>G</code> of an RDF term <code>p</code> that is a SHACL property path in <code>G</code>.
2345
-
Two SHACL property paths are considered <dfndata-lt="equivalent path">equivalent paths</dfn> when they map to the exact same SPARQL property paths.
2345
+
Two SHACL property paths are considered <dfn>equivalent paths</dfn> when they map to the exact same SPARQL property paths.
2346
2346
</p>
2347
2347
<pclass="syntax">
2348
-
<spandata-syntax-rule="path-metarule">A node in an RDF graph is a <a>well-formed</a><dfndata-lt="SHACL property paths">SHACL property path</dfn><code>p</code> if it satisfies exactly one of the syntax rules in the following sub-sections.</span>
2348
+
<spandata-syntax-rule="path-metarule">A node in an RDF graph is a <a>well-formed</a><dfn>SHACL property path</dfn><code>p</code> if it satisfies exactly one of the syntax rules in the following sub-sections.</span>
2349
2349
<spandata-syntax-rule="path-non-recursive">A node <code>p</code> is not a <a>well-formed</a> SHACL property path if <code>p</code> is a blank node and any path mappings of <code>p</code> directly or transitively reference <code>p</code>.</span>
2350
2350
</p>
2351
2351
<p>
@@ -2642,7 +2642,7 @@ <h2>Validation and Graphs</h2>
2642
2642
<sectionid="shapes-graph">
2643
2643
<h3>Shapes Graph</h3>
2644
2644
<p>
2645
-
A <dfndata-lt="shapes graphs">shapes graph</dfn> is an RDF graph containing zero or more shapes
2645
+
A <dfn>shapes graph</dfn> is an RDF graph containing zero or more shapes
2646
2646
that is passed into a SHACL <a>validation</a> process so that a <a>data graph</a> can be validated against the shapes.
2647
2647
</p>
2648
2648
<p><em>The remainder of this section is informative.</em></p>
@@ -2660,7 +2660,7 @@ <h3>Shapes Graph</h3>
2660
2660
<sectionid="data-graph">
2661
2661
<h3>Data Graph</h3>
2662
2662
<p>
2663
-
Any RDF graph can be a <dfndata-lt="data graphs">data graph</dfn>.
2663
+
Any RDF graph can be a <dfn>data graph</dfn>.
2664
2664
</p>
2665
2665
<p><em>The remainder of this section is informative.</em></p>
2666
2666
<p>
@@ -2740,7 +2740,7 @@ <h3>Linking to shapes graphs (sh:shapesGraph)</h3>
2740
2740
<sectionid="validation-definition">
2741
2741
<h3>Validation</h3>
2742
2742
<p>
2743
-
<dfndata-lt="validating|validates|validated|validate">Validation</dfn> is a mapping from some input
2743
+
<dfndata-lt="validation|validating|validates|validated|validate">Validation</dfn> is a mapping from some input
2744
2744
to <a>validation results</a>, as defined in the following paragraphs.
2745
2745
</p>
2746
2746
<p>
@@ -2781,7 +2781,7 @@ <h3>Validation</h3>
2781
2781
<sectionid="failures">
2782
2782
<h4>Failures</h4>
2783
2783
<p>
2784
-
<a>Validation</a> and <a>conformance checking</a> can result in a <dfndata-lt="failures">failure</dfn>.
2784
+
<a>Validation</a> and <a>conformance checking</a> can result in a <dfn>failure</dfn>.
2785
2785
For example, a particular SHACL processor might allow recursive shapes but report a failure
2786
2786
if it detects a loop within the data.
2787
2787
Failures can also be reported due to resource exhaustion.
@@ -2829,7 +2829,7 @@ <h4>Handling of Recursive Shapes</h4>
2829
2829
in <code>G</code> if it has <code>s2</code> as <a>value</a> for some non-list-taking,
2830
2830
shape-expecting parameter of some constraint component or <code>s2</code> as a <a>member</a> of
2831
2831
the <a>value</a> for some list-taking, shape-expecting parameter of some constraint component.
2832
-
A shape in an RDF graph <code>G</code> is a <dfndata-lt="recursive">recursive shape</dfn> in <code>G</code> if it is related to
2832
+
A shape in an RDF graph <code>G</code> is a <dfndata-lt="recursive shape|recursive">recursive shape</dfn> in <code>G</code> if it is related to
2833
2833
itself by the transitive closure of the <a>refers</a> relationship in <code>G</code>.
2834
2834
</p>
2835
2835
<p>
@@ -2852,12 +2852,12 @@ <h4>Handling of Recursive Shapes</h4>
2852
2852
<sectionid="conformance-definition">
2853
2853
<h3>Conformance Checking</h3>
2854
2854
<p>
2855
-
A <a>focus node</a><dfndata-lt="conform|conformance">conforms</dfn> to a <a>shape</a> if and only if
2855
+
A <a>focus node</a><dfndata-lt="conforms|conform|conformance">conforms</dfn> to a <a>shape</a> if and only if
2856
2856
the set of result of the <a>validation</a> of the <a>focus node</a> against the <a>shape</a> does not contain any results with a severity level representing a violation and no <a>failure</a>
2857
2857
has been reported by it.
2858
2858
</p>
2859
2859
<p>
2860
-
<dfndata-lt="conformance check">Conformance checking</dfn> produces <code>true</code> if and only if a given <a>focus node</a>
2860
+
<dfndata-lt="conformance checking|conformance check">Conformance checking</dfn> produces <code>true</code> if and only if a given <a>focus node</a>
2861
2861
<a>conforms</a> to a given <a>shape</a>, and <code>false</code> otherwise.
0 commit comments