Press n or j to go to the next uncovered block, b, p or k for the previous block.
| 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 | 9x 42x 42x 95x 95x 13228x 13228x 12720x 10x 10x 12710x 550x 550x 12160x 464x 11696x 4918x 95x 95x 95x 438699x 438699x 438699x 438699x 438699x 173387x 265312x 64851x 13228x 64851x 4525x 4525x 4500x 4525x 108x 4525x 3587x 3587x 3563x 3587x 3364x 3303x 3303x 3364x 3364x 3364x 8134x 4853x 3281x 3281x 3219x 3364x 1590x 238x 238x 1590x 1590x 1590x 4656x 272x 4384x 4384x 670x 1590x 588x 588x 588x 10x 10x 10x 438699x 438699x 438699x 438699x 438699x 173387x 265312x 13228x 13228x 12720x 13228x 588x 588x 588x 10x 10x 10x 534x 534x 534x 5276x 5276x 5276x 131x 131x 131x 131x 131x 64851x 6157x 64851x | import * as rdfjs from "@rdfjs/types";
import { owl, rdf, rdfs } from "../../ontologies";
import { ShaclReasoner } from "./shacl-reasoner";
import { GraphUriGenerator, DefaultInferenceGraphHandler } from "./reasoner";
import { RdfDataFactory } from "../rdf-data-factory";
const { quad } = RdfDataFactory;
/**
* A restriction in OWL.
*/
interface OwlRestriction {
onProperty?: rdfjs.NamedNode;
cardinality?: number;
minCardinality?: number;
maxCardinality?: number;
qualifiedCardinality?: number;
onClass?: rdfjs.NamedNode;
onDataRange?: rdfjs.NamedNode;
allValuesFrom?: rdfjs.Quad_Subject | rdfjs.Quad_Object;
someValuesFrom?: rdfjs.Quad_Subject | rdfjs.Quad_Object;
}
/**
* A simple OWL reasoner that expands the graph with inferred triples.
*/
export class OwlReasoner extends ShaclReasoner {
protected restrictions: { [subject: string]: OwlRestriction };
constructor(targetUriGenerator: GraphUriGenerator = new DefaultInferenceGraphHandler()) {
super(targetUriGenerator);
this.restrictions = {};
}
protected afterInference(): void {
super.afterInference();
for (let r of Object.values(this.restrictions)) {
const p = r.onProperty;
if (!p) continue;
if (r.onDataRange) {
this.store.add(quad(p, rdf.type, owl.DatatypeProperty, this.targetGraph));
this.store.add(quad(p, rdfs.range, r.onDataRange, this.targetGraph));
} else if (r.onClass) {
this.store.add(quad(p, rdf.type, owl.ObjectProperty, this.targetGraph));
this.store.add(quad(p, rdfs.range, r.onClass, this.targetGraph));
} else if (r.allValuesFrom) {
this.store.add(quad(p, rdf.type, owl.ObjectProperty, this.targetGraph));
} else if (r.someValuesFrom) {
this.store.add(quad(p, rdf.type, owl.ObjectProperty, this.targetGraph));
}
}
this.restrictions = {};
}
protected override resetState(): void {
super.resetState();
this.restrictions = {};
}
protected inferClassAxioms(q: rdfjs.Quad) {
super.inferClassAxioms(q);
let s = q.subject;
let p = q.predicate;
let o = q.object.termType != "Literal" ? q.object : undefined;
if (!o) {
return;
}
// See: https://www.w3.org/TR/owl2-profiles/#Reasoning_in_OWL_2_RL_and_RDF_Graphs_using_Rules
switch (p.value) {
case rdf.type.value: {
if (o.value == owl.Restriction.value) {
this.restrictions[s.value] = {};
}
return;
}
case owl.equivalentClass.value: {
this.assertClass(s);
if (o && !this.isW3CNode(o)) {
this.assertClass(o);
}
// The opposite is also true.
if (o.termType == "NamedNode") {
this.store.add(quad(o, owl.equivalentClass, s, this.targetGraph));
}
return;
}
case owl.complementOf.value:
case owl.disjointWith.value: {
this.assertClass(s);
if (o && !this.isW3CNode(o)) {
this.assertClass(o);
}
return;
}
case owl.intersectionOf.value: {
let equivalentSubjects = [...this.store.match(null, owl.equivalentClass, s)]
.map(q => q.subject)
.filter(q => q.termType == "NamedNode");
// Rule #scm-int
let classes = this.getListItems(o.value);
Iif (!Array.isArray(classes)) {
this.errors.push({ quad: q, message: `Expected an array of classes for ${o.value}` });
return;
}
for (let c of classes) {
if (c.termType != "NamedNode") {
continue;
}
this.store.add(quad(s, rdfs.subClassOf, c, this.targetGraph));
for (let es of equivalentSubjects) {
this.store.add(quad(es, rdfs.subClassOf, c, this.targetGraph));
}
}
return;
}
case owl.unionOf.value: {
let equivalentSubjects = [...this.store.match(null, owl.equivalentClass, s)]
.map(q => q.subject)
.filter(q => q.termType == "NamedNode");
// Rule #scm-uni
let classes = this.getListItems(o.value);
Iif (!Array.isArray(classes)) {
this.errors.push({ quad: q, message: `Expected an array of classes for ${o.value}` });
return;
}
for (let c of classes) {
if (c.termType != "NamedNode") {
continue;
}
this.store.add(quad(c, rdfs.subClassOf, s, this.targetGraph));
for (let es of equivalentSubjects) {
this.store.add(quad(c, rdfs.subClassOf, es, this.targetGraph));
}
}
return;
}
case owl.onClass.value: {
Eif (o.termType == "NamedNode") {
this.assertClass(o);
}
return;
}
case owl.onDataRange.value: {
Eif (o.termType == "NamedNode") {
this.store.add(quad(o, rdf.type, rdfs.Datatype, this.targetGraph));
}
return;
}
// Note:
// e.g. Gist also uses these on xsd:string, so inferring that this is a
// class is technically true, however, it would lead to undesirable results.
//
// case owl.allValuesFrom.id: {
// if (o.termType == "NamedNode") {
// this.store.add(quad(o, rdf.type, rdfs.Class, this.targetGraph));
// }
//
// return;
// }
// case owl.someValuesFrom.id: {
// if (o.termType == "NamedNode") {
// this.store.add(quad(o, rdf.type, rdfs.Class, this.targetGraph));
// }
//
// break;
// }
}
}
protected inferPropertyAxioms(q: rdfjs.Quad) {
super.inferPropertyAxioms(q);
let s = q.subject;
let p = q.predicate;
let o = q.object.termType != "Literal" ? q.object : undefined;
if (!o) {
return;
}
switch (p.value) {
case owl.onProperty.value: {
this.assertProperty(o);
if (this.restrictions[s.value] && o.termType == "NamedNode") {
this.restrictions[s.value].onProperty = o;
}
return;
}
case owl.onClass.value: {
Eif (this.restrictions[s.value] && o.termType == "NamedNode") {
this.restrictions[s.value].onClass = o;
}
return;
}
case owl.onDataRange.value: {
Eif (this.restrictions[s.value] && o.termType == "NamedNode") {
this.restrictions[s.value].onDataRange = o;
}
return;
}
case owl.allValuesFrom.value: {
Eif (this.restrictions[s.value]) {
this.restrictions[s.value].allValuesFrom = o;
}
return;
}
case owl.someValuesFrom.value: {
Eif (this.restrictions[s.value]) {
this.restrictions[s.value].someValuesFrom = o;
}
return;
}
case owl.equivalentProperty.value: {
this.assertProperty(s);
this.assertProperty(o);
// The opposite is also true.
Eif (o.termType == "NamedNode") {
this.store.add(quad(o, owl.equivalentProperty, s, this.targetGraph));
}
return;
}
case rdf.type.value: {
switch (o.value) {
case owl.AnnotationProperty.value:
case owl.AsymmetricProperty.value:
case owl.DatatypeProperty.value:
case owl.DeprecatedProperty.value:
case owl.FunctionalProperty.value:
case owl.InverseFunctionalProperty.value:
case owl.IrreflexiveProperty.value:
case owl.ObjectProperty.value:
case owl.OntologyProperty.value:
case owl.ReflexiveProperty.value:
case owl.SymmetricProperty.value:
case owl.TransitiveProperty.value: {
this.assertProperty(s);
}
}
return;
}
}
}
} |