@stevenvo780/st-lang 4.1.0 → 4.3.0

package/dist/profiles/default-logic/types.js

@@ -0,0 +1,25 @@
+"use strict";
+// ============================================================
+// ST Default Logic (Reiter) — Tipos
+// ============================================================
+//
+// Lógica default de Reiter (1980). Una default rule:
+//
+//     α : β1, ..., βn / γ
+//
+// significa "si α se cree y cada βi es consistente con las creencias
+// actuales, entonces concluye γ". Una extensión es un punto fijo del
+// operador inducido por la teoría: el conjunto de creencias estable
+// donde todos los defaults aplicables ya fueron aplicados y ninguno
+// más aplica sin generar inconsistencia.
+//
+// Limitación v1: prerequisites, justifications y consequents son
+// literales (ground): "P" o "¬P". La consistencia se verifica buscando
+// pares L/¬L en el conjunto de creencias. Esto cubre todos los
+// ejemplos clásicos (Tweety, Nixon-diamond, etc.) sin SAT completo.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.DEFAULT_MAX_DEFAULTS = exports.DEFAULT_MAX_EXTENSIONS = void 0;
+exports.DEFAULT_MAX_EXTENSIONS = 64;
+exports.DEFAULT_MAX_DEFAULTS = 64;
+//# sourceMappingURL=types.js.map

package/dist/profiles/default-logic/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../src/profiles/default-logic/types.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,oCAAoC;AACpC,+DAA+D;AAC/D,EAAE;AACF,qDAAqD;AACrD,EAAE;AACF,0BAA0B;AAC1B,EAAE;AACF,qEAAqE;AACrE,qEAAqE;AACrE,oEAAoE;AACpE,oEAAoE;AACpE,yCAAyC;AACzC,EAAE;AACF,iEAAiE;AACjE,uEAAuE;AACvE,+DAA+D;AAC/D,oEAAoE;AACpE,+DAA+D;;;AAgClD,QAAA,sBAAsB,GAAG,EAAE,CAAC;AAC5B,QAAA,oBAAoB,GAAG,EAAE,CAAC"}

package/dist/profiles/description-logic/index.d.ts

@@ -0,0 +1,5 @@
+export type { DLConcept, DLConceptKind, DLAxiom, DLAxiomKind, DLKnowledgeBase } from './types';
+export { TOP, BOTTOM, atomic, not, and, or, exists, forall, subsumes, equivalent, instance, roleInstance, emptyKB, } from './types';
+export { toNNF, conceptHash, conceptEqual, conceptToString } from './nnf';
+export { isSatisfiable, isSubsumed, isInstance, classify } from './tableau';
+//# sourceMappingURL=index.d.ts.map

package/dist/profiles/description-logic/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/profiles/description-logic/index.ts"],"names":[],"mappings":"AAYA,YAAY,EAAE,SAAS,EAAE,aAAa,EAAE,OAAO,EAAE,WAAW,EAAE,eAAe,EAAE,MAAM,SAAS,CAAC;AAE/F,OAAO,EACL,GAAG,EACH,MAAM,EACN,MAAM,EACN,GAAG,EACH,GAAG,EACH,EAAE,EACF,MAAM,EACN,MAAM,EACN,QAAQ,EACR,UAAU,EACV,QAAQ,EACR,YAAY,EACZ,OAAO,GACR,MAAM,SAAS,CAAC;AAEjB,OAAO,EAAE,KAAK,EAAE,WAAW,EAAE,YAAY,EAAE,eAAe,EAAE,MAAM,OAAO,CAAC;AAE1E,OAAO,EAAE,aAAa,EAAE,UAAU,EAAE,UAAU,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC"}

package/dist/profiles/description-logic/index.js

@@ -0,0 +1,39 @@
+"use strict";
+// ============================================================
+// ST Description Logic — Public API (ALC profile)
+// ============================================================
+// Perfil ALC: el fragmento base de OWL/DL. Provee un decisor
+// completo y terminante para satisfacibilidad de conceptos,
+// subsumption, instance checking y clasificación.
+//
+// Procedimiento: tableau con subset blocking. Termina sobre KBs
+// cíclicas. NO se inscribe en el ProfileRegistry (esto es un módulo
+// de razonamiento independiente, no un perfil sentencial textual).
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.classify = exports.isInstance = exports.isSubsumed = exports.isSatisfiable = exports.conceptToString = exports.conceptEqual = exports.conceptHash = exports.toNNF = exports.emptyKB = exports.roleInstance = exports.instance = exports.equivalent = exports.subsumes = exports.forall = exports.exists = exports.or = exports.and = exports.not = exports.atomic = exports.BOTTOM = exports.TOP = void 0;
+var types_1 = require("./types");
+Object.defineProperty(exports, "TOP", { enumerable: true, get: function () { return types_1.TOP; } });
+Object.defineProperty(exports, "BOTTOM", { enumerable: true, get: function () { return types_1.BOTTOM; } });
+Object.defineProperty(exports, "atomic", { enumerable: true, get: function () { return types_1.atomic; } });
+Object.defineProperty(exports, "not", { enumerable: true, get: function () { return types_1.not; } });
+Object.defineProperty(exports, "and", { enumerable: true, get: function () { return types_1.and; } });
+Object.defineProperty(exports, "or", { enumerable: true, get: function () { return types_1.or; } });
+Object.defineProperty(exports, "exists", { enumerable: true, get: function () { return types_1.exists; } });
+Object.defineProperty(exports, "forall", { enumerable: true, get: function () { return types_1.forall; } });
+Object.defineProperty(exports, "subsumes", { enumerable: true, get: function () { return types_1.subsumes; } });
+Object.defineProperty(exports, "equivalent", { enumerable: true, get: function () { return types_1.equivalent; } });
+Object.defineProperty(exports, "instance", { enumerable: true, get: function () { return types_1.instance; } });
+Object.defineProperty(exports, "roleInstance", { enumerable: true, get: function () { return types_1.roleInstance; } });
+Object.defineProperty(exports, "emptyKB", { enumerable: true, get: function () { return types_1.emptyKB; } });
+var nnf_1 = require("./nnf");
+Object.defineProperty(exports, "toNNF", { enumerable: true, get: function () { return nnf_1.toNNF; } });
+Object.defineProperty(exports, "conceptHash", { enumerable: true, get: function () { return nnf_1.conceptHash; } });
+Object.defineProperty(exports, "conceptEqual", { enumerable: true, get: function () { return nnf_1.conceptEqual; } });
+Object.defineProperty(exports, "conceptToString", { enumerable: true, get: function () { return nnf_1.conceptToString; } });
+var tableau_1 = require("./tableau");
+Object.defineProperty(exports, "isSatisfiable", { enumerable: true, get: function () { return tableau_1.isSatisfiable; } });
+Object.defineProperty(exports, "isSubsumed", { enumerable: true, get: function () { return tableau_1.isSubsumed; } });
+Object.defineProperty(exports, "isInstance", { enumerable: true, get: function () { return tableau_1.isInstance; } });
+Object.defineProperty(exports, "classify", { enumerable: true, get: function () { return tableau_1.classify; } });
+//# sourceMappingURL=index.js.map

package/dist/profiles/description-logic/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/profiles/description-logic/index.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,kDAAkD;AAClD,+DAA+D;AAC/D,6DAA6D;AAC7D,4DAA4D;AAC5D,kDAAkD;AAClD,EAAE;AACF,gEAAgE;AAChE,oEAAoE;AACpE,mEAAmE;AACnE,+DAA+D;;;AAI/D,iCAciB;AAbf,4FAAA,GAAG,OAAA;AACH,+FAAA,MAAM,OAAA;AACN,+FAAA,MAAM,OAAA;AACN,4FAAA,GAAG,OAAA;AACH,4FAAA,GAAG,OAAA;AACH,2FAAA,EAAE,OAAA;AACF,+FAAA,MAAM,OAAA;AACN,+FAAA,MAAM,OAAA;AACN,iGAAA,QAAQ,OAAA;AACR,mGAAA,UAAU,OAAA;AACV,iGAAA,QAAQ,OAAA;AACR,qGAAA,YAAY,OAAA;AACZ,gGAAA,OAAO,OAAA;AAGT,6BAA0E;AAAjE,4FAAA,KAAK,OAAA;AAAE,kGAAA,WAAW,OAAA;AAAE,mGAAA,YAAY,OAAA;AAAE,sGAAA,eAAe,OAAA;AAE1D,qCAA4E;AAAnE,wGAAA,aAAa,OAAA;AAAE,qGAAA,UAAU,OAAA;AAAE,qGAAA,UAAU,OAAA;AAAE,mGAAA,QAAQ,OAAA"}

package/dist/profiles/description-logic/nnf.d.ts

@@ -0,0 +1,13 @@
+import { DLConcept } from './types';
+export declare function toNNF(c: DLConcept): DLConcept;
+/**
+ * Hash canónico de un concepto. Dos conceptos sintácticamente iguales
+ * (módulo orden de hijos en and/or) producen el mismo hash.
+ */
+export declare function conceptHash(c: DLConcept): string;
+export declare function conceptEqual(a: DLConcept, b: DLConcept): boolean;
+/**
+ * Render legible para tracing / mensajes.
+ */
+export declare function conceptToString(c: DLConcept): string;
+//# sourceMappingURL=nnf.d.ts.map

package/dist/profiles/description-logic/nnf.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"nnf.d.ts","sourceRoot":"","sources":["../../../src/profiles/description-logic/nnf.ts"],"names":[],"mappings":"AAQA,OAAO,EAAE,SAAS,EAA6C,MAAM,SAAS,CAAC;AAE/E,wBAAgB,KAAK,CAAC,CAAC,EAAE,SAAS,GAAG,SAAS,CAoB7C;AA+BD;;;GAGG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,SAAS,GAAG,MAAM,CAuBhD;AAED,wBAAgB,YAAY,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,SAAS,GAAG,OAAO,CAEhE;AAED;;GAEG;AACH,wBAAgB,eAAe,CAAC,CAAC,EAAE,SAAS,GAAG,MAAM,CAmBpD"}

package/dist/profiles/description-logic/nnf.js

@@ -0,0 +1,123 @@
+"use strict";
+// ============================================================
+// ST Description Logic — Negation Normal Form & hashing
+// ============================================================
+// Empuja ¬ hasta los átomos. Tras NNF:
+//   - kind 'not' SOLO envuelve 'atomic'.
+//   - 'top' / 'bottom' nunca aparecen bajo 'not' (se simplifican).
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.toNNF = toNNF;
+exports.conceptHash = conceptHash;
+exports.conceptEqual = conceptEqual;
+exports.conceptToString = conceptToString;
+const types_1 = require("./types");
+function toNNF(c) {
+    switch (c.kind) {
+        case 'top':
+        case 'bottom':
+            return c;
+        case 'atomic':
+            return c;
+        case 'and':
+            return (0, types_1.and)(...(c.args || []).map(toNNF));
+        case 'or':
+            return (0, types_1.or)(...(c.args || []).map(toNNF));
+        case 'exists':
+            if (!c.role || !c.arg)
+                throw new Error('exists sin rol o argumento');
+            return (0, types_1.exists)(c.role, toNNF(c.arg));
+        case 'forall':
+            if (!c.role || !c.arg)
+                throw new Error('forall sin rol o argumento');
+            return (0, types_1.forall)(c.role, toNNF(c.arg));
+        case 'not':
+            return pushNot(c.arg);
+    }
+}
+function pushNot(inner) {
+    if (!inner)
+        throw new Error('not sin argumento');
+    switch (inner.kind) {
+        case 'top':
+            return types_1.BOTTOM;
+        case 'bottom':
+            return types_1.TOP;
+        case 'atomic':
+            return (0, types_1.not)(inner);
+        case 'not':
+            // doble negación
+            return toNNF(inner.arg);
+        case 'and':
+            // ¬(C ⊓ D) = ¬C ⊔ ¬D
+            return (0, types_1.or)(...(inner.args || []).map((a) => pushNot(a)));
+        case 'or':
+            // ¬(C ⊔ D) = ¬C ⊓ ¬D
+            return (0, types_1.and)(...(inner.args || []).map((a) => pushNot(a)));
+        case 'exists':
+            // ¬∃R.C = ∀R.¬C
+            if (!inner.role)
+                throw new Error('exists sin rol');
+            return (0, types_1.forall)(inner.role, pushNot(inner.arg));
+        case 'forall':
+            // ¬∀R.C = ∃R.¬C
+            if (!inner.role)
+                throw new Error('forall sin rol');
+            return (0, types_1.exists)(inner.role, pushNot(inner.arg));
+    }
+}
+/**
+ * Hash canónico de un concepto. Dos conceptos sintácticamente iguales
+ * (módulo orden de hijos en and/or) producen el mismo hash.
+ */
+function conceptHash(c) {
+    switch (c.kind) {
+        case 'top':
+            return 'T';
+        case 'bottom':
+            return 'F';
+        case 'atomic':
+            return `A:${c.name || '?'}`;
+        case 'not':
+            return `!(${conceptHash(c.arg)})`;
+        case 'and': {
+            const parts = (c.args || []).map(conceptHash).sort();
+            return `&(${parts.join(',')})`;
+        }
+        case 'or': {
+            const parts = (c.args || []).map(conceptHash).sort();
+            return `|(${parts.join(',')})`;
+        }
+        case 'exists':
+            return `E:${c.role || '?'}(${conceptHash(c.arg)})`;
+        case 'forall':
+            return `V:${c.role || '?'}(${conceptHash(c.arg)})`;
+    }
+}
+function conceptEqual(a, b) {
+    return conceptHash(a) === conceptHash(b);
+}
+/**
+ * Render legible para tracing / mensajes.
+ */
+function conceptToString(c) {
+    switch (c.kind) {
+        case 'top':
+            return '⊤';
+        case 'bottom':
+            return '⊥';
+        case 'atomic':
+            return c.name || '?';
+        case 'not':
+            return `¬${conceptToString(c.arg)}`;
+        case 'and':
+            return `(${(c.args || []).map(conceptToString).join(' ⊓ ')})`;
+        case 'or':
+            return `(${(c.args || []).map(conceptToString).join(' ⊔ ')})`;
+        case 'exists':
+            return `∃${c.role || '?'}.${conceptToString(c.arg)}`;
+        case 'forall':
+            return `∀${c.role || '?'}.${conceptToString(c.arg)}`;
+    }
+}
+//# sourceMappingURL=nnf.js.map

package/dist/profiles/description-logic/nnf.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"nnf.js","sourceRoot":"","sources":["../../../src/profiles/description-logic/nnf.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,wDAAwD;AACxD,+DAA+D;AAC/D,uCAAuC;AACvC,yCAAyC;AACzC,mEAAmE;AACnE,+DAA+D;;AAI/D,sBAoBC;AAmCD,kCAuBC;AAED,oCAEC;AAKD,0CAmBC;AA5GD,mCAA+E;AAE/E,SAAgB,KAAK,CAAC,CAAY;IAChC,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,KAAK,CAAC;QACX,KAAK,QAAQ;YACX,OAAO,CAAC,CAAC;QACX,KAAK,QAAQ;YACX,OAAO,CAAC,CAAC;QACX,KAAK,KAAK;YACR,OAAO,IAAA,WAAG,EAAC,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;QAC3C,KAAK,IAAI;YACP,OAAO,IAAA,UAAE,EAAC,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;QAC1C,KAAK,QAAQ;YACX,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,GAAG;gBAAE,MAAM,IAAI,KAAK,CAAC,4BAA4B,CAAC,CAAC;YACrE,OAAO,IAAA,cAAM,EAAC,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACtC,KAAK,QAAQ;YACX,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,GAAG;gBAAE,MAAM,IAAI,KAAK,CAAC,4BAA4B,CAAC,CAAC;YACrE,OAAO,IAAA,cAAM,EAAC,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACtC,KAAK,KAAK;YACR,OAAO,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAC1B,CAAC;AACH,CAAC;AAED,SAAS,OAAO,CAAC,KAA4B;IAC3C,IAAI,CAAC,KAAK;QAAE,MAAM,IAAI,KAAK,CAAC,mBAAmB,CAAC,CAAC;IACjD,QAAQ,KAAK,CAAC,IAAI,EAAE,CAAC;QACnB,KAAK,KAAK;YACR,OAAO,cAAM,CAAC;QAChB,KAAK,QAAQ;YACX,OAAO,WAAG,CAAC;QACb,KAAK,QAAQ;YACX,OAAO,IAAA,WAAG,EAAC,KAAK,CAAC,CAAC;QACpB,KAAK,KAAK;YACR,iBAAiB;YACjB,OAAO,KAAK,CAAC,KAAK,CAAC,GAAgB,CAAC,CAAC;QACvC,KAAK,KAAK;YACR,qBAAqB;YACrB,OAAO,IAAA,UAAE,EAAC,GAAG,CAAC,KAAK,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1D,KAAK,IAAI;YACP,qBAAqB;YACrB,OAAO,IAAA,WAAG,EAAC,GAAG,CAAC,KAAK,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3D,KAAK,QAAQ;YACX,gBAAgB;YAChB,IAAI,CAAC,KAAK,CAAC,IAAI;gBAAE,MAAM,IAAI,KAAK,CAAC,gBAAgB,CAAC,CAAC;YACnD,OAAO,IAAA,cAAM,EAAC,KAAK,CAAC,IAAI,EAAE,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;QAChD,KAAK,QAAQ;YACX,gBAAgB;YAChB,IAAI,CAAC,KAAK,CAAC,IAAI;gBAAE,MAAM,IAAI,KAAK,CAAC,gBAAgB,CAAC,CAAC;YACnD,OAAO,IAAA,cAAM,EAAC,KAAK,CAAC,IAAI,EAAE,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;IAClD,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,SAAgB,WAAW,CAAC,CAAY;IACtC,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,KAAK;YACR,OAAO,GAAG,CAAC;QACb,KAAK,QAAQ;YACX,OAAO,GAAG,CAAC;QACb,KAAK,QAAQ;YACX,OAAO,KAAK,CAAC,CAAC,IAAI,IAAI,GAAG,EAAE,CAAC;QAC9B,KAAK,KAAK;YACR,OAAO,KAAK,WAAW,CAAC,CAAC,CAAC,GAAgB,CAAC,GAAG,CAAC;QACjD,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,MAAM,KAAK,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,IAAI,EAAE,CAAC;YACrD,OAAO,KAAK,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;QACjC,CAAC;QACD,KAAK,IAAI,CAAC,CAAC,CAAC;YACV,MAAM,KAAK,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,IAAI,EAAE,CAAC;YACrD,OAAO,KAAK,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;QACjC,CAAC;QACD,KAAK,QAAQ;YACX,OAAO,KAAK,CAAC,CAAC,IAAI,IAAI,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,GAAgB,CAAC,GAAG,CAAC;QAClE,KAAK,QAAQ;YACX,OAAO,KAAK,CAAC,CAAC,IAAI,IAAI,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,GAAgB,CAAC,GAAG,CAAC;IACpE,CAAC;AACH,CAAC;AAED,SAAgB,YAAY,CAAC,CAAY,EAAE,CAAY;IACrD,OAAO,WAAW,CAAC,CAAC,CAAC,KAAK,WAAW,CAAC,CAAC,CAAC,CAAC;AAC3C,CAAC;AAED;;GAEG;AACH,SAAgB,eAAe,CAAC,CAAY;IAC1C,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,KAAK;YACR,OAAO,GAAG,CAAC;QACb,KAAK,QAAQ;YACX,OAAO,GAAG,CAAC;QACb,KAAK,QAAQ;YACX,OAAO,CAAC,CAAC,IAAI,IAAI,GAAG,CAAC;QACvB,KAAK,KAAK;YACR,OAAO,IAAI,eAAe,CAAC,CAAC,CAAC,GAAgB,CAAC,EAAE,CAAC;QACnD,KAAK,KAAK;YACR,OAAO,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC;QAChE,KAAK,IAAI;YACP,OAAO,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC;QAChE,KAAK,QAAQ;YACX,OAAO,IAAI,CAAC,CAAC,IAAI,IAAI,GAAG,IAAI,eAAe,CAAC,CAAC,CAAC,GAAgB,CAAC,EAAE,CAAC;QACpE,KAAK,QAAQ;YACX,OAAO,IAAI,CAAC,CAAC,IAAI,IAAI,GAAG,IAAI,eAAe,CAAC,CAAC,CAAC,GAAgB,CAAC,EAAE,CAAC;IACtE,CAAC;AACH,CAAC"}

package/dist/profiles/description-logic/tableau.d.ts

@@ -0,0 +1,27 @@
+import { DLConcept, DLKnowledgeBase } from './types';
+import { conceptToString } from './nnf';
+/**
+ * Decide si `concept` es satisfacible (eventualmente bajo la KB).
+ * Construye un tableau iniciando con un individuo fresco x : concept,
+ * y aplica las reglas hasta cerrar todas las ramas o encontrar una abierta.
+ */
+export declare function isSatisfiable(concept: DLConcept, kb?: DLKnowledgeBase): boolean;
+/**
+ * Decide si `sub ⊑ sup` (bajo la KB). Equivale a: ¬(sub ⊓ ¬sup) es válida,
+ * o sea, `sub ⊓ ¬sup` es insatisfacible.
+ */
+export declare function isSubsumed(sub: DLConcept, sup: DLConcept, kb?: DLKnowledgeBase): boolean;
+/**
+ * Decide si `individual` es instancia de `concept` bajo la KB.
+ * Equivale a: KB ∪ {individual : ¬concept} es inconsistente.
+ */
+export declare function isInstance(individual: string, concept: DLConcept, kb: DLKnowledgeBase): boolean;
+/**
+ * Clasificación: produce taxonomía de conceptos atómicos de la KB.
+ * Devuelve Map<conceptName, Set<conceptName>> donde `Set` contiene
+ * los conceptos atómicos que subsumen al name (es decir: superconceptos).
+ * ⊤ y ⊥ se incluyen siempre.
+ */
+export declare function classify(kb: DLKnowledgeBase): Map<string, Set<string>>;
+export { conceptToString };
+//# sourceMappingURL=tableau.d.ts.map

package/dist/profiles/description-logic/tableau.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tableau.d.ts","sourceRoot":"","sources":["../../../src/profiles/description-logic/tableau.ts"],"names":[],"mappings":"AAwBA,OAAO,EAAE,SAAS,EAAE,eAAe,EAAqC,MAAM,SAAS,CAAC;AACxF,OAAO,EAAsB,eAAe,EAAE,MAAM,OAAO,CAAC;AA0V5D;;;;GAIG;AACH,wBAAgB,aAAa,CAAC,OAAO,EAAE,SAAS,EAAE,EAAE,CAAC,EAAE,eAAe,GAAG,OAAO,CAgB/E;AAED;;;GAGG;AACH,wBAAgB,UAAU,CAAC,GAAG,EAAE,SAAS,EAAE,GAAG,EAAE,SAAS,EAAE,EAAE,CAAC,EAAE,eAAe,GAAG,OAAO,CAGxF;AAED;;;GAGG;AACH,wBAAgB,UAAU,CAAC,UAAU,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,EAAE,EAAE,eAAe,GAAG,OAAO,CAgB/F;AAED;;;;;GAKG;AACH,wBAAgB,QAAQ,CAAC,EAAE,EAAE,eAAe,GAAG,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAoCtE;AAoBD,OAAO,EAAE,eAAe,EAAE,CAAC"}