From 0b1b6eb6ccc2fcae743fd1e128a659f67355346f Mon Sep 17 00:00:00 2001 From: Andy Seaborne Date: Thu, 11 Jun 2026 22:42:12 +0100 Subject: [PATCH] Editorial - SHACL rules --- shacl12-rules/index.html | 51 +++++++++++++++++++++------------------- 1 file changed, 27 insertions(+), 24 deletions(-) diff --git a/shacl12-rules/index.html b/shacl12-rules/index.html index 7fb7fdb5..9a079d71 100644 --- a/shacl12-rules/index.html +++ b/shacl12-rules/index.html @@ -179,7 +179,7 @@

SHACL Rules provides inferencing with the generation of new RDF data from a combination of a set of rules and a base data graph. Rules can be expressed as RDF - or in the SHACL Rules Language (SRL). + or in the Shape Rules Language (SRL).

This specification is published by the @@ -317,13 +317,13 @@

Document Conventions

This specification defines conformance criteria for:

A conforming Shapes Rules Language Document is an + data-lt="shape rules document|ruleset document" + >Shape Rules Language Document is an RDF string that conforms to the grammar, starting with the RuleSet @@ -340,7 +340,7 @@

Document Conventions

Version Labels

A version label is a string that identifies the syntax and semantics conformance - for the Shacl Rules Language. + for the Shapes Rules Language.

@@ -601,7 +601,7 @@

Assignment and Creating RDF Terms

their [=rule head=] are [=run-once rules=]. Such rules are run after all the rules that could produce data that they depend on, and before any rules that depend on the data they produce. - Rules that involve blank node in the [=rule head=] are also creating new + Rules that involve blank nodes in the [=rule head=] also create new RDF terms and are run-once rules.

@@ -710,7 +710,7 @@

Shape Rules Abstract Syntax

The Shape Rules Abstract Syntax is the logical structure of SHACL Rules. It is used to define the execution algorithm of SHACL Rules. - Each of the two concrete syntax forms of SHACL Rules, the SHACL Rules Language (SRL) + Each of the two concrete syntax forms of SHACL Rules, the Shape Rules Language (SRL) and the RDF syntax (SRL/RDF), provides a way to express the abstract syntax.

@@ -967,8 +967,8 @@

Rule Dependency

either as a [=triple pattern element=] or inside a [=negation element=].

- There are two kinds of dependencies: - [=closed dependencies=] and an [=open dependencies=]. + There are two kinds of dependency: + [=closed dependencies=] and [=open dependencies=]. A closed dependency ensures that rule `R2` has generated all its possible output before rule `R1` is executed. If a rule dependency is not closed, it is an open dependency @@ -995,7 +995,7 @@

Rule Dependency

A [=triple pattern=] matches a [=triple template=] if - the triple template may generate a triple that matches the triple pattern. + the triple template can generate a triple that matches the triple pattern.

@@ -1057,7 +1057,7 @@

Rule Dependency

A [=triple template=] with components `tSubj`, `tPred`, `tObj` can possibly generate a triple with component RDF terms - `s`, `p`, `o` if + `s`, `p`, `o` if all of the following are true: