@faubulous/mentor-rdf 2.2.0 → 2.2.2

package/dist/index.js

@@ -2603,13 +2603,13 @@ var DefaultGraph = class {
   }
 };
 var Quad = class {
-  constructor(subject, predicate, object, graph2) {
+  constructor(subject, predicate, object, graph) {
     this.termType = "Quad";
     this.value = "";
     this.subject = subject;
     this.predicate = predicate;
     this.object = object;
-    this.graph = graph2 ?? new DefaultGraph();
+    this.graph = graph ?? new DefaultGraph();
   }
   equals(other) {
     if (other?.termType !== this.termType) {
@@ -2673,8 +2673,8 @@ var DataFactory = class {
    * @param graph The graph of the quad (defaults to the default graph).
    * @returns A new Quad instance.
    */
-  quad(subject, predicate, object, graph2) {
-    return new Quad(subject, predicate, object, graph2);
+  quad(subject, predicate, object, graph) {
+    return new Quad(subject, predicate, object, graph);
   }
   /**
    * Creates a copy of an existing term.
@@ -4127,17 +4127,17 @@ var DatasetView = class _DatasetView {
     }
     const scope = [];
     const seen = /* @__PURE__ */ new Set();
-    const push = (graph2) => {
-      const key = graph2.termType + ":" + graph2.value;
+    const push = (graph) => {
+      const key = graph.termType + ":" + graph.value;
       if (!seen.has(key)) {
         seen.add(key);
-        scope.push(graph2);
+        scope.push(graph);
       }
     };
-    for (const graph2 of graphs) {
-      push(graph2);
-      if (options.includeInferred !== false && store.reasoner && graph2.termType === "NamedNode") {
-        push(store.dataFactory.namedNode(store.reasoner.targetUriGenerator.getGraphUri(graph2.value)));
+    for (const graph of graphs) {
+      push(graph);
+      if (options.includeInferred !== false && store.reasoner && graph.termType === "NamedNode") {
+        push(store.dataFactory.namedNode(store.reasoner.targetUriGenerator.getGraphUri(graph.value)));
       }
     }
     return scope;
@@ -4154,8 +4154,8 @@ var DatasetView = class _DatasetView {
     if (this._scope === void 0) {
       n = this._store.countQuads(this._s, this._p, this._o, null);
     } else {
-      for (const graph2 of this._scope) {
-        n += this._store.countQuads(this._s, this._p, this._o, graph2);
+      for (const graph of this._scope) {
+        n += this._store.countQuads(this._s, this._p, this._o, graph);
       }
     }
     this._cachedSize = n;
@@ -4191,7 +4191,7 @@ var DatasetView = class _DatasetView {
     if (this._o && !this._o.equals(quad5.object)) {
       return false;
     }
-    if (this._scope !== void 0 && !this._scope.some((graph2) => graph2.equals(quad5.graph))) {
+    if (this._scope !== void 0 && !this._scope.some((graph) => graph.equals(quad5.graph))) {
       return false;
     }
     return this._store.has(quad5);
@@ -4206,14 +4206,14 @@ var DatasetView = class _DatasetView {
    * @param graph The optional graph.
    * @returns A new read-only dataset view of the matching quads.
    */
-  match(subject, predicate, object, graph2) {
+  match(subject, predicate, object, graph) {
     const s = _DatasetView._intersectTerm(this._s, subject);
     const p = _DatasetView._intersectTerm(this._p, predicate);
     const o = _DatasetView._intersectTerm(this._o, object);
     let scope = this._scope;
-    if (graph2 != null) {
-      if (scope === void 0 || scope.some((g) => g.equals(graph2))) {
-        scope = [graph2];
+    if (graph != null) {
+      if (scope === void 0 || scope.some((g) => g.equals(graph))) {
+        scope = [graph];
       } else {
         scope = [];
       }
@@ -4249,8 +4249,8 @@ var DatasetView = class _DatasetView {
     if (this._scope === void 0) {
       yield* this._store.matchQuads(this._s, this._p, this._o, null);
     } else {
-      for (const graph2 of this._scope) {
-        yield* this._store.matchQuads(this._s, this._p, this._o, graph2);
+      for (const graph of this._scope) {
+        yield* this._store.matchQuads(this._s, this._p, this._o, graph);
       }
     }
   }
@@ -4632,11 +4632,11 @@ var ReasonerBase = class {
       throw new Error(`Invalid value for targetUriGenerator: ${targetUriGenerator}`);
     }
   }
-  getGraphNode(graph2) {
-    if (typeof graph2 === "string") {
-      return namedNode5(graph2);
+  getGraphNode(graph) {
+    if (typeof graph === "string") {
+      return namedNode5(graph);
     } else {
-      return graph2;
+      return graph;
     }
   }
   isW3CNode(term) {
@@ -4678,9 +4678,9 @@ var ReasonerBase = class {
    * @param object An object URI or null to match any object.
    * @todo Refactor and merge with the same method in the Mentor RDF Store class.
    */
-  *match(graph2, subject, predicate, object) {
-    if (graph2 !== void 0) {
-      yield* this.store.match(subject, predicate, object, graph2);
+  *match(graph, subject, predicate, object) {
+    if (graph !== void 0) {
+      yield* this.store.match(subject, predicate, object, graph);
     } else {
       yield* this.store.match(subject, predicate, object);
     }
@@ -4842,6 +4842,18 @@ var RdfsReasoner = class extends SkosReasoner {
     this.classes = /* @__PURE__ */ new Set();
     this.properties = /* @__PURE__ */ new Set();
     this.individuals = /* @__PURE__ */ new Set();
+    /**
+     * The super properties of each property, as asserted with `rdfs:subPropertyOf`.
+     */
+    this._superProperties = /* @__PURE__ */ new Map();
+    /**
+     * The ranges asserted for each property.
+     */
+    this._ranges = /* @__PURE__ */ new Map();
+    /**
+     * The domains asserted for each property.
+     */
+    this._domains = /* @__PURE__ */ new Map();
   }
   isIgnoredNode(term) {
     switch (term.value) {
@@ -4866,6 +4878,47 @@ var RdfsReasoner = class extends SkosReasoner {
     for (let individual of individuals) {
       this.store.add(quad2(individual, rdf.type, owl.NamedIndividual, this.targetGraph));
     }
+    this._inferInheritedRangesAndDomains();
+  }
+  /**
+   * Infers the ranges and domains that properties inherit from their super properties
+   * (OWL 2 RL rules scm-rng2 and scm-dom2), following `rdfs:subPropertyOf` chains.
+   */
+  _inferInheritedRangesAndDomains() {
+    for (const { property, superProperties } of this._superProperties.values()) {
+      for (const superProperty of this._getAncestorProperties(property.value, superProperties)) {
+        for (const range of this._ranges.get(superProperty) ?? []) {
+          this.store.add(quad2(property, rdfs.range, range, this.targetGraph));
+        }
+        for (const domain of this._domains.get(superProperty) ?? []) {
+          this.store.add(quad2(property, rdfs.domain, domain, this.targetGraph));
+        }
+      }
+    }
+  }
+  /**
+   * Gets the transitive super properties of a property, nearest first. Cycles in the
+   * property hierarchy are followed only once.
+   * @param property The IRI or blank node id of a property.
+   * @param superProperties The direct super properties of the property.
+   * @returns The IRIs of all super properties, excluding the property itself.
+   */
+  _getAncestorProperties(property, superProperties) {
+    const result = [];
+    const visited = /* @__PURE__ */ new Set([property]);
+    const queue = [...superProperties];
+    while (queue.length > 0) {
+      const current = queue.shift();
+      if (visited.has(current)) {
+        continue;
+      }
+      visited.add(current);
+      result.push(current);
+      for (const next of this._superProperties.get(current)?.superProperties ?? []) {
+        queue.push(next);
+      }
+    }
+    return result;
   }
   resetState() {
     super.resetState();
@@ -4873,6 +4926,9 @@ var RdfsReasoner = class extends SkosReasoner {
     this.classes.clear();
     this.properties.clear();
     this.individuals.clear();
+    this._superProperties.clear();
+    this._ranges.clear();
+    this._domains.clear();
   }
   applyInference(quad5) {
     super.applyInference(quad5);
@@ -4966,13 +5022,49 @@ var RdfsReasoner = class extends SkosReasoner {
         }
         return;
       }
-      case rdfs.range.value:
+      case rdfs.subPropertyOf.value: {
+        this._addSuperProperty(s, o);
+        return;
+      }
+      case rdfs.range.value: {
+        this.assertProperty(s);
+        this._addToList(this._ranges, s.value, o);
+        return;
+      }
       case rdfs.domain.value: {
         this.assertProperty(s);
+        this._addToList(this._domains, s.value, o);
         return;
       }
     }
   }
+  /**
+   * Records that a property is a sub property of another property.
+   * @param property The sub property.
+   * @param superProperty The super property.
+   */
+  _addSuperProperty(property, superProperty) {
+    let entry = this._superProperties.get(property.value);
+    if (!entry) {
+      entry = { property, superProperties: /* @__PURE__ */ new Set() };
+      this._superProperties.set(property.value, entry);
+    }
+    entry.superProperties.add(superProperty.value);
+  }
+  /**
+   * Adds a value to the list stored under a key.
+   * @param map The map of lists.
+   * @param key The key of the list.
+   * @param value The value to add.
+   */
+  _addToList(map, key, value) {
+    const list = map.get(key);
+    if (list) {
+      list.push(value);
+    } else {
+      map.set(key, [value]);
+    }
+  }
 };
 
 // src/rdf/reasoners/shacl-reasoner.ts
@@ -9292,11 +9384,9 @@ xsd:usignedByte a rdfs:Datatype ;
 // src/rdf/store.ts
 import { RdfStore as RdfStore2 } from "rdf-stores";
 import { RdfXmlParser } from "rdfxml-streaming-parser";
-import { graph, serialize } from "rdflib";
 
 // src/rdf/utils.ts
-import * as rdflib from "rdflib";
-var toRdflibTerm = (term) => {
+var toRdflibTerm = (term, rdflib) => {
   switch (term.termType) {
     case "NamedNode":
       return rdflib.namedNode(term.value);
@@ -9451,18 +9541,18 @@ var Store = class {
    * Indicates if a graph holds at least one triple, without reading more than one.
    * @param graph The graph term, or its URI with an empty string for the default graph.
    */
-  _hasTriples(graph2) {
-    return !this._store.readQuads(null, null, null, this._getGraphTerm(graph2)).next().done;
+  _hasTriples(graph) {
+    return !this._store.readQuads(null, null, null, this._getGraphTerm(graph)).next().done;
   }
   /**
    * Resolves a graph URI to its term; an empty string denotes the default graph.
    * @param graph The graph term or URI.
    */
-  _getGraphTerm(graph2) {
-    if (typeof graph2 !== "string") {
-      return graph2;
+  _getGraphTerm(graph) {
+    if (typeof graph !== "string") {
+      return graph;
     }
-    return graph2 === "" ? this.dataFactory.defaultGraph() : this.dataFactory.namedNode(graph2);
+    return graph === "" ? this.dataFactory.defaultGraph() : this.dataFactory.namedNode(graph);
   }
   /**
    * Load a set of triples into the store.
@@ -9495,17 +9585,17 @@ var Store = class {
     ));
   }
   _loadQuads(quads, graphUri, executeInference = true, clearGraph = true, onQuad) {
-    const graph2 = this.dataFactory.namedNode(graphUri.replace("\\", "/"));
+    const graph = this.dataFactory.namedNode(graphUri.replace("\\", "/"));
     if (clearGraph) {
       this.deleteGraphs([graphUri], true);
     }
     for (let q of quads) {
-      this._ds.add(this.dataFactory.quad(q.subject, q.predicate, q.object, graph2));
+      this._ds.add(this.dataFactory.quad(q.subject, q.predicate, q.object, graph));
       if (onQuad) {
         onQuad(q);
       }
     }
-    this._touchGraph(graph2.value);
+    this._touchGraph(graph.value);
     if (this.reasoner && executeInference) {
       this._expand(graphUri);
     }
@@ -9611,15 +9701,16 @@ var Store = class {
    * @returns A string serialization of the triples in the graph in the specified format.
    */
   async serializeGraph(sourceGraphUri, targetFormat = "text/turtle", targetGraphUri, prefixes) {
+    const rdflib = await import("rdflib");
     return new Promise((resolve, reject) => {
       const sourceGraph = this.dataFactory.namedNode(sourceGraphUri);
       const targetGraph = targetGraphUri ? this.dataFactory.namedNode(targetGraphUri) : void 0;
-      const store = graph();
-      const g = targetGraph ? toRdflibTerm(targetGraph) : void 0;
+      const store = rdflib.graph();
+      const g = targetGraph ? toRdflibTerm(targetGraph, rdflib) : void 0;
       for (const q of this._store.readQuads(null, null, null, sourceGraph)) {
-        const s = toRdflibTerm(q.subject);
-        const p = toRdflibTerm(q.predicate);
-        const o = toRdflibTerm(q.object);
+        const s = toRdflibTerm(q.subject, rdflib);
+        const p = toRdflibTerm(q.predicate, rdflib);
+        const o = toRdflibTerm(q.object, rdflib);
         store.add(s, p, o, g);
       }
       const callback = (error, result) => {
@@ -9629,7 +9720,7 @@ var Store = class {
           resolve(result ?? "");
         }
       };
-      serialize(null, store, null, targetFormat, callback, prefixes);
+      rdflib.serialize(null, store, null, targetFormat, callback, prefixes);
     });
   }
   /**
@@ -9721,8 +9812,8 @@ var Store = class {
    * @param object The optional object.
    * @param graph The optional graph.
    */
-  countQuads(subject, predicate, object, graph2) {
-    return this._store.countQuads(subject, predicate, object, graph2);
+  countQuads(subject, predicate, object, graph) {
+    return this._store.countQuads(subject, predicate, object, graph);
   }
   /**
    * Returns a lazy, read-only dataset view of the quads matching the given pattern.
@@ -9736,12 +9827,12 @@ var Store = class {
    * @param graph The optional graph.
    * @returns A read-only dataset view of the matching quads.
    */
-  match(subject, predicate, object, graph2) {
+  match(subject, predicate, object, graph) {
     return new DatasetView(this, {
       subject: subject ?? null,
       predicate: predicate ?? null,
       object: object ?? null,
-      graphs: graph2 != null ? [graph2] : void 0,
+      graphs: graph != null ? [graph] : void 0,
       includeInferred: false
     });
   }
@@ -9753,8 +9844,8 @@ var Store = class {
    * @param object The optional object.
    * @param graph The optional graph.
    */
-  *matchQuads(subject, predicate, object, graph2) {
-    yield* this._store.readQuads(subject, predicate, object, graph2);
+  *matchQuads(subject, predicate, object, graph) {
+    yield* this._store.readQuads(subject, predicate, object, graph);
   }
   /**
    * Get an RDF/JS `Source` interface for the store that streams matching quads.
@@ -9763,7 +9854,7 @@ var Store = class {
    */
   asSource() {
     return {
-      match: (subject, predicate, object, graph2) => this._store.match(subject, predicate, object, graph2)
+      match: (subject, predicate, object, graph) => this._store.match(subject, predicate, object, graph)
     };
   }
   /**
@@ -9784,10 +9875,10 @@ var Store = class {
     const o = object;
     if (graphUris !== void 0) {
       const graphs = Array.isArray(graphUris) ? graphUris : [graphUris];
-      for (const graph2 of graphs.map((g) => this.dataFactory.namedNode(g))) {
-        yield* this._store.readQuads(s, p, o, graph2);
+      for (const graph of graphs.map((g) => this.dataFactory.namedNode(g))) {
+        yield* this._store.readQuads(s, p, o, graph);
         if (includeInferred !== false && this.reasoner) {
-          const inferenceGraphUri = this.reasoner.targetUriGenerator.getGraphUri(graph2.value);
+          const inferenceGraphUri = this.reasoner.targetUriGenerator.getGraphUri(graph.value);
           const inferenceGraph = this.dataFactory.namedNode(inferenceGraphUri);
           yield* this._store.readQuads(s, p, o, inferenceGraph);
         }
@@ -9842,7 +9933,7 @@ var Store = class {
 };
 
 // src/rdf/vocabulary-repository.ts
-var { namedNode: namedNode8 } = dataFactory;
+var { namedNode: namedNode7 } = dataFactory;
 var VocabularyRepository = class extends ShapeRepository {
   /**
    * Get all concept schemes in the repository.
@@ -9909,7 +10000,7 @@ var VocabularyRepository = class extends ShapeRepository {
    * @returns The version of the ontology, or undefined if it is not found.
    */
   getOntologyVersionInfo(graphUris, ontologyUri) {
-    const s = namedNode8(ontologyUri);
+    const s = namedNode7(ontologyUri);
     for (const q of this.store.matchAll(graphUris, s, owl.versionInfo, null)) {
       const match = q.object.value.match(/(\d{4}[\/-]\d{2}[\/-]\d{2})/);
       if (match && match.length > 1) {