@stevenvo780/st-lang 4.1.0 → 4.3.0

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

@@ -0,0 +1,491 @@
+"use strict";
+// ============================================================
+// ST Description Logic — Tableau de decisión para ALC
+// ============================================================
+// Procedimiento estándar de tableau con blocking (subset blocking)
+// para garantizar terminación con TBox cíclica.
+//
+// Estado de la rama:
+//   - individuals: id -> Set<conceptHash> (labels)
+//   - roles:       roleName -> Array<[from, to]>
+//   - blocked:     id -> id  (ancestro que bloquea, si aplica)
+//
+// Reglas:
+//   ⊓: añade ambos children
+//   ⊔: bifurca
+//   ∃R.C: si no hay R-sucesor con C, crea fresh y, R(x,y), C(y)
+//   ∀R.C: para todo R(x,y), añade C(y)
+//
+// Clash: A ∈ labels(x) y ¬A ∈ labels(x); o ⊥ ∈ labels(x).
+//
+// TBox internalization: cada axioma C ⊑ D se convierte en
+// el concepto axiom = ¬C ⊔ D, que se añade a cada individuo
+// (existente y futuro). C ≡ D se desdobla en C ⊑ D y D ⊑ C.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.conceptToString = void 0;
+exports.isSatisfiable = isSatisfiable;
+exports.isSubsumed = isSubsumed;
+exports.isInstance = isInstance;
+exports.classify = classify;
+const types_1 = require("./types");
+const nnf_1 = require("./nnf");
+Object.defineProperty(exports, "conceptToString", { enumerable: true, get: function () { return nnf_1.conceptToString; } });
+const MAX_INDIVIDUALS = 5000;
+// ── Helpers ─────────────────────────────────────────────────
+function makeBranch() {
+    return {
+        individuals: new Map(),
+        roleAssertions: new Map(),
+        tboxAxioms: [],
+        pendingOr: [],
+        processedOr: new Set(),
+        freshCounter: 0,
+    };
+}
+function cloneBranch(b) {
+    const c = {
+        individuals: new Map(),
+        roleAssertions: new Map(),
+        tboxAxioms: [...b.tboxAxioms],
+        pendingOr: b.pendingOr.map((p) => ({
+            indId: p.indId,
+            disjuncts: [...p.disjuncts],
+            sourceHash: p.sourceHash,
+        })),
+        processedOr: new Set(b.processedOr),
+        freshCounter: b.freshCounter,
+    };
+    for (const [k, ind] of b.individuals) {
+        c.individuals.set(k, {
+            id: ind.id,
+            labels: new Map(ind.labels),
+            parent: ind.parent,
+        });
+    }
+    for (const [role, pairs] of b.roleAssertions) {
+        c.roleAssertions.set(role, pairs.map((p) => [p[0], p[1]]));
+    }
+    return c;
+}
+function getOrCreateIndividual(branch, id, parent) {
+    let ind = branch.individuals.get(id);
+    if (!ind) {
+        ind = { id, labels: new Map(), parent };
+        branch.individuals.set(id, ind);
+    }
+    return ind;
+}
+function freshIndividual(branch, parent) {
+    const id = `_x${branch.freshCounter++}`;
+    return getOrCreateIndividual(branch, id, parent);
+}
+function roleSuccessors(branch, role, from) {
+    const pairs = branch.roleAssertions.get(role);
+    if (!pairs)
+        return [];
+    const out = [];
+    for (const [a, b] of pairs)
+        if (a === from)
+            out.push(b);
+    return out;
+}
+function addRoleAssertion(branch, role, from, to) {
+    let pairs = branch.roleAssertions.get(role);
+    if (!pairs) {
+        pairs = [];
+        branch.roleAssertions.set(role, pairs);
+    }
+    // de-dup
+    for (const [a, b] of pairs)
+        if (a === from && b === to)
+            return;
+    pairs.push([from, to]);
+}
+/**
+ * Subset blocking: un individuo anónimo x está bloqueado si existe un ancestro y
+ * (a través de la cadena parent → parent) tal que labels(x) ⊆ labels(y).
+ * Solo bloquea para conceptos generados por ∃ (no aplica a individuos de la ABox).
+ */
+function isBlocked(branch, indId) {
+    const ind = branch.individuals.get(indId);
+    if (!ind || !ind.parent)
+        return false;
+    // Solo fresh individuals son bloqueables.
+    if (!indId.startsWith('_x'))
+        return false;
+    let ancestorId = ind.parent;
+    while (ancestorId) {
+        const anc = branch.individuals.get(ancestorId);
+        if (!anc)
+            break;
+        if (subsetOf(ind.labels, anc.labels))
+            return true;
+        ancestorId = anc.parent || '';
+    }
+    return false;
+}
+function subsetOf(a, b) {
+    for (const k of a.keys())
+        if (!b.has(k))
+            return false;
+    return true;
+}
+// ── Adición de concepto al individuo ────────────────────────
+/**
+ * Añade `concept` (NNF) como label de `indId`. Devuelve:
+ *   - 'clash' si la rama cierra
+ *   - 'added' si era nuevo
+ *   - 'dup'   si ya estaba
+ */
+function addLabel(branch, indId, concept) {
+    if (concept.kind === 'bottom')
+        return 'clash';
+    if (concept.kind === 'top')
+        return 'dup';
+    const ind = getOrCreateIndividual(branch, indId);
+    const h = (0, nnf_1.conceptHash)(concept);
+    if (ind.labels.has(h))
+        return 'dup';
+    // Check clash con negación.
+    const negH = (0, nnf_1.conceptHash)((0, nnf_1.toNNF)((0, types_1.not)(concept)));
+    if (ind.labels.has(negH))
+        return 'clash';
+    ind.labels.set(h, concept);
+    // Si era ⊓ → enqueuemos children directamente.
+    if (concept.kind === 'and') {
+        for (const c of concept.args || []) {
+            const r = addLabel(branch, indId, c);
+            if (r === 'clash')
+                return 'clash';
+        }
+    }
+    else if (concept.kind === 'or') {
+        const sourceHash = `${indId}::${h}`;
+        if (!branch.processedOr.has(sourceHash)) {
+            branch.pendingOr.push({
+                indId,
+                disjuncts: concept.args || [],
+                sourceHash,
+            });
+        }
+    }
+    return 'added';
+}
+// ── Aplicación de TBox al individuo ─────────────────────────
+function applyTBoxTo(branch, indId) {
+    for (const ax of branch.tboxAxioms) {
+        const r = addLabel(branch, indId, ax);
+        if (r === 'clash')
+            return 'clash';
+    }
+    return 'ok';
+}
+// ── Reglas ∃ / ∀ ────────────────────────────────────────────
+/**
+ * Aplica una pasada de reglas determinísticas: ∀, ∃.
+ * Devuelve true si se hizo algún cambio.
+ */
+function applyDeterministicRules(branch) {
+    let changed = false;
+    // ── ∀R.C: para cada individuo no bloqueado con ∀R.C y cada R(x,y), añade C(y)
+    // Iteramos sobre un snapshot porque podemos crear nuevos sucesores.
+    const indSnapshot = Array.from(branch.individuals.values());
+    for (const ind of indSnapshot) {
+        if (isBlocked(branch, ind.id))
+            continue;
+        for (const [, c] of ind.labels) {
+            if (c.kind !== 'forall')
+                continue;
+            if (!c.role || !c.arg)
+                continue;
+            const role = c.role;
+            const inner = c.arg;
+            for (const succ of roleSuccessors(branch, role, ind.id)) {
+                const succInd = branch.individuals.get(succ);
+                if (!succInd)
+                    continue;
+                if (succInd.labels.has((0, nnf_1.conceptHash)(inner)))
+                    continue;
+                const r = addLabel(branch, succ, inner);
+                if (r === 'clash')
+                    return 'clash';
+                if (r === 'added')
+                    changed = true;
+            }
+        }
+    }
+    // ── ∃R.C: para cada individuo no bloqueado con ∃R.C que no tenga
+    // un R-sucesor con C, crear uno fresh.
+    // (Se aplica DESPUÉS de ∀ porque generar sucesor podría requerir refrescar.)
+    const indSnapshot2 = Array.from(branch.individuals.values());
+    for (const ind of indSnapshot2) {
+        if (isBlocked(branch, ind.id))
+            continue;
+        for (const [, c] of ind.labels) {
+            if (c.kind !== 'exists')
+                continue;
+            if (!c.role || !c.arg)
+                continue;
+            const role = c.role;
+            const inner = c.arg;
+            const innerH = (0, nnf_1.conceptHash)(inner);
+            const succs = roleSuccessors(branch, role, ind.id);
+            const satisfied = succs.some((s) => {
+                const si = branch.individuals.get(s);
+                return si ? si.labels.has(innerH) : false;
+            });
+            if (satisfied)
+                continue;
+            if (branch.individuals.size >= MAX_INDIVIDUALS) {
+                // Tableau agotado — para ALC con blocking no debería pasar, pero
+                // por defensa devolvemos stable para no diverger.
+                return 'stable';
+            }
+            const fresh = freshIndividual(branch, ind.id);
+            addRoleAssertion(branch, role, ind.id, fresh.id);
+            // Aplicar TBox al recién nacido.
+            const t = applyTBoxTo(branch, fresh.id);
+            if (t === 'clash')
+                return 'clash';
+            const r1 = addLabel(branch, fresh.id, inner);
+            if (r1 === 'clash')
+                return 'clash';
+            // Propagar ∀ del padre al recién nacido.
+            for (const [, vc] of ind.labels) {
+                if (vc.kind === 'forall' && vc.role === role && vc.arg) {
+                    const r2 = addLabel(branch, fresh.id, vc.arg);
+                    if (r2 === 'clash')
+                        return 'clash';
+                }
+            }
+            changed = true;
+        }
+    }
+    return changed ? 'changed' : 'stable';
+}
+// ── Expansión principal ─────────────────────────────────────
+function saturate(branch, depth) {
+    if (depth > 1000)
+        return true; // se considera abierta por defensa.
+    // 1) Aplicar reglas determinísticas hasta estabilizar.
+    for (;;) {
+        const r = applyDeterministicRules(branch);
+        if (r === 'clash')
+            return false;
+        if (r === 'stable')
+            break;
+    }
+    // 2) Procesar próximo ⊔ pendiente.
+    // Saltamos disyunciones cuyo individuo ya tiene un disyunto satisfecho.
+    while (branch.pendingOr.length > 0) {
+        const next = branch.pendingOr.shift();
+        if (!next)
+            break;
+        if (branch.processedOr.has(next.sourceHash))
+            continue;
+        const ind = branch.individuals.get(next.indId);
+        if (!ind) {
+            branch.processedOr.add(next.sourceHash);
+            continue;
+        }
+        // Si alguno de los disyuntos ya está en labels, no hace falta bifurcar.
+        const alreadySatisfied = next.disjuncts.some((d) => ind.labels.has((0, nnf_1.conceptHash)(d)));
+        if (alreadySatisfied) {
+            branch.processedOr.add(next.sourceHash);
+            continue;
+        }
+        branch.processedOr.add(next.sourceHash);
+        // Bifurcar: probar cada disyunto.
+        for (const d of next.disjuncts) {
+            const child = cloneBranch(branch);
+            const r = addLabel(child, next.indId, d);
+            if (r === 'clash')
+                continue;
+            if (saturate(child, depth + 1))
+                return true;
+        }
+        return false;
+    }
+    // 3) Sin más pendings ni cambios: rama abierta y saturada.
+    return true;
+}
+// ── Carga de KB ─────────────────────────────────────────────
+function internalizeTBox(branch, tbox) {
+    for (const ax of tbox) {
+        if (ax.kind === 'subsumes') {
+            // C ⊑ D  ≡  ⊤ ⊑ ¬C ⊔ D
+            const left = ax.left;
+            const right = ax.right;
+            branch.tboxAxioms.push((0, nnf_1.toNNF)((0, types_1.or)((0, types_1.not)(left), right)));
+        }
+        else if (ax.kind === 'equivalent') {
+            const left = ax.left;
+            const right = ax.right;
+            branch.tboxAxioms.push((0, nnf_1.toNNF)((0, types_1.or)((0, types_1.not)(left), right)));
+            branch.tboxAxioms.push((0, nnf_1.toNNF)((0, types_1.or)((0, types_1.not)(right), left)));
+        }
+        // instance / role-instance no son TBox — se ignoran aquí.
+    }
+}
+function loadABox(branch, abox) {
+    // Primero crear todos los individuos referenciados.
+    const seen = new Set();
+    const ensure = (id) => {
+        if (seen.has(id))
+            return;
+        seen.add(id);
+        getOrCreateIndividual(branch, id);
+    };
+    for (const ax of abox) {
+        if (ax.kind === 'instance')
+            ensure(ax.left);
+        if (ax.kind === 'role-instance') {
+            ensure(ax.left);
+            ensure(ax.right);
+        }
+    }
+    // Aplicar TBox a todos los individuos existentes.
+    for (const id of seen) {
+        if (applyTBoxTo(branch, id) === 'clash')
+            return 'clash';
+    }
+    // Cargar asertions.
+    for (const ax of abox) {
+        if (ax.kind === 'instance') {
+            const c = (0, nnf_1.toNNF)(ax.right);
+            if (addLabel(branch, ax.left, c) === 'clash')
+                return 'clash';
+        }
+        else if (ax.kind === 'role-instance') {
+            if (!ax.role)
+                continue;
+            addRoleAssertion(branch, ax.role, ax.left, ax.right);
+        }
+    }
+    return 'ok';
+}
+// ── API pública ─────────────────────────────────────────────
+/**
+ * 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.
+ */
+function isSatisfiable(concept, kb) {
+    const branch = makeBranch();
+    if (kb)
+        internalizeTBox(branch, kb.tbox);
+    // Si hay KB no-vacía, cargamos su ABox primero (puede ya cerrar).
+    if (kb && kb.abox.length > 0) {
+        if (loadABox(branch, kb.abox) === 'clash')
+            return false;
+    }
+    // Individuo testigo para `concept`.
+    const witness = '_root';
+    getOrCreateIndividual(branch, witness);
+    if (applyTBoxTo(branch, witness) === 'clash')
+        return false;
+    if (addLabel(branch, witness, (0, nnf_1.toNNF)(concept)) === 'clash')
+        return false;
+    return saturate(branch, 0);
+}
+/**
+ * Decide si `sub ⊑ sup` (bajo la KB). Equivale a: ¬(sub ⊓ ¬sup) es válida,
+ * o sea, `sub ⊓ ¬sup` es insatisfacible.
+ */
+function isSubsumed(sub, sup, kb) {
+    const probe = (0, types_1.and)(sub, (0, types_1.not)(sup));
+    return !isSatisfiable(probe, kb);
+}
+/**
+ * Decide si `individual` es instancia de `concept` bajo la KB.
+ * Equivale a: KB ∪ {individual : ¬concept} es inconsistente.
+ */
+function isInstance(individual, concept, kb) {
+    // Construimos una KB extendida con el axioma de instancia negada.
+    const extended = {
+        tbox: kb.tbox,
+        abox: [...kb.abox, { kind: 'instance', left: individual, right: (0, types_1.not)(concept) }],
+    };
+    // El test es: ¿es la KB consistente? Si NO lo es, individuo es instancia.
+    const branch = makeBranch();
+    internalizeTBox(branch, extended.tbox);
+    if (loadABox(branch, extended.abox) === 'clash')
+        return true;
+    // Aún si la ABox carga sin clash inmediato, hay que saturar.
+    // Iniciamos saturación sin "concepto probe": el branch ya contiene
+    // todas las afirmaciones de la KB extendida.
+    // Si saturate devuelve true (abierta) → consistente → NO es instancia.
+    // Si saturate devuelve false (cerrada) → inconsistente → SÍ es instancia.
+    return !saturate(branch, 0);
+}
+/**
+ * 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.
+ */
+function classify(kb) {
+    const names = collectAtomicNames(kb);
+    names.add('⊤');
+    names.add('⊥');
+    const result = new Map();
+    for (const n of names)
+        result.set(n, new Set());
+    const conceptOf = (n) => {
+        if (n === '⊤')
+            return types_1.TOP;
+        if (n === '⊥')
+            return types_1.BOTTOM;
+        return (0, types_1.atomic)(n);
+    };
+    for (const sub of names) {
+        const subSet = result.get(sub);
+        if (!subSet)
+            continue;
+        const subC = conceptOf(sub);
+        // ¿es satisfacible sub bajo KB? Si no, sub ≡ ⊥ → subsumido por todo.
+        const subSat = isSatisfiable(subC, kb);
+        if (!subSat) {
+            // sub es ⊥ bajo la KB: subsumido por todos.
+            for (const sup of names)
+                subSet.add(sup);
+            continue;
+        }
+        for (const sup of names) {
+            if (sub === sup) {
+                subSet.add(sup);
+                continue;
+            }
+            const supC = conceptOf(sup);
+            if (isSubsumed(subC, supC, kb)) {
+                subSet.add(sup);
+            }
+        }
+    }
+    return result;
+}
+function collectAtomicNames(kb) {
+    const out = new Set();
+    const walk = (c) => {
+        if (c.kind === 'atomic' && c.name)
+            out.add(c.name);
+        if (c.arg)
+            walk(c.arg);
+        if (c.args)
+            for (const a of c.args)
+                walk(a);
+    };
+    for (const ax of kb.tbox) {
+        if (typeof ax.left !== 'string')
+            walk(ax.left);
+        if (typeof ax.right !== 'string')
+            walk(ax.right);
+    }
+    for (const ax of kb.abox) {
+        if (typeof ax.right !== 'string')
+            walk(ax.right);
+    }
+    return out;
+}
+//# sourceMappingURL=tableau.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"tableau.js","sourceRoot":"","sources":["../../../src/profiles/description-logic/tableau.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,sDAAsD;AACtD,+DAA+D;AAC/D,mEAAmE;AACnE,gDAAgD;AAChD,EAAE;AACF,qBAAqB;AACrB,mDAAmD;AACnD,iDAAiD;AACjD,+DAA+D;AAC/D,EAAE;AACF,UAAU;AACV,4BAA4B;AAC5B,eAAe;AACf,gEAAgE;AAChE,uCAAuC;AACvC,EAAE;AACF,0DAA0D;AAC1D,EAAE;AACF,0DAA0D;AAC1D,4DAA4D;AAC5D,4DAA4D;AAC5D,+DAA+D;;;AAkW/D,sCAgBC;AAMD,gCAGC;AAMD,gCAgBC;AAQD,4BAoCC;AA3bD,mCAAwF;AACxF,+BAA4D;AA8cnD,gGA9coB,qBAAe,OA8cpB;AApbxB,MAAM,eAAe,GAAG,IAAI,CAAC;AAE7B,+DAA+D;AAE/D,SAAS,UAAU;IACjB,OAAO;QACL,WAAW,EAAE,IAAI,GAAG,EAAE;QACtB,cAAc,EAAE,IAAI,GAAG,EAAE;QACzB,UAAU,EAAE,EAAE;QACd,SAAS,EAAE,EAAE;QACb,WAAW,EAAE,IAAI,GAAG,EAAE;QACtB,YAAY,EAAE,CAAC;KAChB,CAAC;AACJ,CAAC;AAED,SAAS,WAAW,CAAC,CAAS;IAC5B,MAAM,CAAC,GAAW;QAChB,WAAW,EAAE,IAAI,GAAG,EAAE;QACtB,cAAc,EAAE,IAAI,GAAG,EAAE;QACzB,UAAU,EAAE,CAAC,GAAG,CAAC,CAAC,UAAU,CAAC;QAC7B,SAAS,EAAE,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACjC,KAAK,EAAE,CAAC,CAAC,KAAK;YACd,SAAS,EAAE,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC;YAC3B,UAAU,EAAE,CAAC,CAAC,UAAU;SACzB,CAAC,CAAC;QACH,WAAW,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC;QACnC,YAAY,EAAE,CAAC,CAAC,YAAY;KAC7B,CAAC;IACF,KAAK,MAAM,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC;QACrC,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,EAAE;YACnB,EAAE,EAAE,GAAG,CAAC,EAAE;YACV,MAAM,EAAE,IAAI,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC;YAC3B,MAAM,EAAE,GAAG,CAAC,MAAM;SACnB,CAAC,CAAC;IACL,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,cAAc,EAAE,CAAC;QAC7C,CAAC,CAAC,cAAc,CAAC,GAAG,CAClB,IAAI,EACJ,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAC/B,CAAC;IACJ,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED,SAAS,qBAAqB,CAAC,MAAc,EAAE,EAAU,EAAE,MAAe;IACxE,IAAI,GAAG,GAAG,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACrC,IAAI,CAAC,GAAG,EAAE,CAAC;QACT,GAAG,GAAG,EAAE,EAAE,EAAE,MAAM,EAAE,IAAI,GAAG,EAAE,EAAE,MAAM,EAAE,CAAC;QACxC,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;IAClC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,eAAe,CAAC,MAAc,EAAE,MAAc;IACrD,MAAM,EAAE,GAAG,KAAK,MAAM,CAAC,YAAY,EAAE,EAAE,CAAC;IACxC,OAAO,qBAAqB,CAAC,MAAM,EAAE,EAAE,EAAE,MAAM,CAAC,CAAC;AACnD,CAAC;AAED,SAAS,cAAc,CAAC,MAAc,EAAE,IAAY,EAAE,IAAY;IAChE,MAAM,KAAK,GAAG,MAAM,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAC9C,IAAI,CAAC,KAAK;QAAE,OAAO,EAAE,CAAC;IACtB,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,KAAK;QAAE,IAAI,CAAC,KAAK,IAAI;YAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACxD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,gBAAgB,CAAC,MAAc,EAAE,IAAY,EAAE,IAAY,EAAE,EAAU;IAC9E,IAAI,KAAK,GAAG,MAAM,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAC5C,IAAI,CAAC,KAAK,EAAE,CAAC;QACX,KAAK,GAAG,EAAE,CAAC;QACX,MAAM,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IACzC,CAAC;IACD,SAAS;IACT,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,KAAK;QAAE,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,EAAE;YAAE,OAAO;IAC/D,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC;AACzB,CAAC;AAED;;;;GAIG;AACH,SAAS,SAAS,CAAC,MAAc,EAAE,KAAa;IAC9C,MAAM,GAAG,GAAG,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAC1C,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM;QAAE,OAAO,KAAK,CAAC;IACtC,0CAA0C;IAC1C,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC;QAAE,OAAO,KAAK,CAAC;IAC1C,IAAI,UAAU,GAAG,GAAG,CAAC,MAAM,CAAC;IAC5B,OAAO,UAAU,EAAE,CAAC;QAClB,MAAM,GAAG,GAAG,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;QAC/C,IAAI,CAAC,GAAG;YAAE,MAAM;QAChB,IAAI,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC;YAAE,OAAO,IAAI,CAAC;QAClD,UAAU,GAAG,GAAG,CAAC,MAAM,IAAI,EAAE,CAAC;IAChC,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,QAAQ,CAAC,CAAyB,EAAE,CAAyB;IACpE,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE;QAAE,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;IACtD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,+DAA+D;AAE/D;;;;;GAKG;AACH,SAAS,QAAQ,CAAC,MAAc,EAAE,KAAa,EAAE,OAAkB;IACjE,IAAI,OAAO,CAAC,IAAI,KAAK,QAAQ;QAAE,OAAO,OAAO,CAAC;IAC9C,IAAI,OAAO,CAAC,IAAI,KAAK,KAAK;QAAE,OAAO,KAAK,CAAC;IACzC,MAAM,GAAG,GAAG,qBAAqB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IACjD,MAAM,CAAC,GAAG,IAAA,iBAAW,EAAC,OAAO,CAAC,CAAC;IAC/B,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;QAAE,OAAO,KAAK,CAAC;IACpC,4BAA4B;IAC5B,MAAM,IAAI,GAAG,IAAA,iBAAW,EAAC,IAAA,WAAK,EAAC,IAAA,WAAG,EAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAC9C,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC;QAAE,OAAO,OAAO,CAAC;IACzC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;IAC3B,+CAA+C;IAC/C,IAAI,OAAO,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;QAC3B,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,IAAI,IAAI,EAAE,EAAE,CAAC;YACnC,MAAM,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;YACrC,IAAI,CAAC,KAAK,OAAO;gBAAE,OAAO,OAAO,CAAC;QACpC,CAAC;IACH,CAAC;SAAM,IAAI,OAAO,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;QACjC,MAAM,UAAU,GAAG,GAAG,KAAK,KAAK,CAAC,EAAE,CAAC;QACpC,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;YACxC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC;gBACpB,KAAK;gBACL,SAAS,EAAE,OAAO,CAAC,IAAI,IAAI,EAAE;gBAC7B,UAAU;aACX,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,+DAA+D;AAE/D,SAAS,WAAW,CAAC,MAAc,EAAE,KAAa;IAChD,KAAK,MAAM,EAAE,IAAI,MAAM,CAAC,UAAU,EAAE,CAAC;QACnC,MAAM,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;QACtC,IAAI,CAAC,KAAK,OAAO;YAAE,OAAO,OAAO,CAAC;IACpC,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,+DAA+D;AAE/D;;;GAGG;AACH,SAAS,uBAAuB,CAAC,MAAc;IAC7C,IAAI,OAAO,GAAG,KAAK,CAAC;IAEpB,+EAA+E;IAC/E,oEAAoE;IACpE,MAAM,WAAW,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC,CAAC;IAC5D,KAAK,MAAM,GAAG,IAAI,WAAW,EAAE,CAAC;QAC9B,IAAI,SAAS,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,CAAC;YAAE,SAAS;QACxC,KAAK,MAAM,CAAC,EAAE,CAAC,CAAC,IAAI,GAAG,CAAC,MAAM,EAAE,CAAC;YAC/B,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ;gBAAE,SAAS;YAClC,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,GAAG;gBAAE,SAAS;YAChC,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC;YACpB,MAAM,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC;YACpB,KAAK,MAAM,IAAI,IAAI,cAAc,CAAC,MAAM,EAAE,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBACxD,MAAM,OAAO,GAAG,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBAC7C,IAAI,CAAC,OAAO;oBAAE,SAAS;gBACvB,IAAI,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,IAAA,iBAAW,EAAC,KAAK,CAAC,CAAC;oBAAE,SAAS;gBACrD,MAAM,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;gBACxC,IAAI,CAAC,KAAK,OAAO;oBAAE,OAAO,OAAO,CAAC;gBAClC,IAAI,CAAC,KAAK,OAAO;oBAAE,OAAO,GAAG,IAAI,CAAC;YACpC,CAAC;QACH,CAAC;IACH,CAAC;IAED,kEAAkE;IAClE,uCAAuC;IACvC,6EAA6E;IAC7E,MAAM,YAAY,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC,CAAC;IAC7D,KAAK,MAAM,GAAG,IAAI,YAAY,EAAE,CAAC;QAC/B,IAAI,SAAS,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,CAAC;YAAE,SAAS;QACxC,KAAK,MAAM,CAAC,EAAE,CAAC,CAAC,IAAI,GAAG,CAAC,MAAM,EAAE,CAAC;YAC/B,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ;gBAAE,SAAS;YAClC,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,GAAG;gBAAE,SAAS;YAChC,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC;YACpB,MAAM,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC;YACpB,MAAM,MAAM,GAAG,IAAA,iBAAW,EAAC,KAAK,CAAC,CAAC;YAClC,MAAM,KAAK,GAAG,cAAc,CAAC,MAAM,EAAE,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;YACnD,MAAM,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE;gBACjC,MAAM,EAAE,GAAG,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACrC,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;YAC5C,CAAC,CAAC,CAAC;YACH,IAAI,SAAS;gBAAE,SAAS;YACxB,IAAI,MAAM,CAAC,WAAW,CAAC,IAAI,IAAI,eAAe,EAAE,CAAC;gBAC/C,iEAAiE;gBACjE,kDAAkD;gBAClD,OAAO,QAAQ,CAAC;YAClB,CAAC;YACD,MAAM,KAAK,GAAG,eAAe,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;YAC9C,gBAAgB,CAAC,MAAM,EAAE,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC;YACjD,iCAAiC;YACjC,MAAM,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC;YACxC,IAAI,CAAC,KAAK,OAAO;gBAAE,OAAO,OAAO,CAAC;YAClC,MAAM,EAAE,GAAG,QAAQ,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;YAC7C,IAAI,EAAE,KAAK,OAAO;gBAAE,OAAO,OAAO,CAAC;YACnC,yCAAyC;YACzC,KAAK,MAAM,CAAC,EAAE,EAAE,CAAC,IAAI,GAAG,CAAC,MAAM,EAAE,CAAC;gBAChC,IAAI,EAAE,CAAC,IAAI,KAAK,QAAQ,IAAI,EAAE,CAAC,IAAI,KAAK,IAAI,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC;oBACvD,MAAM,EAAE,GAAG,QAAQ,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC;oBAC9C,IAAI,EAAE,KAAK,OAAO;wBAAE,OAAO,OAAO,CAAC;gBACrC,CAAC;YACH,CAAC;YACD,OAAO,GAAG,IAAI,CAAC;QACjB,CAAC;IACH,CAAC;IAED,OAAO,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC;AACxC,CAAC;AAED,+DAA+D;AAE/D,SAAS,QAAQ,CAAC,MAAc,EAAE,KAAa;IAC7C,IAAI,KAAK,GAAG,IAAI;QAAE,OAAO,IAAI,CAAC,CAAC,oCAAoC;IAEnE,uDAAuD;IACvD,SAAS,CAAC;QACR,MAAM,CAAC,GAAG,uBAAuB,CAAC,MAAM,CAAC,CAAC;QAC1C,IAAI,CAAC,KAAK,OAAO;YAAE,OAAO,KAAK,CAAC;QAChC,IAAI,CAAC,KAAK,QAAQ;YAAE,MAAM;IAC5B,CAAC;IAED,mCAAmC;IACnC,wEAAwE;IACxE,OAAO,MAAM,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACnC,MAAM,IAAI,GAAG,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC;QACtC,IAAI,CAAC,IAAI;YAAE,MAAM;QACjB,IAAI,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC;YAAE,SAAS;QACtD,MAAM,GAAG,GAAG,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC/C,IAAI,CAAC,GAAG,EAAE,CAAC;YACT,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YACxC,SAAS;QACX,CAAC;QACD,wEAAwE;QACxE,MAAM,gBAAgB,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,IAAA,iBAAW,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACpF,IAAI,gBAAgB,EAAE,CAAC;YACrB,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YACxC,SAAS;QACX,CAAC;QACD,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACxC,kCAAkC;QAClC,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YAC/B,MAAM,KAAK,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC;YAClC,MAAM,CAAC,GAAG,QAAQ,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YACzC,IAAI,CAAC,KAAK,OAAO;gBAAE,SAAS;YAC5B,IAAI,QAAQ,CAAC,KAAK,EAAE,KAAK,GAAG,CAAC,CAAC;gBAAE,OAAO,IAAI,CAAC;QAC9C,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,2DAA2D;IAC3D,OAAO,IAAI,CAAC;AACd,CAAC;AAED,+DAA+D;AAE/D,SAAS,eAAe,CAAC,MAAc,EAAE,IAA6B;IACpE,KAAK,MAAM,EAAE,IAAI,IAAI,EAAE,CAAC;QACtB,IAAI,EAAE,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;YAC3B,uBAAuB;YACvB,MAAM,IAAI,GAAG,EAAE,CAAC,IAAiB,CAAC;YAClC,MAAM,KAAK,GAAG,EAAE,CAAC,KAAkB,CAAC;YACpC,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,IAAA,WAAK,EAAC,IAAA,UAAE,EAAC,IAAA,WAAG,EAAC,IAAI,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;QACtD,CAAC;aAAM,IAAI,EAAE,CAAC,IAAI,KAAK,YAAY,EAAE,CAAC;YACpC,MAAM,IAAI,GAAG,EAAE,CAAC,IAAiB,CAAC;YAClC,MAAM,KAAK,GAAG,EAAE,CAAC,KAAkB,CAAC;YACpC,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,IAAA,WAAK,EAAC,IAAA,UAAE,EAAC,IAAA,WAAG,EAAC,IAAI,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;YACpD,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,IAAA,WAAK,EAAC,IAAA,UAAE,EAAC,IAAA,WAAG,EAAC,KAAK,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;QACtD,CAAC;QACD,0DAA0D;IAC5D,CAAC;AACH,CAAC;AAED,SAAS,QAAQ,CAAC,MAAc,EAAE,IAA6B;IAC7D,oDAAoD;IACpD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,MAAM,GAAG,CAAC,EAAU,EAAE,EAAE;QAC5B,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,OAAO;QACzB,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACb,qBAAqB,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;IACpC,CAAC,CAAC;IACF,KAAK,MAAM,EAAE,IAAI,IAAI,EAAE,CAAC;QACtB,IAAI,EAAE,CAAC,IAAI,KAAK,UAAU;YAAE,MAAM,CAAC,EAAE,CAAC,IAAc,CAAC,CAAC;QACtD,IAAI,EAAE,CAAC,IAAI,KAAK,eAAe,EAAE,CAAC;YAChC,MAAM,CAAC,EAAE,CAAC,IAAc,CAAC,CAAC;YAC1B,MAAM,CAAC,EAAE,CAAC,KAAe,CAAC,CAAC;QAC7B,CAAC;IACH,CAAC;IACD,kDAAkD;IAClD,KAAK,MAAM,EAAE,IAAI,IAAI,EAAE,CAAC;QACtB,IAAI,WAAW,CAAC,MAAM,EAAE,EAAE,CAAC,KAAK,OAAO;YAAE,OAAO,OAAO,CAAC;IAC1D,CAAC;IACD,oBAAoB;IACpB,KAAK,MAAM,EAAE,IAAI,IAAI,EAAE,CAAC;QACtB,IAAI,EAAE,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAG,IAAA,WAAK,EAAC,EAAE,CAAC,KAAkB,CAAC,CAAC;YACvC,IAAI,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC,IAAc,EAAE,CAAC,CAAC,KAAK,OAAO;gBAAE,OAAO,OAAO,CAAC;QACzE,CAAC;aAAM,IAAI,EAAE,CAAC,IAAI,KAAK,eAAe,EAAE,CAAC;YACvC,IAAI,CAAC,EAAE,CAAC,IAAI;gBAAE,SAAS;YACvB,gBAAgB,CAAC,MAAM,EAAE,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,IAAc,EAAE,EAAE,CAAC,KAAe,CAAC,CAAC;QAC3E,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,+DAA+D;AAE/D;;;;GAIG;AACH,SAAgB,aAAa,CAAC,OAAkB,EAAE,EAAoB;IACpE,MAAM,MAAM,GAAG,UAAU,EAAE,CAAC;IAC5B,IAAI,EAAE;QAAE,eAAe,CAAC,MAAM,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC;IAEzC,kEAAkE;IAClE,IAAI,EAAE,IAAI,EAAE,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC7B,IAAI,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,OAAO;YAAE,OAAO,KAAK,CAAC;IAC1D,CAAC;IAED,oCAAoC;IACpC,MAAM,OAAO,GAAG,OAAO,CAAC;IACxB,qBAAqB,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACvC,IAAI,WAAW,CAAC,MAAM,EAAE,OAAO,CAAC,KAAK,OAAO;QAAE,OAAO,KAAK,CAAC;IAC3D,IAAI,QAAQ,CAAC,MAAM,EAAE,OAAO,EAAE,IAAA,WAAK,EAAC,OAAO,CAAC,CAAC,KAAK,OAAO;QAAE,OAAO,KAAK,CAAC;IAExE,OAAO,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;AAC7B,CAAC;AAED;;;GAGG;AACH,SAAgB,UAAU,CAAC,GAAc,EAAE,GAAc,EAAE,EAAoB;IAC7E,MAAM,KAAK,GAAG,IAAA,WAAG,EAAC,GAAG,EAAE,IAAA,WAAG,EAAC,GAAG,CAAC,CAAC,CAAC;IACjC,OAAO,CAAC,aAAa,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;AACnC,CAAC;AAED;;;GAGG;AACH,SAAgB,UAAU,CAAC,UAAkB,EAAE,OAAkB,EAAE,EAAmB;IACpF,kEAAkE;IAClE,MAAM,QAAQ,GAAoB;QAChC,IAAI,EAAE,EAAE,CAAC,IAAI;QACb,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,IAAA,WAAG,EAAC,OAAO,CAAC,EAAE,CAAC;KAChF,CAAC;IACF,0EAA0E;IAC1E,MAAM,MAAM,GAAG,UAAU,EAAE,CAAC;IAC5B,eAAe,CAAC,MAAM,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC;IACvC,IAAI,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,IAAI,CAAC,KAAK,OAAO;QAAE,OAAO,IAAI,CAAC;IAC7D,6DAA6D;IAC7D,mEAAmE;IACnE,6CAA6C;IAC7C,uEAAuE;IACvE,0EAA0E;IAC1E,OAAO,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;AAC9B,CAAC;AAED;;;;;GAKG;AACH,SAAgB,QAAQ,CAAC,EAAmB;IAC1C,MAAM,KAAK,GAAG,kBAAkB,CAAC,EAAE,CAAC,CAAC;IACrC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACf,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACf,MAAM,MAAM,GAAG,IAAI,GAAG,EAAuB,CAAC;IAC9C,KAAK,MAAM,CAAC,IAAI,KAAK;QAAE,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;IAEhD,MAAM,SAAS,GAAG,CAAC,CAAS,EAAa,EAAE;QACzC,IAAI,CAAC,KAAK,GAAG;YAAE,OAAO,WAAG,CAAC;QAC1B,IAAI,CAAC,KAAK,GAAG;YAAE,OAAO,cAAM,CAAC;QAC7B,OAAO,IAAA,cAAM,EAAC,CAAC,CAAC,CAAC;IACnB,CAAC,CAAC;IAEF,KAAK,MAAM,GAAG,IAAI,KAAK,EAAE,CAAC;QACxB,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC/B,IAAI,CAAC,MAAM;YAAE,SAAS;QACtB,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC;QAC5B,qEAAqE;QACrE,MAAM,MAAM,GAAG,aAAa,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QACvC,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,4CAA4C;YAC5C,KAAK,MAAM,GAAG,IAAI,KAAK;gBAAE,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACzC,SAAS;QACX,CAAC;QACD,KAAK,MAAM,GAAG,IAAI,KAAK,EAAE,CAAC;YACxB,IAAI,GAAG,KAAK,GAAG,EAAE,CAAC;gBAChB,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAChB,SAAS;YACX,CAAC;YACD,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC;YAC5B,IAAI,UAAU,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,EAAE,CAAC;gBAC/B,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAClB,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAS,kBAAkB,CAAC,EAAmB;IAC7C,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;IAC9B,MAAM,IAAI,GAAG,CAAC,CAAY,EAAE,EAAE;QAC5B,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ,IAAI,CAAC,CAAC,IAAI;YAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACnD,IAAI,CAAC,CAAC,GAAG;YAAE,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACvB,IAAI,CAAC,CAAC,IAAI;YAAE,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI;gBAAE,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9C,CAAC,CAAC;IACF,KAAK,MAAM,EAAE,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC;QACzB,IAAI,OAAO,EAAE,CAAC,IAAI,KAAK,QAAQ;YAAE,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;QAC/C,IAAI,OAAO,EAAE,CAAC,KAAK,KAAK,QAAQ;YAAE,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;IACnD,CAAC;IACD,KAAK,MAAM,EAAE,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC;QACzB,IAAI,OAAO,EAAE,CAAC,KAAK,KAAK,QAAQ;YAAE,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;IACnD,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC"}

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

@@ -0,0 +1,45 @@
+export type DLConceptKind = 'top' | 'bottom' | 'atomic' | 'not' | 'and' | 'or' | 'exists' | 'forall';
+export interface DLConcept {
+    kind: DLConceptKind;
+    /** Atomic concept name (kind = 'atomic'). */
+    name?: string;
+    /** Single sub-concept (kind = 'not' / 'exists' / 'forall'). */
+    arg?: DLConcept;
+    /** n-ary children (kind = 'and' / 'or'). */
+    args?: DLConcept[];
+    /** Role name (kind = 'exists' / 'forall'). */
+    role?: string;
+}
+export type DLAxiomKind = 'subsumes' | 'equivalent' | 'instance' | 'role-instance';
+export interface DLAxiom {
+    kind: DLAxiomKind;
+    /**
+     * - subsumes / equivalent: ambos lados son DLConcept (C ⊑ D, C ≡ D).
+     * - instance:              left = individuo (string), right = DLConcept.
+     * - role-instance:         left = individuo, right = individuo, role = nombre del rol.
+     */
+    left: DLConcept | string;
+    right: DLConcept | string;
+    /** Solo para role-instance. */
+    role?: string;
+}
+export interface DLKnowledgeBase {
+    /** Schema-level: subsumption / equivalence. */
+    tbox: DLAxiom[];
+    /** Instance assertions: instance + role-instance. */
+    abox: DLAxiom[];
+}
+export declare const TOP: DLConcept;
+export declare const BOTTOM: DLConcept;
+export declare function atomic(name: string): DLConcept;
+export declare function not(c: DLConcept): DLConcept;
+export declare function and(...args: DLConcept[]): DLConcept;
+export declare function or(...args: DLConcept[]): DLConcept;
+export declare function exists(role: string, c: DLConcept): DLConcept;
+export declare function forall(role: string, c: DLConcept): DLConcept;
+export declare function subsumes(left: DLConcept, right: DLConcept): DLAxiom;
+export declare function equivalent(left: DLConcept, right: DLConcept): DLAxiom;
+export declare function instance(individual: string, concept: DLConcept): DLAxiom;
+export declare function roleInstance(from: string, role: string, to: string): DLAxiom;
+export declare function emptyKB(): DLKnowledgeBase;
+//# sourceMappingURL=types.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../src/profiles/description-logic/types.ts"],"names":[],"mappings":"AAaA,MAAM,MAAM,aAAa,GACrB,KAAK,GACL,QAAQ,GACR,QAAQ,GACR,KAAK,GACL,KAAK,GACL,IAAI,GACJ,QAAQ,GACR,QAAQ,CAAC;AAEb,MAAM,WAAW,SAAS;IACxB,IAAI,EAAE,aAAa,CAAC;IACpB,6CAA6C;IAC7C,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,+DAA+D;IAC/D,GAAG,CAAC,EAAE,SAAS,CAAC;IAChB,4CAA4C;IAC5C,IAAI,CAAC,EAAE,SAAS,EAAE,CAAC;IACnB,8CAA8C;IAC9C,IAAI,CAAC,EAAE,MAAM,CAAC;CACf;AAED,MAAM,MAAM,WAAW,GAAG,UAAU,GAAG,YAAY,GAAG,UAAU,GAAG,eAAe,CAAC;AAEnF,MAAM,WAAW,OAAO;IACtB,IAAI,EAAE,WAAW,CAAC;IAClB;;;;OAIG;IACH,IAAI,EAAE,SAAS,GAAG,MAAM,CAAC;IACzB,KAAK,EAAE,SAAS,GAAG,MAAM,CAAC;IAC1B,+BAA+B;IAC/B,IAAI,CAAC,EAAE,MAAM,CAAC;CACf;AAED,MAAM,WAAW,eAAe;IAC9B,+CAA+C;IAC/C,IAAI,EAAE,OAAO,EAAE,CAAC;IAChB,qDAAqD;IACrD,IAAI,EAAE,OAAO,EAAE,CAAC;CACjB;AAID,eAAO,MAAM,GAAG,EAAE,SAA2B,CAAC;AAC9C,eAAO,MAAM,MAAM,EAAE,SAA8B,CAAC;AAEpD,wBAAgB,MAAM,CAAC,IAAI,EAAE,MAAM,GAAG,SAAS,CAE9C;AAED,wBAAgB,GAAG,CAAC,CAAC,EAAE,SAAS,GAAG,SAAS,CAE3C;AAED,wBAAgB,GAAG,CAAC,GAAG,IAAI,EAAE,SAAS,EAAE,GAAG,SAAS,CAInD;AAED,wBAAgB,EAAE,CAAC,GAAG,IAAI,EAAE,SAAS,EAAE,GAAG,SAAS,CAIlD;AAED,wBAAgB,MAAM,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,SAAS,GAAG,SAAS,CAE5D;AAED,wBAAgB,MAAM,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,SAAS,GAAG,SAAS,CAE5D;AAED,wBAAgB,QAAQ,CAAC,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,SAAS,GAAG,OAAO,CAEnE;AAED,wBAAgB,UAAU,CAAC,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,SAAS,GAAG,OAAO,CAErE;AAED,wBAAgB,QAAQ,CAAC,UAAU,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,GAAG,OAAO,CAExE;AAED,wBAAgB,YAAY,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,OAAO,CAE5E;AAED,wBAAgB,OAAO,IAAI,eAAe,CAEzC"}

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

@@ -0,0 +1,71 @@
+"use strict";
+// ============================================================
+// ST Description Logic — ALC types
+// ============================================================
+// ALC: el fragmento base de OWL/DL.
+// Conceptos C, roles R (binarios), individuos a.
+//   ⊤ ⊥   top / bottom
+//   ¬C    complemento
+//   C ⊓ D intersección
+//   C ⊔ D unión
+//   ∃R.C  restricción existencial
+//   ∀R.C  restricción de valor
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.BOTTOM = exports.TOP = void 0;
+exports.atomic = atomic;
+exports.not = not;
+exports.and = and;
+exports.or = or;
+exports.exists = exists;
+exports.forall = forall;
+exports.subsumes = subsumes;
+exports.equivalent = equivalent;
+exports.instance = instance;
+exports.roleInstance = roleInstance;
+exports.emptyKB = emptyKB;
+// ── Constructores de conveniencia ──────────────────────────
+exports.TOP = { kind: 'top' };
+exports.BOTTOM = { kind: 'bottom' };
+function atomic(name) {
+    return { kind: 'atomic', name };
+}
+function not(c) {
+    return { kind: 'not', arg: c };
+}
+function and(...args) {
+    if (args.length === 0)
+        return exports.TOP;
+    if (args.length === 1)
+        return args[0];
+    return { kind: 'and', args };
+}
+function or(...args) {
+    if (args.length === 0)
+        return exports.BOTTOM;
+    if (args.length === 1)
+        return args[0];
+    return { kind: 'or', args };
+}
+function exists(role, c) {
+    return { kind: 'exists', role, arg: c };
+}
+function forall(role, c) {
+    return { kind: 'forall', role, arg: c };
+}
+function subsumes(left, right) {
+    return { kind: 'subsumes', left, right };
+}
+function equivalent(left, right) {
+    return { kind: 'equivalent', left, right };
+}
+function instance(individual, concept) {
+    return { kind: 'instance', left: individual, right: concept };
+}
+function roleInstance(from, role, to) {
+    return { kind: 'role-instance', left: from, right: to, role };
+}
+function emptyKB() {
+    return { tbox: [], abox: [] };
+}
+//# sourceMappingURL=types.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../src/profiles/description-logic/types.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,mCAAmC;AACnC,+DAA+D;AAC/D,oCAAoC;AACpC,iDAAiD;AACjD,uBAAuB;AACvB,sBAAsB;AACtB,uBAAuB;AACvB,gBAAgB;AAChB,kCAAkC;AAClC,+BAA+B;AAC/B,+DAA+D;;;AAmD/D,wBAEC;AAED,kBAEC;AAED,kBAIC;AAED,gBAIC;AAED,wBAEC;AAED,wBAEC;AAED,4BAEC;AAED,gCAEC;AAED,4BAEC;AAED,oCAEC;AAED,0BAEC;AAnDD,8DAA8D;AAEjD,QAAA,GAAG,GAAc,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;AACjC,QAAA,MAAM,GAAc,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC;AAEpD,SAAgB,MAAM,CAAC,IAAY;IACjC,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC;AAClC,CAAC;AAED,SAAgB,GAAG,CAAC,CAAY;IAC9B,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;AACjC,CAAC;AAED,SAAgB,GAAG,CAAC,GAAG,IAAiB;IACtC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,WAAG,CAAC;IAClC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC;IACtC,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;AAC/B,CAAC;AAED,SAAgB,EAAE,CAAC,GAAG,IAAiB;IACrC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,cAAM,CAAC;IACrC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC;IACtC,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;AAC9B,CAAC;AAED,SAAgB,MAAM,CAAC,IAAY,EAAE,CAAY;IAC/C,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;AAC1C,CAAC;AAED,SAAgB,MAAM,CAAC,IAAY,EAAE,CAAY;IAC/C,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;AAC1C,CAAC;AAED,SAAgB,QAAQ,CAAC,IAAe,EAAE,KAAgB;IACxD,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;AAC3C,CAAC;AAED,SAAgB,UAAU,CAAC,IAAe,EAAE,KAAgB;IAC1D,OAAO,EAAE,IAAI,EAAE,YAAY,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;AAC7C,CAAC;AAED,SAAgB,QAAQ,CAAC,UAAkB,EAAE,OAAkB;IAC7D,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC;AAChE,CAAC;AAED,SAAgB,YAAY,CAAC,IAAY,EAAE,IAAY,EAAE,EAAU;IACjE,OAAO,EAAE,IAAI,EAAE,eAAe,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC;AAChE,CAAC;AAED,SAAgB,OAAO;IACrB,OAAO,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC;AAChC,CAAC"}

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

@@ -0,0 +1,5 @@
+export type { HybridFormula, HybridFormulaKind, HybridFrame } from './types';
+export { atom, nominal, not, and, or, implies, box, diamond, at, down, existsWorld, formulaToString, } from './types';
+export { satisfies, isSatisfiableInFrame } from './semantics';
+export { isSatisfiable } from './sat';
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/profiles/hybrid-logic/index.ts"],"names":[],"mappings":"AAaA,YAAY,EAAE,aAAa,EAAE,iBAAiB,EAAE,WAAW,EAAE,MAAM,SAAS,CAAC;AAE7E,OAAO,EACL,IAAI,EACJ,OAAO,EACP,GAAG,EACH,GAAG,EACH,EAAE,EACF,OAAO,EACP,GAAG,EACH,OAAO,EACP,EAAE,EACF,IAAI,EACJ,WAAW,EACX,eAAe,GAChB,MAAM,SAAS,CAAC;AAEjB,OAAO,EAAE,SAAS,EAAE,oBAAoB,EAAE,MAAM,aAAa,CAAC;AAE9D,OAAO,EAAE,aAAa,EAAE,MAAM,OAAO,CAAC"}