rdf-reasoner-konclude 0.7.0 → 0.7.2
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +2 -2
- package/dist/canonicalHierarchy.d.ts +16 -0
- package/dist/canonicalHierarchy.d.ts.map +1 -0
- package/dist/canonicalHierarchy.js +214 -0
- package/dist/canonicalHierarchy.js.map +1 -0
- package/dist/index.d.ts +1 -0
- package/dist/index.d.ts.map +1 -1
- package/dist/index.js +190 -25
- package/dist/index.js.map +1 -1
- package/dist/konclude.mjs +1 -1
- package/dist/konclude.wasm +0 -0
- package/dist/konclude.wasm.v069-backup +0 -0
- package/dist/konclude.wasm.v070-backup +0 -0
- package/dist/types.d.ts +4 -0
- package/dist/types.d.ts.map +1 -1
- package/dist/worker.js +1 -1
- package/dist/worker.js.map +1 -1
- package/package.json +1 -1
package/README.md
CHANGED
|
@@ -623,10 +623,10 @@ Violation detection verified against native Konclude v0.7.0 ground truth:
|
|
|
623
623
|
| 14 | `DataAllValuesFrom xsd:minInclusive` (inconsistent case) | inconsistent ✓ | inconsistent ✓ | **PARITY** |
|
|
624
624
|
| 15 | `owl:hasSelf(p)` + `owl:hasSelf(q)` + `p owl:propertyDisjointWith q` | inconsistent ✓ | inconsistent ✓ | **PARITY** (patch-022) |
|
|
625
625
|
| 16 | `owl:ReflexiveProperty(p)` + `owl:hasSelf(q)` + `p owl:propertyDisjointWith q` | inconsistent ✓ | inconsistent ✓ | **PARITY** (patch-022) |
|
|
626
|
+
| 17 | `owl:AsymmetricProperty(r)` + `r(a, a)` self-loop | inconsistent ✓ | inconsistent ✓ | **PARITY (WASM surpasses native)** (patch-027) |
|
|
626
627
|
|
|
627
628
|
**PARITY (WASM surpasses native v0.7.0)** means native Konclude v0.7.0 has a kernel bug for this
|
|
628
|
-
construct; this package fixes it via
|
|
629
|
-
saturation clash detection; AllDisjointProperties + EquivalentObjectProperties clash fix).
|
|
629
|
+
construct; this package fixes it via patch-027 (AsymmetricProperty self-loop saturation clash detection).
|
|
630
630
|
|
|
631
631
|
`owl:AllDisjointClasses`, `owl:disjointUnionOf`, and `owl:NegativePropertyAssertion` all work in
|
|
632
632
|
`materialize()` — the JS layer expands list axioms to pairwise form before handing off to WASM.
|
|
@@ -0,0 +1,16 @@
|
|
|
1
|
+
export type Edge = readonly [string, string];
|
|
2
|
+
/**
|
|
3
|
+
* Canonical inferred named-class subsumption edges for a reasoning base.
|
|
4
|
+
*
|
|
5
|
+
* Deterministic: the result depends only on the SET of asserted+inferred edges, never on
|
|
6
|
+
* their order or on which redundant subset the reasoner happened to report. Closure-
|
|
7
|
+
* preserving: `closure(asserted ∪ result) === closure(asserted ∪ inferred)`.
|
|
8
|
+
*
|
|
9
|
+
* @param asserted named-class subClassOf edges already present outside the inferred graph
|
|
10
|
+
* @param inferred named-class subClassOf edges the reasoner materialised
|
|
11
|
+
* @returns the canonical edges to materialise (asserted edges are never re-emitted)
|
|
12
|
+
*/
|
|
13
|
+
export declare function canonicalInferredHierarchy(asserted: readonly Edge[], inferred: readonly Edge[]): Edge[];
|
|
14
|
+
/** Transitive closure over the edge set — exported for the regression test. */
|
|
15
|
+
export declare function transitiveClosure(edges: readonly Edge[]): Set<string>;
|
|
16
|
+
//# sourceMappingURL=canonicalHierarchy.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"canonicalHierarchy.d.ts","sourceRoot":"","sources":["../ts/canonicalHierarchy.ts"],"names":[],"mappings":"AAqBA,MAAM,MAAM,IAAI,GAAG,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;AA8F7C;;;;;;;;;;GAUG;AACH,wBAAgB,0BAA0B,CACxC,QAAQ,EAAE,SAAS,IAAI,EAAE,EACzB,QAAQ,EAAE,SAAS,IAAI,EAAE,GACxB,IAAI,EAAE,CAiDR;AAED,+EAA+E;AAC/E,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,SAAS,IAAI,EAAE,GAAG,GAAG,CAAC,MAAM,CAAC,CAerE"}
|
|
@@ -0,0 +1,214 @@
|
|
|
1
|
+
// src/workers/canonicalHierarchy.ts
|
|
2
|
+
//
|
|
3
|
+
// WHY THIS EXISTS
|
|
4
|
+
// ---------------
|
|
5
|
+
// Konclude reports the inferred named-class hierarchy as a transitive reduction, but the
|
|
6
|
+
// reduction it picks is NOT canonical: across independent cold sessions on a byte-identical
|
|
7
|
+
// reasoning base it emits different subsets of the redundant subsumption edges. Measured on
|
|
8
|
+
// PMDco @3b98aad + the Fe-Si record, ten cold sessions returned 380-389 inferred triples,
|
|
9
|
+
// and all 59 differing statements were rdfs:subClassOf between named classes. The transitive
|
|
10
|
+
// CLOSURE was identical (8246 statements) in every run, so no entailment varies — but the
|
|
11
|
+
// materialised graph, the triple counts we publish, and anything diffing sessions all do.
|
|
12
|
+
//
|
|
13
|
+
// This module makes the emitted hierarchy a function of the entailed hierarchy alone:
|
|
14
|
+
// compute the closure, then take THE canonical transitive reduction of it. Equivalent
|
|
15
|
+
// classes (cycles) are handled by reducing the condensation and emitting a deterministic
|
|
16
|
+
// ring inside each cycle, so the closure is preserved exactly.
|
|
17
|
+
//
|
|
18
|
+
// Scope: named-class rdfs:subClassOf only. Blank-node class expressions, rdf:type and every
|
|
19
|
+
// other materialised predicate are passed through untouched — the observed variance was
|
|
20
|
+
// confined to named-class subsumption.
|
|
21
|
+
const key = (a, b) => `${a} ${b}`;
|
|
22
|
+
function adjacency(edges) {
|
|
23
|
+
const m = new Map();
|
|
24
|
+
for (const [a, b] of edges) {
|
|
25
|
+
let s = m.get(a);
|
|
26
|
+
if (!s)
|
|
27
|
+
m.set(a, (s = new Set()));
|
|
28
|
+
s.add(b);
|
|
29
|
+
}
|
|
30
|
+
return m;
|
|
31
|
+
}
|
|
32
|
+
/**
|
|
33
|
+
* Tarjan's SCC, iterative (the class graph can be deep and a recursive version risks a
|
|
34
|
+
* stack overflow inside the worker). Returns every strongly connected component; a
|
|
35
|
+
* component with more than one member is a set of mutually equivalent classes.
|
|
36
|
+
*/
|
|
37
|
+
function stronglyConnectedComponents(edges) {
|
|
38
|
+
const g = adjacency(edges);
|
|
39
|
+
const nodes = new Set();
|
|
40
|
+
for (const [a, b] of edges) {
|
|
41
|
+
nodes.add(a);
|
|
42
|
+
nodes.add(b);
|
|
43
|
+
}
|
|
44
|
+
const index = new Map();
|
|
45
|
+
const low = new Map();
|
|
46
|
+
const onStack = new Set();
|
|
47
|
+
const stack = [];
|
|
48
|
+
const out = [];
|
|
49
|
+
let counter = 0;
|
|
50
|
+
for (const root of nodes) {
|
|
51
|
+
if (index.has(root))
|
|
52
|
+
continue;
|
|
53
|
+
// frame: [node, iterator over successors]
|
|
54
|
+
const work = [
|
|
55
|
+
{ v: root, it: (g.get(root) ?? new Set())[Symbol.iterator]() },
|
|
56
|
+
];
|
|
57
|
+
index.set(root, counter);
|
|
58
|
+
low.set(root, counter);
|
|
59
|
+
counter++;
|
|
60
|
+
stack.push(root);
|
|
61
|
+
onStack.add(root);
|
|
62
|
+
while (work.length) {
|
|
63
|
+
const frame = work[work.length - 1];
|
|
64
|
+
const step = frame.it.next();
|
|
65
|
+
if (!step.done) {
|
|
66
|
+
const w = step.value;
|
|
67
|
+
if (!index.has(w)) {
|
|
68
|
+
index.set(w, counter);
|
|
69
|
+
low.set(w, counter);
|
|
70
|
+
counter++;
|
|
71
|
+
stack.push(w);
|
|
72
|
+
onStack.add(w);
|
|
73
|
+
work.push({ v: w, it: (g.get(w) ?? new Set())[Symbol.iterator]() });
|
|
74
|
+
}
|
|
75
|
+
else if (onStack.has(w)) {
|
|
76
|
+
low.set(frame.v, Math.min(low.get(frame.v), index.get(w)));
|
|
77
|
+
}
|
|
78
|
+
}
|
|
79
|
+
else {
|
|
80
|
+
work.pop();
|
|
81
|
+
const v = frame.v;
|
|
82
|
+
if (work.length) {
|
|
83
|
+
const parent = work[work.length - 1].v;
|
|
84
|
+
low.set(parent, Math.min(low.get(parent), low.get(v)));
|
|
85
|
+
}
|
|
86
|
+
if (low.get(v) === index.get(v)) {
|
|
87
|
+
const comp = [];
|
|
88
|
+
let w;
|
|
89
|
+
do {
|
|
90
|
+
w = stack.pop();
|
|
91
|
+
onStack.delete(w);
|
|
92
|
+
comp.push(w);
|
|
93
|
+
} while (w !== v);
|
|
94
|
+
out.push(comp);
|
|
95
|
+
}
|
|
96
|
+
}
|
|
97
|
+
}
|
|
98
|
+
}
|
|
99
|
+
return out;
|
|
100
|
+
}
|
|
101
|
+
/** Transitive reduction of a DAG: keep (a,b) only when b is unreachable from a via a path of length >= 2. */
|
|
102
|
+
function reduceDag(edges) {
|
|
103
|
+
const g = adjacency(edges);
|
|
104
|
+
const kept = [];
|
|
105
|
+
for (const [a, b] of edges) {
|
|
106
|
+
let redundant = false;
|
|
107
|
+
for (const mid of g.get(a) ?? []) {
|
|
108
|
+
if (mid === b)
|
|
109
|
+
continue;
|
|
110
|
+
// depth-first from mid; if it reaches b, the direct edge (a,b) is implied
|
|
111
|
+
const seen = new Set([mid]);
|
|
112
|
+
const stack = [mid];
|
|
113
|
+
while (stack.length) {
|
|
114
|
+
const n = stack.pop();
|
|
115
|
+
if (n === b) {
|
|
116
|
+
redundant = true;
|
|
117
|
+
break;
|
|
118
|
+
}
|
|
119
|
+
for (const x of g.get(n) ?? [])
|
|
120
|
+
if (!seen.has(x)) {
|
|
121
|
+
seen.add(x);
|
|
122
|
+
stack.push(x);
|
|
123
|
+
}
|
|
124
|
+
}
|
|
125
|
+
if (redundant)
|
|
126
|
+
break;
|
|
127
|
+
}
|
|
128
|
+
if (!redundant)
|
|
129
|
+
kept.push([a, b]);
|
|
130
|
+
}
|
|
131
|
+
return kept;
|
|
132
|
+
}
|
|
133
|
+
/**
|
|
134
|
+
* Canonical inferred named-class subsumption edges for a reasoning base.
|
|
135
|
+
*
|
|
136
|
+
* Deterministic: the result depends only on the SET of asserted+inferred edges, never on
|
|
137
|
+
* their order or on which redundant subset the reasoner happened to report. Closure-
|
|
138
|
+
* preserving: `closure(asserted ∪ result) === closure(asserted ∪ inferred)`.
|
|
139
|
+
*
|
|
140
|
+
* @param asserted named-class subClassOf edges already present outside the inferred graph
|
|
141
|
+
* @param inferred named-class subClassOf edges the reasoner materialised
|
|
142
|
+
* @returns the canonical edges to materialise (asserted edges are never re-emitted)
|
|
143
|
+
*/
|
|
144
|
+
export function canonicalInferredHierarchy(asserted, inferred) {
|
|
145
|
+
const all = [...asserted, ...inferred];
|
|
146
|
+
if (all.length === 0)
|
|
147
|
+
return [];
|
|
148
|
+
const comps = stronglyConnectedComponents(all);
|
|
149
|
+
// Deterministic representative per component: the lexicographically smallest IRI.
|
|
150
|
+
const repOf = new Map();
|
|
151
|
+
const membersOf = new Map();
|
|
152
|
+
for (const comp of comps) {
|
|
153
|
+
const sorted = [...comp].sort();
|
|
154
|
+
const rep = sorted[0];
|
|
155
|
+
for (const m of sorted)
|
|
156
|
+
repOf.set(m, rep);
|
|
157
|
+
membersOf.set(rep, sorted);
|
|
158
|
+
}
|
|
159
|
+
// Condensation: edges between distinct components, deduplicated and sorted.
|
|
160
|
+
const condensed = new Set();
|
|
161
|
+
for (const [a, b] of all) {
|
|
162
|
+
const ra = repOf.get(a) ?? a;
|
|
163
|
+
const rb = repOf.get(b) ?? b;
|
|
164
|
+
if (ra !== rb)
|
|
165
|
+
condensed.add(key(ra, rb));
|
|
166
|
+
}
|
|
167
|
+
const condensedEdges = [...condensed]
|
|
168
|
+
.sort()
|
|
169
|
+
.map((k) => k.split(' '));
|
|
170
|
+
const result = [...reduceDag(condensedEdges)];
|
|
171
|
+
// Re-materialise each equivalence cycle as a deterministic ring over its sorted members,
|
|
172
|
+
// so members remain mutually derivable and the closure is unchanged.
|
|
173
|
+
for (const [, members] of membersOf) {
|
|
174
|
+
if (members.length < 2)
|
|
175
|
+
continue;
|
|
176
|
+
for (let i = 0; i < members.length; i++) {
|
|
177
|
+
result.push([members[i], members[(i + 1) % members.length]]);
|
|
178
|
+
}
|
|
179
|
+
}
|
|
180
|
+
const assertedSet = new Set(asserted.map(([a, b]) => key(a, b)));
|
|
181
|
+
const seen = new Set();
|
|
182
|
+
const out = [];
|
|
183
|
+
for (const [a, b] of result) {
|
|
184
|
+
const k = key(a, b);
|
|
185
|
+
if (a === b || assertedSet.has(k) || seen.has(k))
|
|
186
|
+
continue;
|
|
187
|
+
seen.add(k);
|
|
188
|
+
out.push([a, b]);
|
|
189
|
+
}
|
|
190
|
+
// Stable order so serialisations and diffs are reproducible too.
|
|
191
|
+
out.sort((x, y) => (x[0] === y[0] ? x[1].localeCompare(y[1]) : x[0].localeCompare(y[0])));
|
|
192
|
+
return out;
|
|
193
|
+
}
|
|
194
|
+
/** Transitive closure over the edge set — exported for the regression test. */
|
|
195
|
+
export function transitiveClosure(edges) {
|
|
196
|
+
const g = adjacency(edges);
|
|
197
|
+
const out = new Set();
|
|
198
|
+
for (const start of g.keys()) {
|
|
199
|
+
const seen = new Set();
|
|
200
|
+
const stack = [...(g.get(start) ?? [])];
|
|
201
|
+
while (stack.length) {
|
|
202
|
+
const n = stack.pop();
|
|
203
|
+
if (seen.has(n))
|
|
204
|
+
continue;
|
|
205
|
+
seen.add(n);
|
|
206
|
+
out.add(key(start, n));
|
|
207
|
+
for (const m of g.get(n) ?? [])
|
|
208
|
+
if (!seen.has(m))
|
|
209
|
+
stack.push(m);
|
|
210
|
+
}
|
|
211
|
+
}
|
|
212
|
+
return out;
|
|
213
|
+
}
|
|
214
|
+
//# sourceMappingURL=canonicalHierarchy.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"canonicalHierarchy.js","sourceRoot":"","sources":["../ts/canonicalHierarchy.ts"],"names":[],"mappings":"AAAA,oCAAoC;AACpC,EAAE;AACF,kBAAkB;AAClB,kBAAkB;AAClB,yFAAyF;AACzF,4FAA4F;AAC5F,4FAA4F;AAC5F,0FAA0F;AAC1F,6FAA6F;AAC7F,0FAA0F;AAC1F,0FAA0F;AAC1F,EAAE;AACF,sFAAsF;AACtF,sFAAsF;AACtF,yFAAyF;AACzF,+DAA+D;AAC/D,EAAE;AACF,4FAA4F;AAC5F,wFAAwF;AACxF,uCAAuC;AAIvC,MAAM,GAAG,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;AAElD,SAAS,SAAS,CAAC,KAAsB;IACvC,MAAM,CAAC,GAAG,IAAI,GAAG,EAAuB,CAAC;IACzC,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,KAAK,EAAE,CAAC;QAC3B,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACjB,IAAI,CAAC,CAAC;YAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC;QAClC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACX,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED;;;;GAIG;AACH,SAAS,2BAA2B,CAAC,KAAsB;IACzD,MAAM,CAAC,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC;IAC3B,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;IAChC,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,KAAK,EAAE,CAAC;QAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAAC,CAAC;IAE3D,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,MAAM,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAC;IACtC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,GAAG,GAAe,EAAE,CAAC;IAC3B,IAAI,OAAO,GAAG,CAAC,CAAC;IAEhB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,SAAS;QAC9B,0CAA0C;QAC1C,MAAM,IAAI,GAA+C;YACvD,EAAE,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,EAAE;SACvE,CAAC;QACF,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QAAC,OAAO,EAAE,CAAC;QAC5D,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAEpC,OAAO,IAAI,CAAC,MAAM,EAAE,CAAC;YACnB,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACpC,MAAM,IAAI,GAAG,KAAK,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;YAC7B,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;gBACf,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC;gBACrB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBAClB,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;oBAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;oBAAC,OAAO,EAAE,CAAC;oBACtD,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;oBAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBAC9B,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,EAAE,CAAC,CAAC;gBAC9E,CAAC;qBAAM,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBAC1B,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAE,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC;gBAC/D,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,GAAG,EAAE,CAAC;gBACX,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;gBAClB,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;oBAChB,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;oBACvC,GAAG,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAE,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC;gBAC3D,CAAC;gBACD,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBAChC,MAAM,IAAI,GAAa,EAAE,CAAC;oBAC1B,IAAI,CAAS,CAAC;oBACd,GAAG,CAAC;wBAAC,CAAC,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;wBAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;wBAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;oBAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE;oBAC1E,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACjB,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,6GAA6G;AAC7G,SAAS,SAAS,CAAC,KAAsB;IACvC,MAAM,CAAC,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC;IAC3B,MAAM,IAAI,GAAW,EAAE,CAAC;IACxB,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,KAAK,EAAE,CAAC;QAC3B,IAAI,SAAS,GAAG,KAAK,CAAC;QACtB,KAAK,MAAM,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;YACjC,IAAI,GAAG,KAAK,CAAC;gBAAE,SAAS;YACxB,0EAA0E;YAC1E,MAAM,IAAI,GAAG,IAAI,GAAG,CAAS,CAAC,GAAG,CAAC,CAAC,CAAC;YACpC,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC;YACpB,OAAO,KAAK,CAAC,MAAM,EAAE,CAAC;gBACpB,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;gBACvB,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;oBAAC,SAAS,GAAG,IAAI,CAAC;oBAAC,MAAM;gBAAC,CAAC;gBACzC,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE;oBAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;wBAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;wBAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;oBAAC,CAAC;YACnF,CAAC;YACD,IAAI,SAAS;gBAAE,MAAM;QACvB,CAAC;QACD,IAAI,CAAC,SAAS;YAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACpC,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,0BAA0B,CACxC,QAAyB,EACzB,QAAyB;IAEzB,MAAM,GAAG,GAAW,CAAC,GAAG,QAAQ,EAAE,GAAG,QAAQ,CAAC,CAAC;IAC/C,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAEhC,MAAM,KAAK,GAAG,2BAA2B,CAAC,GAAG,CAAC,CAAC;IAC/C,kFAAkF;IAClF,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC9C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;QAChC,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACtB,KAAK,MAAM,CAAC,IAAI,MAAM;YAAE,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QAC1C,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;IAC7B,CAAC;IAED,4EAA4E;IAC5E,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;IACpC,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,GAAG,EAAE,CAAC;QACzB,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAC7B,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAC7B,IAAI,EAAE,KAAK,EAAE;YAAE,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;IAC5C,CAAC;IACD,MAAM,cAAc,GAAW,CAAC,GAAG,SAAS,CAAC;SAC1C,IAAI,EAAE;SACN,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAoB,CAAC,CAAC;IAE/C,MAAM,MAAM,GAAW,CAAC,GAAG,SAAS,CAAC,cAAc,CAAC,CAAC,CAAC;IAEtD,yFAAyF;IACzF,qEAAqE;IACrE,KAAK,MAAM,CAAC,EAAE,OAAO,CAAC,IAAI,SAAS,EAAE,CAAC;QACpC,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC;YAAE,SAAS;QACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC/D,CAAC;IACH,CAAC;IAED,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACjE,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,GAAG,GAAW,EAAE,CAAC;IACvB,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,MAAM,EAAE,CAAC;QAC5B,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACpB,IAAI,CAAC,KAAK,CAAC,IAAI,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,SAAS;QAC3D,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACnB,CAAC;IACD,iEAAiE;IACjE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1F,OAAO,GAAG,CAAC;AACb,CAAC;AAED,+EAA+E;AAC/E,MAAM,UAAU,iBAAiB,CAAC,KAAsB;IACtD,MAAM,CAAC,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC;IAC3B,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;IAC9B,KAAK,MAAM,KAAK,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;QAC7B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/B,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QACxC,OAAO,KAAK,CAAC,MAAM,EAAE,CAAC;YACpB,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;YACvB,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,SAAS;YAC1B,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACZ,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC;YACvB,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE;gBAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;oBAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAClE,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC"}
|
package/dist/index.d.ts
CHANGED
|
@@ -44,6 +44,7 @@ export declare class RdfReasoner {
|
|
|
44
44
|
private _lastExplBuffer;
|
|
45
45
|
private _lastPropertyExplBuffer;
|
|
46
46
|
private _entailmentProbeCounter;
|
|
47
|
+
private readonly _onTrace;
|
|
47
48
|
constructor(opts?: RdfReasonerOptions);
|
|
48
49
|
/**
|
|
49
50
|
* Send a method call to the Worker and return a Promise for the result.
|
package/dist/index.d.ts.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../ts/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,cAAc,CAAC;AACzC,OAAO,EAAE,KAAK,EAAe,MAAM,IAAI,CAAC;AAcxC,YAAY,EAAE,gBAAgB,EAAE,eAAe,EAAE,qBAAqB,EAAE,kBAAkB,EAAE,uBAAuB,EAAE,8BAA8B,EAAE,cAAc,EAAE,aAAa,EAAE,cAAc,EAAE,YAAY,EAAE,gBAAgB,EAAE,eAAe,EAAE,kBAAkB,EAAE,gBAAgB,EAAE,wBAAwB,EAAE,WAAW,EAAE,oBAAoB,EAAE,qBAAqB,EAAE,MAAM,YAAY,CAAC;AAClY,OAAO,EAAE,kBAAkB,EAAE,gBAAgB,EAAE,qBAAqB,EAAE,KAAK,EAAE,gBAAgB,EAAE,YAAY,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAC1I,OAAO,EAAE,kBAAkB,EAAE,MAAM,mBAAmB,CAAC;AACvD,OAAO,EAAE,kBAAkB,EAAE,MAAM,eAAe,CAAC;AACnD,OAAO,KAAK,EAAE,gBAAgB,EAAmB,qBAAqB,EAAE,kBAAkB,EAAE,uBAAuB,EAAE,8BAA8B,EAAE,cAAc,EAAE,aAAa,EAAE,cAAc,EAAgB,gBAAgB,EAAE,eAAe,EAAE,kBAAkB,EAAE,gBAAgB,EAAE,wBAAwB,EAAe,oBAAoB,EAAE,qBAAqB,EAAE,MAAM,YAAY,CAAC;
|
|
1
|
+
{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../ts/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,cAAc,CAAC;AACzC,OAAO,EAAE,KAAK,EAAe,MAAM,IAAI,CAAC;AAcxC,YAAY,EAAE,gBAAgB,EAAE,eAAe,EAAE,qBAAqB,EAAE,kBAAkB,EAAE,uBAAuB,EAAE,8BAA8B,EAAE,cAAc,EAAE,aAAa,EAAE,cAAc,EAAE,YAAY,EAAE,gBAAgB,EAAE,eAAe,EAAE,kBAAkB,EAAE,gBAAgB,EAAE,wBAAwB,EAAE,WAAW,EAAE,oBAAoB,EAAE,qBAAqB,EAAE,MAAM,YAAY,CAAC;AAClY,OAAO,EAAE,kBAAkB,EAAE,gBAAgB,EAAE,qBAAqB,EAAE,KAAK,EAAE,gBAAgB,EAAE,YAAY,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAC1I,OAAO,EAAE,kBAAkB,EAAE,MAAM,mBAAmB,CAAC;AACvD,OAAO,EAAE,kBAAkB,EAAE,MAAM,eAAe,CAAC;AACnD,OAAO,KAAK,EAAE,gBAAgB,EAAmB,qBAAqB,EAAE,kBAAkB,EAAE,uBAAuB,EAAE,8BAA8B,EAAE,cAAc,EAAE,aAAa,EAAE,cAAc,EAAgB,gBAAgB,EAAE,eAAe,EAAE,kBAAkB,EAAE,gBAAgB,EAAE,wBAAwB,EAAe,oBAAoB,EAAE,qBAAqB,EAAE,MAAM,YAAY,CAAC;AAsJlY,qBAAa,WAAW;IACtB,8EAA8E;IAC9E,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAC,IAAI,CAAC,CAAC;IAE9B,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAS;IAChC,OAAO,CAAC,MAAM,CAAK;IACnB,OAAO,CAAC,QAAQ,CAAC,OAAO,CAGpB;IAEJ;;;;OAIG;IACH,OAAO,CAAC,MAAM,CAAoC;IAOlD,OAAO,CAAC,cAAc,CAA6D;IACnF,OAAO,CAAC,iBAAiB,CAA6D;IACtF,OAAO,CAAC,wBAAwB,CAA6D;IAC7F,OAAO,CAAC,iBAAiB,CAAkD;IAG3E,OAAO,CAAC,eAAe,CAA4B;IACnD,OAAO,CAAC,uBAAuB,CAA4B;IAC3D,OAAO,CAAC,uBAAuB,CAAK;IACpC,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAsC;gBAEnD,IAAI,CAAC,EAAE,kBAAkB;IAuFrC;;;OAGG;IACH,OAAO,CAAC,KAAK;YAaC,iCAAiC;IAkB/C;;6DAEyD;IACzD,MAAM,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,qBAAqB,GAAG,OAAO,CAAC,IAAI,CAAC;IACjE;;;;;;;;;;OAUG;IACH,MAAM,CAAC,KAAK,EAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,EAAE,gBAAgB,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC;IAWvE,OAAO,CAAC,cAAc;IA2GtB,OAAO,CAAC,cAAc;IAuCtB;;;;;;;wCAOoC;IACpC,QAAQ,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,qBAAqB,GAAG,OAAO,CAAC,IAAI,CAAC;IACnE;;;;;;OAMG;IACH,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC;IAehD,qEAAqE;IACrE,gBAAgB,CAAC,KAAK,EAAE,KAAK,GAAG,OAAO,CAAC,OAAO,CAAC;IAChD;;;;;;;;OAQG;IAIH,gBAAgB,CAAC,KAAK,EAAE,QAAQ,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,OAAO,CAAC;IAmCzD;;;;;;;;;;;;;;;;;;;2EAmBuE;IACvE,WAAW,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,uBAAuB,GAAG;QAAE,WAAW,EAAE,IAAI,CAAA;KAAE,GAAG,OAAO,CAAC;QAAE,KAAK,EAAE,cAAc,CAAA;KAAE,CAAC;IACpH,WAAW,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,uBAAuB,GAAG,OAAO,CAAC,IAAI,CAAC;IACxE;;;;;;;;;;;;;;;OAeG;IACH,WAAW,CAAC,KAAK,EAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,EAAE,kBAAkB,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC;IAW9E,OAAO,CAAC,mBAAmB;IA4J3B,OAAO,CAAC,mBAAmB;IAiC3B;;8EAE0E;IAC1E,kBAAkB,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,8BAA8B,GAAG,OAAO,CAAC,IAAI,CAAC;IACtF;;;;;;;;;;OAUG;IACH,kBAAkB,CAAC,KAAK,EAAE,QAAQ,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC;IAW1D,OAAO,CAAC,0BAA0B;IA0DlC,OAAO,CAAC,0BAA0B;IAwBlC,OAAO,CAAC,eAAe;YAcT,eAAe;YAuBf,kBAAkB;YAwBlB,yBAAyB;IAwBvC;;;;;OAKG;YACW,gCAAgC;IAwB9C;;0EAEsE;IACtE,uBAAuB,CAAC,KAAK,EAAE,KAAK,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;IAQxD;;sFAEkF;IAClF,aAAa,CAAC,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC;IAa/D;;mEAE+D;IAC/D,UAAU,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE;QAAE,aAAa,CAAC,EAAE,MAAM,CAAA;KAAE,GAAG,OAAO,CAAC,OAAO,GAAG,IAAI,CAAC;IACjG;;uCAEmC;IACnC,UAAU,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,IAAI,CAAC,EAAE;QAAE,aAAa,CAAC,EAAE,MAAM,CAAA;KAAE,GAAG,OAAO,CAAC,CAAC,OAAO,GAAG,IAAI,CAAC,EAAE,CAAC;IA6FxG;;;;;;;;;;OAUG;IAGH,MAAM,CAAC,KAAK,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,EAAE,IAAI,CAAC,EAAE,aAAa,GAAG;QAAE,aAAa,CAAC,EAAE,MAAM,CAAA;KAAE,GAAG,OAAO,CAAC;QAAE,KAAK,EAAE,IAAI,EAAE,CAAC;QAAC,OAAO,EAAE,IAAI,EAAE,CAAA;KAAE,CAAC;IAkFvI;;;;;OAKG;IACH,OAAO,CAAC,WAAW;IAiBnB,OAAO,CAAC,qBAAqB;IAa7B,OAAO,CAAC,WAAW;YAiBL,sBAAsB;IAsBpC;;;;OAIG;YACW,yBAAyB;IAQvC;;;;;OAKG;YACW,4BAA4B;YAQ5B,mBAAmB;YAInB,mBAAmB;YAInB,yBAAyB;YAIzB,+BAA+B;YAI/B,6BAA6B;IAI3C,iEAAiE;IAC3D,uBAAuB,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;IAI3D,8DAA8D;IACxD,oBAAoB,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;IAKxD,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,kBAAkB,CAAK;IAC/C,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,eAAe,CAAK;IAC5C,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,wBAAwB,CAAK;YAEvC,6BAA6B;YAI7B,6BAA6B;IAI3C,OAAO,CAAC,6BAA6B;IAsBrC,OAAO,CAAC,2BAA2B;IAkBnC,OAAO,CAAC,mCAAmC;IAyB3C,OAAO,CAAC,oCAAoC;IAqB5C,OAAO,CAAC,mCAAmC;IAgH3C;;;;;;;;;;OAUG;IACH,OAAO,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,cAAc,GAAG,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC;IA4J5E;;;;;;OAMG;IACH,oBAAoB,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,cAAc,GAAG,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC;IAkI5E;;;;;;;;OAQG;IACH,2BAA2B,CACzB,KAAK,EAAE,KAAK,EACZ,IAAI,CAAC,EAAE,qBAAqB,GAC3B,OAAO,CAAC,KAAK,CAAC;QAAE,aAAa,EAAE,IAAI,EAAE,CAAC;QAAC,OAAO,EAAE,oBAAoB,CAAA;KAAE,CAAC,CAAC;IAoL3E;;;;;;;;;;OAUG;IACH,iBAAiB,CACf,KAAK,EAAE,KAAK,EACZ,UAAU,EAAE,MAAM,EAClB,YAAY,EAAE,MAAM,EACpB,SAAS,EAAE,MAAM,EACjB,IAAI,CAAC,EAAE,wBAAwB,GAC9B,OAAO,CAAC,gBAAgB,CAAC;IA2nB5B;;;;;;;;;;OAUG;IACH,QAAQ,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,eAAe,GAAG,OAAO,CAAC,gBAAgB,CAAC;IAiMzE;;;;;;;;;;;;OAYG;IACH,SAAS,IAAI,IAAI;IAUjB,uEAAuE;IACvE,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,IAAI;CAGzB"}
|