@stevenvo780/st-lang 0.3.0 → 0.4.0

package/dist/profiles/modal/k.js

@@ -1,38 +1,332 @@
 "use strict";
 // ============================================================
-// ST Modal K — Stub (contrato definido)
+// ST Modal K — Labeled Tableau v3 (Gamma-Watchers)
+// ============================================================
+// Motor completo de tableau etiquetado para lógica modal K.
+// Resuelve el problema del Axioma K mediante el patrón
+// Gamma-Watcher: las reglas gamma se registran como observadores
+// permanentes que se re-instancian cuando Delta crea mundos nuevos.
 // ============================================================
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.ModalK = void 0;
 const propositional_1 = require("../classical/propositional");
+const MAX_DEPTH = 200;
+// ── Eliminación de implies/biconditional ────────────────────
+// toNNF conserva implies/biconditional en caso no-negado.
+// El tableau necesita que todo sea and/or/not/atom/modal.
+function eliminateConnectives(f) {
+    const args = (f.args || []).map(eliminateConnectives);
+    switch (f.kind) {
+        case 'implies':
+            // A -> B  ≡  ¬A ∨ B
+            return { kind: 'or', args: [{ kind: 'not', args: [args[0]] }, args[1]] };
+        case 'biconditional':
+            // A <-> B  ≡  (A ∧ B) ∨ (¬A ∧ ¬B)
+            return {
+                kind: 'or',
+                args: [
+                    { kind: 'and', args: [args[0], args[1]] },
+                    { kind: 'and', args: [{ kind: 'not', args: [args[0]] }, { kind: 'not', args: [args[1]] }] },
+                ],
+            };
+        case 'modal_necessity':
+        case 'modal_possibility':
+            return { ...f, args };
+        case 'not':
+            return { ...f, args };
+        case 'and':
+        case 'or':
+            return { ...f, args };
+        default:
+            return f;
+    }
+}
+/** NNF completo: primero elimina implies/biconditional, luego aplica toNNF */
+function fullNNF(f) {
+    return (0, propositional_1.toNNF)(eliminateConnectives(f));
+}
+// ── Utilidades ──────────────────────────────────────────────
+function formulaEqual(a, b) {
+    if (a.kind !== b.kind)
+        return false;
+    if (a.kind === 'atom' && b.kind === 'atom')
+        return a.name === b.name;
+    const aa = a.args || [];
+    const bb = b.args || [];
+    if (aa.length !== bb.length)
+        return false;
+    return aa.every((ai, i) => formulaEqual(ai, bb[i]));
+}
+function formulaHash(f) {
+    // Hash propio que SÍ maneja operadores modales (formulaToString no lo hace)
+    switch (f.kind) {
+        case 'atom': return f.name || '?';
+        case 'not': return `!${formulaHash((f.args || [])[0])}`;
+        case 'and': return `(${formulaHash((f.args || [])[0])} & ${formulaHash((f.args || [])[1])})`;
+        case 'or': return `(${formulaHash((f.args || [])[0])} | ${formulaHash((f.args || [])[1])})`;
+        case 'implies': return `(${formulaHash((f.args || [])[0])} -> ${formulaHash((f.args || [])[1])})`;
+        case 'biconditional': return `(${formulaHash((f.args || [])[0])} <-> ${formulaHash((f.args || [])[1])})`;
+        case 'modal_necessity': return `[](${formulaHash((f.args || [])[0])})`;
+        case 'modal_possibility': return `<>(${formulaHash((f.args || [])[0])})`;
+        case 'forall': return `A${f.variable}(${formulaHash((f.args || [])[0])})`;
+        case 'exists': return `E${f.variable}(${formulaHash((f.args || [])[0])})`;
+        case 'predicate': return `${f.name}(${(f.args || []).map(formulaHash).join(',')})`;
+        default: return f.kind;
+    }
+}
+function nodeKey(n) {
+    return `${n.world}:${formulaHash(n.formula)}`;
+}
+function cloneBranch(b) {
+    return {
+        literals: [...b.literals],
+        pending: [...b.pending],
+        accessibility: new Map(Array.from(b.accessibility.entries()).map(([k, v]) => [k, new Set(v)])),
+        gammaWatchers: [...b.gammaWatchers],
+        processed: new Set(b.processed),
+        worldCounter: b.worldCounter,
+    };
+}
+function classify(f) {
+    switch (f.kind) {
+        case 'and': return 'alfa';
+        case 'or': return 'beta';
+        case 'implies': return 'beta'; // A->B = !A | B en NNF, pero si llega, tratar como beta
+        case 'modal_possibility': return 'delta';
+        case 'modal_necessity': return 'gamma';
+        default: return 'literal';
+    }
+}
+// ── Motor principal ─────────────────────────────────────────
 class ModalK {
     name = 'modal.k';
-    description = 'Logica modal K (stub — contrato definido, motor pendiente)';
+    description = 'Logica modal K — Labeled Tableau v3 (Gamma-Watchers)';
     checkWellFormed(formula) {
-        return [];
+        const diags = [];
+        const walk = (f) => {
+            if (f.kind === 'atom' && !f.name)
+                diags.push({ severity: 'error', message: 'Atomo sin nombre' });
+            f.args?.forEach(walk);
+        };
+        walk(formula);
+        return diags;
     }
     checkValid(formula) {
+        const negated = fullNNF({ kind: 'not', args: [formula] });
+        const closed = this.tableau(negated);
         return {
-            status: 'unknown',
-            output: `[modal.k] Motor no implementado aun. Formula: ${(0, propositional_1.formulaToString)(formula)}`,
-            diagnostics: [{ severity: 'warning', message: 'Perfil modal.k aun no tiene motor completo' }],
+            status: closed ? 'valid' : 'invalid',
+            output: closed
+                ? `${(0, propositional_1.formulaToString)(formula)} es VALIDA en K`
+                : `${(0, propositional_1.formulaToString)(formula)} NO es valida en K`,
+            diagnostics: [],
             formula,
         };
     }
     checkSatisfiable(formula) {
-        return { status: 'unknown', output: '[modal.k] No implementado', diagnostics: [{ severity: 'warning', message: 'Motor no implementado' }], formula };
+        const nnf = fullNNF(formula);
+        const closed = this.tableau(nnf);
+        return {
+            status: !closed ? 'satisfiable' : 'unsatisfiable',
+            output: !closed ? 'Satisfacible' : 'Insatisfacible',
+            diagnostics: [],
+            formula,
+        };
     }
     prove(goal, theory) {
-        return { status: 'unknown', output: '[modal.k] No implementado', diagnostics: [{ severity: 'warning', message: 'Motor no implementado' }], formula: goal };
+        const axiomNodes = Array.from(theory.axioms.values())
+            .map(a => ({ formula: fullNNF(a), world: 'w0' }));
+        const negGoal = { formula: fullNNF({ kind: 'not', args: [goal] }), world: 'w0' };
+        const allNodes = [...axiomNodes, negGoal];
+        const branch = this.makeBranch(allNodes);
+        const closed = this.expand(branch, 0);
+        return {
+            status: closed ? 'provable' : 'refutable',
+            output: closed ? 'Demostrado por tableau' : 'No demostrable',
+            diagnostics: [],
+            formula: goal,
+        };
     }
     derive(goal, premises, theory) {
-        return { status: 'unknown', output: '[modal.k] No implementado', diagnostics: [{ severity: 'warning', message: 'Motor no implementado' }], formula: goal };
+        const formulas = premises
+            .map(p => theory.axioms.get(p))
+            .filter((f) => !!f);
+        const nodes = [
+            ...formulas.map(f => ({ formula: fullNNF(f), world: 'w0' })),
+            { formula: fullNNF({ kind: 'not', args: [goal] }), world: 'w0' },
+        ];
+        const branch = this.makeBranch(nodes);
+        const closed = this.expand(branch, 0);
+        return {
+            status: closed ? 'provable' : 'refutable',
+            output: closed ? 'Derivacion valida' : 'Derivacion no valida',
+            diagnostics: [],
+            formula: goal,
+        };
     }
     countermodel(formula) {
-        return { status: 'unknown', output: '[modal.k] No implementado', diagnostics: [{ severity: 'warning', message: 'Motor no implementado' }], formula };
+        return this.checkValid(formula);
     }
     explain(formula) {
-        return { status: 'unknown', output: '[modal.k] No implementado', diagnostics: [{ severity: 'warning', message: 'Motor no implementado' }], formula };
+        return {
+            status: 'unknown',
+            output: `Modal K — Labeled Tableau v3`,
+            diagnostics: [],
+            formula,
+        };
+    }
+    // ── Punto de entrada del tableau ──────────────────────────
+    tableau(formula) {
+        const branch = this.makeBranch([{ formula, world: 'w0' }]);
+        return this.expand(branch, 0);
+    }
+    makeBranch(nodes) {
+        return {
+            literals: [],
+            pending: [...nodes],
+            accessibility: new Map([['w0', new Set()]]),
+            gammaWatchers: [],
+            processed: new Set(),
+            worldCounter: 1,
+        };
+    }
+    // ── Expansión del tableau ─────────────────────────────────
+    expand(branch, depth) {
+        if (depth > MAX_DEPTH)
+            return false;
+        // 1. Procesar todos los literales primero
+        while (true) {
+            const litIdx = branch.pending.findIndex(n => classify(n.formula) === 'literal');
+            if (litIdx === -1)
+                break;
+            const node = branch.pending.splice(litIdx, 1)[0];
+            // Comprobar cierre
+            if (this.closes(branch, node))
+                return true;
+            branch.literals.push(node);
+        }
+        // 2. Buscar siguiente regla por prioridad: alfa → delta → gamma → beta
+        const priorities = ['alfa', 'delta', 'gamma', 'beta'];
+        for (const priority of priorities) {
+            const idx = branch.pending.findIndex(n => {
+                const t = classify(n.formula);
+                if (t !== priority)
+                    return false;
+                if (priority === 'gamma')
+                    return true; // Gamma siempre se puede intentar
+                const key = nodeKey(n);
+                return !branch.processed.has(key);
+            });
+            if (idx === -1)
+                continue;
+            const node = branch.pending.splice(idx, 1)[0];
+            const key = nodeKey(node);
+            switch (priority) {
+                case 'alfa':
+                    return this.applyAlfa(branch, node, key, depth);
+                case 'delta':
+                    return this.applyDelta(branch, node, key, depth);
+                case 'gamma':
+                    return this.applyGamma(branch, node, key, depth);
+                case 'beta':
+                    return this.applyBeta(branch, node, key, depth);
+            }
+        }
+        // Sin más reglas que aplicar: rama abierta
+        return false;
+    }
+    // ── Regla Alfa (conjunción) ───────────────────────────────
+    applyAlfa(branch, node, key, depth) {
+        branch.processed.add(key);
+        const args = node.formula.args || [];
+        if (args.length < 2)
+            return this.expand(branch, depth + 1);
+        branch.pending.push({ formula: args[0], world: node.world }, { formula: args[1], world: node.world });
+        return this.expand(branch, depth + 1);
+    }
+    // ── Regla Delta (posibilidad: crea mundo nuevo) ───────────
+    applyDelta(branch, node, key, depth) {
+        branch.processed.add(key);
+        const inner = (node.formula.args || [])[0];
+        if (!inner)
+            return this.expand(branch, depth + 1);
+        const newWorld = `w${branch.worldCounter++}`;
+        // Establecer accesibilidad: sourceWorld → newWorld
+        if (!branch.accessibility.has(node.world)) {
+            branch.accessibility.set(node.world, new Set());
+        }
+        branch.accessibility.get(node.world).add(newWorld);
+        branch.accessibility.set(newWorld, new Set());
+        // Agregar la subfórmula en el mundo nuevo
+        branch.pending.push({ formula: inner, world: newWorld });
+        // ★ Clave: Re-instanciar TODOS los gamma-watchers del mundo fuente
+        for (const watcher of branch.gammaWatchers) {
+            if (watcher.sourceWorld === node.world) {
+                const instKey = `gamma-inst:${newWorld}:${formulaHash(watcher.innerFormula)}`;
+                if (!branch.processed.has(instKey)) {
+                    branch.processed.add(instKey);
+                    branch.pending.push({ formula: watcher.innerFormula, world: newWorld });
+                }
+            }
+        }
+        return this.expand(branch, depth + 1);
+    }
+    // ── Regla Gamma (necesidad: instanciar en mundos accesibles) ──
+    applyGamma(branch, node, _key, depth) {
+        const inner = (node.formula.args || [])[0];
+        if (!inner)
+            return this.expand(branch, depth + 1);
+        // Registrar como gamma-watcher permanente (si no existe ya)
+        const watcherExists = branch.gammaWatchers.some(w => w.sourceWorld === node.world && formulaEqual(w.innerFormula, inner));
+        if (!watcherExists) {
+            branch.gammaWatchers.push({ innerFormula: inner, sourceWorld: node.world });
+        }
+        // Instanciar en todos los mundos accesibles existentes
+        const accessibleWorlds = branch.accessibility.get(node.world) || new Set();
+        let addedAny = false;
+        for (const targetWorld of accessibleWorlds) {
+            const instKey = `gamma-inst:${targetWorld}:${formulaHash(inner)}`;
+            if (!branch.processed.has(instKey)) {
+                branch.processed.add(instKey);
+                branch.pending.push({ formula: inner, world: targetWorld });
+                addedAny = true;
+            }
+        }
+        // Gamma se descarta del pending (ya registrada como watcher)
+        // No se marca en processed como los demás, porque es re-usable
+        if (addedAny) {
+            return this.expand(branch, depth + 1);
+        }
+        // Si no se agregó nada, continuar con el siguiente pending
+        return this.expand(branch, depth + 1);
+    }
+    // ── Regla Beta (disyunción: bifurca) ──────────────────────
+    applyBeta(branch, node, key, depth) {
+        branch.processed.add(key);
+        const args = node.formula.args || [];
+        if (args.length < 2)
+            return this.expand(branch, depth + 1);
+        // Bifurcar: ambas ramas deben cerrarse para que el tableau cierre
+        const branchLeft = cloneBranch(branch);
+        branchLeft.pending.push({ formula: args[0], world: node.world });
+        const branchRight = cloneBranch(branch);
+        branchRight.pending.push({ formula: args[1], world: node.world });
+        return this.expand(branchLeft, depth + 1) && this.expand(branchRight, depth + 1);
+    }
+    // ── Detección de cierre (contradicción) ───────────────────
+    closes(branch, node) {
+        const f = node.formula;
+        const w = node.world;
+        // Caso 1: node = !A, buscar A en literals
+        if (f.kind === 'not' && f.args?.[0]) {
+            const target = f.args[0];
+            return branch.literals.some(lit => lit.world === w && formulaEqual(lit.formula, target));
+        }
+        // Caso 2: node = A, buscar !A en literals
+        return branch.literals.some(lit => lit.world === w
+            && lit.formula.kind === 'not'
+            && lit.formula.args?.[0] !== undefined
+            && formulaEqual(lit.formula.args[0], f));
     }
 }
 exports.ModalK = ModalK;

package/dist/profiles/modal/k.js.map

@@ -1 +1 @@
-{"version":3,"file":"k.js","sourceRoot":"","sources":["../../../src/profiles/modal/k.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,wCAAwC;AACxC,+DAA+D;;;AAK/D,8DAA6D;AAE7D,MAAa,MAAM;IACjB,IAAI,GAAG,SAAS,CAAC;IACjB,WAAW,GAAG,4DAA4D,CAAC;IAE3E,eAAe,CAAC,OAAgB;QAC9B,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,UAAU,CAAC,OAAgB;QACzB,OAAO;YACL,MAAM,EAAE,SAAS;YACjB,MAAM,EAAE,iDAAiD,IAAA,+BAAe,EAAC,OAAO,CAAC,EAAE;YACnF,WAAW,EAAE,CAAC,EAAE,QAAQ,EAAE,SAAS,EAAE,OAAO,EAAE,4CAA4C,EAAE,CAAC;YAC7F,OAAO;SACR,CAAC;IACJ,CAAC;IAED,gBAAgB,CAAC,OAAgB;QAC/B,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,2BAA2B,EAAE,WAAW,EAAE,CAAC,EAAE,QAAQ,EAAE,SAAS,EAAE,OAAO,EAAE,uBAAuB,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC;IACvJ,CAAC;IAED,KAAK,CAAC,IAAa,EAAE,MAAc;QACjC,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,2BAA2B,EAAE,WAAW,EAAE,CAAC,EAAE,QAAQ,EAAE,SAAS,EAAE,OAAO,EAAE,uBAAuB,EAAE,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;IAC7J,CAAC;IAED,MAAM,CAAC,IAAa,EAAE,QAAkB,EAAE,MAAc;QACtD,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,2BAA2B,EAAE,WAAW,EAAE,CAAC,EAAE,QAAQ,EAAE,SAAS,EAAE,OAAO,EAAE,uBAAuB,EAAE,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;IAC7J,CAAC;IAED,YAAY,CAAC,OAAgB;QAC3B,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,2BAA2B,EAAE,WAAW,EAAE,CAAC,EAAE,QAAQ,EAAE,SAAS,EAAE,OAAO,EAAE,uBAAuB,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC;IACvJ,CAAC;IAED,OAAO,CAAC,OAAgB;QACtB,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,2BAA2B,EAAE,WAAW,EAAE,CAAC,EAAE,QAAQ,EAAE,SAAS,EAAE,OAAO,EAAE,uBAAuB,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC;IACvJ,CAAC;CACF;AApCD,wBAoCC"}
+{"version":3,"file":"k.js","sourceRoot":"","sources":["../../../src/profiles/modal/k.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,mDAAmD;AACnD,+DAA+D;AAC/D,4DAA4D;AAC5D,uDAAuD;AACvD,iEAAiE;AACjE,oEAAoE;AACpE,+DAA+D;;;AAG/D,8DAAoE;AAuBpE,MAAM,SAAS,GAAG,GAAG,CAAC;AAEtB,+DAA+D;AAC/D,0DAA0D;AAC1D,0DAA0D;AAE1D,SAAS,oBAAoB,CAAC,CAAU;IACtC,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,oBAAoB,CAAC,CAAC;IACtD,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,SAAS;YACZ,oBAAoB;YACpB,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAC3E,KAAK,eAAe;YAClB,kCAAkC;YAClC,OAAO;gBACL,IAAI,EAAE,IAAI;gBACV,IAAI,EAAE;oBACJ,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE;oBACzC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE;iBAC5F;aACF,CAAC;QACJ,KAAK,iBAAiB,CAAC;QACvB,KAAK,mBAAmB;YACtB,OAAO,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,CAAC;QACxB,KAAK,KAAK;YACR,OAAO,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,CAAC;QACxB,KAAK,KAAK,CAAC;QACX,KAAK,IAAI;YACP,OAAO,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,CAAC;QACxB;YACE,OAAO,CAAC,CAAC;IACb,CAAC;AACH,CAAC;AAED,8EAA8E;AAC9E,SAAS,OAAO,CAAC,CAAU;IACzB,OAAO,IAAA,qBAAK,EAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC,CAAC;AACxC,CAAC;AAED,+DAA+D;AAE/D,SAAS,YAAY,CAAC,CAAU,EAAE,CAAU;IAC1C,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI;QAAE,OAAO,KAAK,CAAC;IACpC,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM;QAAE,OAAO,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,CAAC;IACrE,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC;IACxB,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC;IACxB,IAAI,EAAE,CAAC,MAAM,KAAK,EAAE,CAAC,MAAM;QAAE,OAAO,KAAK,CAAC;IAC1C,OAAO,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,YAAY,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACtD,CAAC;AAED,SAAS,WAAW,CAAC,CAAU;IAC7B,4EAA4E;IAC5E,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,MAAM,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,IAAI,GAAG,CAAC;QAClC,KAAK,KAAK,CAAC,CAAC,OAAO,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QACxD,KAAK,KAAK,CAAC,CAAC,OAAO,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;QAC7F,KAAK,IAAI,CAAC,CAAC,OAAO,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;QAC5F,KAAK,SAAS,CAAC,CAAC,OAAO,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;QAClG,KAAK,eAAe,CAAC,CAAC,OAAO,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;QACzG,KAAK,iBAAiB,CAAC,CAAC,OAAO,MAAM,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;QACvE,KAAK,mBAAmB,CAAC,CAAC,OAAO,MAAM,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;QACzE,KAAK,QAAQ,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,QAAQ,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;QAC1E,KAAK,QAAQ,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,QAAQ,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;QAC1E,KAAK,WAAW,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;QACnF,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC;IACzB,CAAC;AACH,CAAC;AAED,SAAS,OAAO,CAAC,CAAc;IAC7B,OAAO,GAAG,CAAC,CAAC,KAAK,IAAI,WAAW,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC;AAChD,CAAC;AAED,SAAS,WAAW,CAAC,CAAS;IAC5B,OAAO;QACL,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC;QACzB,OAAO,EAAE,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC;QACvB,aAAa,EAAE,IAAI,GAAG,CACpB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,aAAa,CAAC,OAAO,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CACvE;QACD,aAAa,EAAE,CAAC,GAAG,CAAC,CAAC,aAAa,CAAC;QACnC,SAAS,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC;QAC/B,YAAY,EAAE,CAAC,CAAC,YAAY;KAC7B,CAAC;AACJ,CAAC;AAMD,SAAS,QAAQ,CAAC,CAAU;IAC1B,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,KAAK,CAAC,CAAC,OAAO,MAAM,CAAC;QAC1B,KAAK,IAAI,CAAC,CAAC,OAAO,MAAM,CAAC;QACzB,KAAK,SAAS,CAAC,CAAC,OAAO,MAAM,CAAC,CAAC,wDAAwD;QACvF,KAAK,mBAAmB,CAAC,CAAC,OAAO,OAAO,CAAC;QACzC,KAAK,iBAAiB,CAAC,CAAC,OAAO,OAAO,CAAC;QACvC,OAAO,CAAC,CAAC,OAAO,SAAS,CAAC;IAC5B,CAAC;AACH,CAAC;AAED,+DAA+D;AAE/D,MAAa,MAAM;IACR,IAAI,GAAG,SAAS,CAAC;IACjB,WAAW,GAAG,sDAAsD,CAAC;IAE9E,eAAe,CAAC,OAAgB;QAC9B,MAAM,KAAK,GAAiB,EAAE,CAAC;QAC/B,MAAM,IAAI,GAAG,CAAC,CAAU,EAAE,EAAE;YAC1B,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,CAAC,IAAI;gBAC9B,KAAK,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,kBAAkB,EAAE,CAAC,CAAC;YACjE,CAAC,CAAC,IAAI,EAAE,OAAO,CAAC,IAAI,CAAC,CAAC;QACxB,CAAC,CAAC;QACF,IAAI,CAAC,OAAO,CAAC,CAAC;QACd,OAAO,KAAK,CAAC;IACf,CAAC;IAED,UAAU,CAAC,OAAgB;QACzB,MAAM,OAAO,GAAG,OAAO,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QAC1D,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;QACrC,OAAO;YACL,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS;YACpC,MAAM,EAAE,MAAM;gBACZ,CAAC,CAAC,GAAG,IAAA,+BAAe,EAAC,OAAO,CAAC,iBAAiB;gBAC9C,CAAC,CAAC,GAAG,IAAA,+BAAe,EAAC,OAAO,CAAC,oBAAoB;YACnD,WAAW,EAAE,EAAE;YACf,OAAO;SACR,CAAC;IACJ,CAAC;IAED,gBAAgB,CAAC,OAAgB;QAC/B,MAAM,GAAG,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC;QAC7B,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QACjC,OAAO;YACL,MAAM,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,eAAe;YACjD,MAAM,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,gBAAgB;YACnD,WAAW,EAAE,EAAE;YACf,OAAO;SACR,CAAC;IACJ,CAAC;IAED,KAAK,CAAC,IAAa,EAAE,MAAc;QACjC,MAAM,UAAU,GAAkB,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;aACjE,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;QACpD,MAAM,OAAO,GAAgB,EAAE,OAAO,EAAE,OAAO,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;QAC9F,MAAM,QAAQ,GAAG,CAAC,GAAG,UAAU,EAAE,OAAO,CAAC,CAAC;QAC1C,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;QACzC,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACtC,OAAO;YACL,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,WAAW;YACzC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,wBAAwB,CAAC,CAAC,CAAC,gBAAgB;YAC5D,WAAW,EAAE,EAAE;YACf,OAAO,EAAE,IAAI;SACd,CAAC;IACJ,CAAC;IAED,MAAM,CAAC,IAAa,EAAE,QAAkB,EAAE,MAAc;QACtD,MAAM,QAAQ,GAAG,QAAQ;aACtB,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;aAC9B,MAAM,CAAC,CAAC,CAAC,EAAgB,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACpC,MAAM,KAAK,GAAkB;YAC3B,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;YAC5D,EAAE,OAAO,EAAE,OAAO,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE;SACjE,CAAC;QACF,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QACtC,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACtC,OAAO;YACL,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,WAAW;YACzC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC,sBAAsB;YAC7D,WAAW,EAAE,EAAE;YACf,OAAO,EAAE,IAAI;SACd,CAAC;IACJ,CAAC;IAED,YAAY,CAAC,OAAgB;QAC3B,OAAO,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;IAClC,CAAC;IAED,OAAO,CAAC,OAAgB;QACtB,OAAO;YACL,MAAM,EAAE,SAAS;YACjB,MAAM,EAAE,8BAA8B;YACtC,WAAW,EAAE,EAAE;YACf,OAAO;SACR,CAAC;IACJ,CAAC;IAED,6DAA6D;IAErD,OAAO,CAAC,OAAgB;QAC9B,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;QAC3D,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IAChC,CAAC;IAEO,UAAU,CAAC,KAAoB;QACrC,OAAO;YACL,QAAQ,EAAE,EAAE;YACZ,OAAO,EAAE,CAAC,GAAG,KAAK,CAAC;YACnB,aAAa,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,GAAG,EAAU,CAAC,CAAC,CAAC;YACnD,aAAa,EAAE,EAAE;YACjB,SAAS,EAAE,IAAI,GAAG,EAAE;YACpB,YAAY,EAAE,CAAC;SAChB,CAAC;IACJ,CAAC;IAED,6DAA6D;IAErD,MAAM,CAAC,MAAc,EAAE,KAAa;QAC1C,IAAI,KAAK,GAAG,SAAS;YAAE,OAAO,KAAK,CAAC;QAEpC,0CAA0C;QAC1C,OAAO,IAAI,EAAE,CAAC;YACZ,MAAM,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,SAAS,CAAC,CAAC;YAChF,IAAI,MAAM,KAAK,CAAC,CAAC;gBAAE,MAAM;YAEzB,MAAM,IAAI,GAAG,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACjD,mBAAmB;YACnB,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC;gBAAE,OAAO,IAAI,CAAC;YAC3C,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC7B,CAAC;QAED,uEAAuE;QACvE,MAAM,UAAU,GAAe,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC;QAElE,KAAK,MAAM,QAAQ,IAAI,UAAU,EAAE,CAAC;YAClC,MAAM,GAAG,GAAG,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE;gBACvC,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;gBAC9B,IAAI,CAAC,KAAK,QAAQ;oBAAE,OAAO,KAAK,CAAC;gBACjC,IAAI,QAAQ,KAAK,OAAO;oBAAE,OAAO,IAAI,CAAC,CAAC,kCAAkC;gBACzE,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;gBACvB,OAAO,CAAC,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACpC,CAAC,CAAC,CAAC;YAEH,IAAI,GAAG,KAAK,CAAC,CAAC;gBAAE,SAAS;YAEzB,MAAM,IAAI,GAAG,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC9C,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;YAE1B,QAAQ,QAAQ,EAAE,CAAC;gBACjB,KAAK,MAAM;oBACT,OAAO,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;gBAClD,KAAK,OAAO;oBACV,OAAO,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;gBACnD,KAAK,OAAO;oBACV,OAAO,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;gBACnD,KAAK,MAAM;oBACT,OAAO,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;YACpD,CAAC;QACH,CAAC;QAED,2CAA2C;QAC3C,OAAO,KAAK,CAAC;IACf,CAAC;IAED,6DAA6D;IAErD,SAAS,CAAC,MAAc,EAAE,IAAiB,EAAE,GAAW,EAAE,KAAa;QAC7E,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC1B,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,IAAI,EAAE,CAAC;QACrC,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;YAAE,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;QAE3D,MAAM,CAAC,OAAO,CAAC,IAAI,CACjB,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,EACvC,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,CACxC,CAAC;QACF,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;IACxC,CAAC;IAED,6DAA6D;IAErD,UAAU,CAAC,MAAc,EAAE,IAAiB,EAAE,GAAW,EAAE,KAAa;QAC9E,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC1B,MAAM,KAAK,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3C,IAAI,CAAC,KAAK;YAAE,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;QAElD,MAAM,QAAQ,GAAG,IAAI,MAAM,CAAC,YAAY,EAAE,EAAE,CAAC;QAE7C,mDAAmD;QACnD,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YAC1C,MAAM,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QAClD,CAAC;QACD,MAAM,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACpD,MAAM,CAAC,aAAa,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QAE9C,0CAA0C;QAC1C,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,CAAC;QAEzD,mEAAmE;QACnE,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,aAAa,EAAE,CAAC;YAC3C,IAAI,OAAO,CAAC,WAAW,KAAK,IAAI,CAAC,KAAK,EAAE,CAAC;gBACvC,MAAM,OAAO,GAAG,cAAc,QAAQ,IAAI,WAAW,CAAC,OAAO,CAAC,YAAY,CAAC,EAAE,CAAC;gBAC9E,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;oBACnC,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;oBAC9B,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,OAAO,CAAC,YAAY,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,CAAC;gBAC1E,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;IACxC,CAAC;IAED,iEAAiE;IAEzD,UAAU,CAAC,MAAc,EAAE,IAAiB,EAAE,IAAY,EAAE,KAAa;QAC/E,MAAM,KAAK,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3C,IAAI,CAAC,KAAK;YAAE,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;QAElD,4DAA4D;QAC5D,MAAM,aAAa,GAAG,MAAM,CAAC,aAAa,CAAC,IAAI,CAC7C,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,WAAW,KAAK,IAAI,CAAC,KAAK,IAAI,YAAY,CAAC,CAAC,CAAC,YAAY,EAAE,KAAK,CAAC,CACzE,CAAC;QACF,IAAI,CAAC,aAAa,EAAE,CAAC;YACnB,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE,YAAY,EAAE,KAAK,EAAE,WAAW,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;QAC9E,CAAC;QAED,uDAAuD;QACvD,MAAM,gBAAgB,GAAG,MAAM,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,IAAI,GAAG,EAAE,CAAC;QAC3E,IAAI,QAAQ,GAAG,KAAK,CAAC;QAErB,KAAK,MAAM,WAAW,IAAI,gBAAgB,EAAE,CAAC;YAC3C,MAAM,OAAO,GAAG,cAAc,WAAW,IAAI,WAAW,CAAC,KAAK,CAAC,EAAE,CAAC;YAClE,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;gBACnC,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;gBAC9B,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,WAAW,EAAE,CAAC,CAAC;gBAC5D,QAAQ,GAAG,IAAI,CAAC;YAClB,CAAC;QACH,CAAC;QAED,6DAA6D;QAC7D,+DAA+D;QAC/D,IAAI,QAAQ,EAAE,CAAC;YACb,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;QACxC,CAAC;QAED,2DAA2D;QAC3D,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;IACxC,CAAC;IAED,6DAA6D;IAErD,SAAS,CAAC,MAAc,EAAE,IAAiB,EAAE,GAAW,EAAE,KAAa;QAC7E,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC1B,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,IAAI,EAAE,CAAC;QACrC,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;YAAE,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;QAE3D,kEAAkE;QAClE,MAAM,UAAU,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC;QACvC,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;QAEjE,MAAM,WAAW,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC;QACxC,WAAW,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;QAElE,OAAO,IAAI,CAAC,MAAM,CAAC,UAAU,EAAE,KAAK,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,WAAW,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;IACnF,CAAC;IAED,6DAA6D;IAErD,MAAM,CAAC,MAAc,EAAE,IAAiB;QAC9C,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC;QACvB,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC;QAErB,0CAA0C;QAC1C,IAAI,CAAC,CAAC,IAAI,KAAK,KAAK,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACpC,MAAM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACzB,OAAO,MAAM,CAAC,QAAQ,CAAC,IAAI,CACzB,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,KAAK,KAAK,CAAC,IAAI,YAAY,CAAC,GAAG,CAAC,OAAO,EAAE,MAAM,CAAC,CAC5D,CAAC;QACJ,CAAC;QAED,0CAA0C;QAC1C,OAAO,MAAM,CAAC,QAAQ,CAAC,IAAI,CACzB,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,KAAK,KAAK,CAAC;eACjB,GAAG,CAAC,OAAO,CAAC,IAAI,KAAK,KAAK;eAC1B,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,KAAK,SAAS;eACnC,YAAY,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAC1C,CAAC;IACJ,CAAC;CACF;AAnRD,wBAmRC"}

package/dist/profiles/paraconsistent/belnap.d.ts

@@ -1,13 +1,29 @@
-import { Formula, Diagnostic, RunResult, Theory, LogicProfile } from '../../types';
+import { Formula, RunResult, Theory, LogicProfile, Diagnostic } from '../../types';
+/**
+ * Valores de verdad en la lógica de Belnap (A4):
+ * T: True (Solo verdad)
+ * F: False (Solo falsedad)
+ * B: Both (Verdadero y Falso - Inconsistente)
+ * N: None (Ni Verdadero ni Falso - Indeterminado)
+ */
+export type BelnapValue = 'T' | 'F' | 'B' | 'N';
 export declare class ParaconsistentBelnap implements LogicProfile {
     name: string;
     description: string;
     checkWellFormed(formula: Formula): Diagnostic[];
+    /**
+     * En Belnap, una fórmula es válida si siempre evalúa a un valor "designado" (T o B).
+     */
     checkValid(formula: Formula): RunResult;
     checkSatisfiable(formula: Formula): RunResult;
     prove(goal: Formula, theory: Theory): RunResult;
     derive(goal: Formula, premises: string[], theory: Theory): RunResult;
     countermodel(formula: Formula): RunResult;
     explain(formula: Formula): RunResult;
+    private conjoin;
+    private evaluateBelnap;
+    private generateBelnapTable;
+    private collectAtoms;
+    private generateBelnapValuations;
 }
 //# sourceMappingURL=belnap.d.ts.map

package/dist/profiles/paraconsistent/belnap.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"belnap.d.ts","sourceRoot":"","sources":["../../../src/profiles/paraconsistent/belnap.ts"],"names":[],"mappings":"AAIA,OAAO,EACL,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,EAAE,YAAY,EACrD,MAAM,aAAa,CAAC;AAGrB,qBAAa,oBAAqB,YAAW,YAAY;IACvD,IAAI,SAA2B;IAC/B,WAAW,SAAoF;IAE/F,eAAe,CAAC,OAAO,EAAE,OAAO,GAAG,UAAU,EAAE;IAI/C,UAAU,CAAC,OAAO,EAAE,OAAO,GAAG,SAAS;IASvC,gBAAgB,CAAC,OAAO,EAAE,OAAO,GAAG,SAAS;IAI7C,KAAK,CAAC,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,GAAG,SAAS;IAI/C,MAAM,CAAC,IAAI,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,MAAM,EAAE,MAAM,GAAG,SAAS;IAIpE,YAAY,CAAC,OAAO,EAAE,OAAO,GAAG,SAAS;IAIzC,OAAO,CAAC,OAAO,EAAE,OAAO,GAAG,SAAS;CAGrC"}
+{"version":3,"file":"belnap.d.ts","sourceRoot":"","sources":["../../../src/profiles/paraconsistent/belnap.ts"],"names":[],"mappings":"AAIA,OAAO,EACL,OAAO,EACP,SAAS,EACT,MAAM,EACN,YAAY,EACZ,UAAU,EAGX,MAAM,aAAa,CAAC;AAGrB;;;;;;GAMG;AACH,MAAM,MAAM,WAAW,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AAiChD,qBAAa,oBAAqB,YAAW,YAAY;IACvD,IAAI,SAA2B;IAC/B,WAAW,SAAmE;IAE9E,eAAe,CAAC,OAAO,EAAE,OAAO,GAAG,UAAU,EAAE;IAe/C;;OAEG;IACH,UAAU,CAAC,OAAO,EAAE,OAAO,GAAG,SAAS;IA0BvC,gBAAgB,CAAC,OAAO,EAAE,OAAO,GAAG,SAAS;IAgB7C,KAAK,CAAC,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,GAAG,SAAS;IAiB/C,MAAM,CAAC,IAAI,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,MAAM,EAAE,MAAM,GAAG,SAAS;IAoBpE,YAAY,CAAC,OAAO,EAAE,OAAO,GAAG,SAAS;IAuBzC,OAAO,CAAC,OAAO,EAAE,OAAO,GAAG,SAAS;IASpC,OAAO,CAAC,OAAO;IAMf,OAAO,CAAC,cAAc;IAyBtB,OAAO,CAAC,mBAAmB;IAgB3B,OAAO,CAAC,YAAY;IAUpB,OAAO,CAAC,wBAAwB;CAWjC"}

package/dist/profiles/paraconsistent/belnap.js

@@ -1,38 +1,222 @@
 "use strict";
 // ============================================================
-// ST Paraconsistent Belnap — Stub (contrato definido)
+// ST Belnap — Motor Paraconsistente de 4 Valores
 // ============================================================
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.ParaconsistentBelnap = void 0;
 const propositional_1 = require("../classical/propositional");
+const VALUES = ['T', 'F', 'B', 'N'];
+/**
+ * Semántica de Belnap (Lattice-based):
+ * Negación: intercambia T/F, mantiene B/N.
+ * And: Mínimo en el retículo de información.
+ * Or: Máximo en el retículo de información.
+ */
+const BELNAP_NOT = {
+    T: 'F',
+    F: 'T',
+    B: 'B',
+    N: 'N',
+};
+// Orden de información (Truth lattice): F < B,N < T
+// Para simplificar, usamos una matriz de resultados
+const BELNAP_AND = {
+    T: { T: 'T', F: 'F', B: 'B', N: 'N' },
+    F: { T: 'F', F: 'F', B: 'F', N: 'F' },
+    B: { T: 'B', F: 'F', B: 'B', N: 'F' },
+    N: { T: 'N', F: 'F', B: 'F', N: 'N' },
+};
+const BELNAP_OR = {
+    T: { T: 'T', F: 'T', B: 'T', N: 'T' },
+    F: { T: 'T', F: 'F', B: 'B', N: 'N' },
+    B: { T: 'T', F: 'B', B: 'B', N: 'T' },
+    N: { T: 'T', F: 'N', B: 'T', N: 'N' },
+};
 class ParaconsistentBelnap {
     name = 'paraconsistent.belnap';
-    description = 'Logica paraconsistente Belnap-Dunn (stub — contrato definido, motor pendiente)';
+    description = 'Logica paraconsistente de Belnap (4-valued: T, F, Both, None)';
     checkWellFormed(formula) {
-        return [];
+        // Reutilizamos la validación proposicional, ya que la sintaxis es idéntica
+        const diags = [];
+        const check = (f) => {
+            if (f.kind === 'atom' && !f.name) {
+                diags.push({ severity: 'error', message: 'Atomo sin nombre' });
+            }
+            if (f.args) {
+                for (const arg of f.args)
+                    check(arg);
+            }
+        };
+        check(formula);
+        return diags;
     }
+    /**
+     * En Belnap, una fórmula es válida si siempre evalúa a un valor "designado" (T o B).
+     */
     checkValid(formula) {
+        const tt = this.generateBelnapTable(formula);
+        const designated = new Set(['T', 'B']);
+        const isTautology = tt.rows.every((r) => designated.has(String(r.result)));
+        if (isTautology) {
+            return {
+                status: 'valid',
+                output: `${(0, propositional_1.formulaToString)(formula)} es una tautologia en Belnap (siempre designada T/B)`,
+                truthTable: tt,
+                diagnostics: [],
+                formula,
+            };
+        }
+        const cm = tt.rows.find((r) => !designated.has(String(r.result)));
         return {
-            status: 'unknown',
-            output: `[paraconsistent.belnap] Motor no implementado aun. Formula: ${(0, propositional_1.formulaToString)(formula)}`,
-            diagnostics: [{ severity: 'warning', message: 'Perfil paraconsistent.belnap aun no tiene motor completo' }],
+            status: 'invalid',
+            output: `${(0, propositional_1.formulaToString)(formula)} no es valida en Belnap`,
+            truthTable: tt,
+            model: cm ? { type: 'propositional', valuation: cm.valuation } : undefined,
+            diagnostics: [],
             formula,
         };
     }
     checkSatisfiable(formula) {
-        return { status: 'unknown', output: '[paraconsistent.belnap] No implementado', diagnostics: [{ severity: 'warning', message: 'Motor no implementado' }], formula };
+        const tt = this.generateBelnapTable(formula);
+        const designated = new Set(['T', 'B']);
+        const isSatisfiable = tt.rows.some((r) => designated.has(String(r.result)));
+        return {
+            status: isSatisfiable ? 'satisfiable' : 'unsatisfiable',
+            output: isSatisfiable
+                ? `${(0, propositional_1.formulaToString)(formula)} es satisfacible en Belnap`
+                : `${(0, propositional_1.formulaToString)(formula)} es una contradiccion en Belnap (nunca designada)`,
+            truthTable: tt,
+            diagnostics: [],
+            formula,
+        };
     }
     prove(goal, theory) {
-        return { status: 'unknown', output: '[paraconsistent.belnap] No implementado', diagnostics: [{ severity: 'warning', message: 'Motor no implementado' }], formula: goal };
+        // Para prove en Belnap, verificamos si la inferencia es válida (preservación de valores designados)
+        const axioms = Array.from(theory.axioms.values());
+        const tt = this.generateBelnapTable({ kind: 'implies', args: [this.conjoin(axioms), goal] });
+        const designated = new Set(['T', 'B']);
+        const isProvable = tt.rows.every((r) => designated.has(String(r.result)));
+        return {
+            status: isProvable ? 'provable' : 'refutable',
+            output: isProvable
+                ? `${(0, propositional_1.formulaToString)(goal)} se sigue de la teoria en Belnap`
+                : `${(0, propositional_1.formulaToString)(goal)} no es demostrable en Belnap`,
+            diagnostics: [],
+            formula: goal,
+        };
     }
     derive(goal, premises, theory) {
-        return { status: 'unknown', output: '[paraconsistent.belnap] No implementado', diagnostics: [{ severity: 'warning', message: 'Motor no implementado' }], formula: goal };
+        const premiseFormulas = premises
+            .map((p) => theory.axioms.get(p) || theory.theorems.get(p))
+            .filter((f) => f !== undefined);
+        const tt = this.generateBelnapTable({
+            kind: 'implies',
+            args: [this.conjoin(premiseFormulas), goal],
+        });
+        const designated = new Set(['T', 'B']);
+        const isProvable = tt.rows.every((r) => designated.has(String(r.result)));
+        return {
+            status: isProvable ? 'provable' : 'refutable',
+            output: isProvable ? `Derivacion exitosa en Belnap` : `No se puede derivar en Belnap`,
+            diagnostics: [],
+            formula: goal,
+        };
     }
     countermodel(formula) {
-        return { status: 'unknown', output: '[paraconsistent.belnap] No implementado', diagnostics: [{ severity: 'warning', message: 'Motor no implementado' }], formula };
+        const tt = this.generateBelnapTable(formula);
+        const designated = new Set(['T', 'B']);
+        const cm = tt.rows.find((r) => !designated.has(String(r.result)));
+        if (cm) {
+            return {
+                status: 'invalid',
+                output: `Contramodelo encontrado en Belnap`,
+                model: { type: 'propositional', valuation: cm.valuation },
+                diagnostics: [],
+                formula,
+            };
+        }
+        return {
+            status: 'valid',
+            output: `No hay contramodelo en Belnap (tautologia)`,
+            diagnostics: [],
+            formula,
+        };
     }
     explain(formula) {
-        return { status: 'unknown', output: '[paraconsistent.belnap] No implementado', diagnostics: [{ severity: 'warning', message: 'Motor no implementado' }], formula };
+        return {
+            status: 'unknown',
+            output: `Logica de Belnap (4-valores): ${(0, propositional_1.formulaToString)(formula)}`,
+            diagnostics: [],
+            formula,
+        };
+    }
+    conjoin(formulas) {
+        if (formulas.length === 0)
+            return { kind: 'atom', name: 'T' }; // Top
+        if (formulas.length === 1)
+            return formulas[0];
+        return { kind: 'and', args: [formulas[0], this.conjoin(formulas.slice(1))] };
+    }
+    evaluateBelnap(f, v) {
+        const args = f.args || [];
+        switch (f.kind) {
+            case 'atom':
+                return f.name ? (v[f.name] ?? 'N') : 'N';
+            case 'not':
+                return args[0] ? BELNAP_NOT[this.evaluateBelnap(args[0], v)] : 'N';
+            case 'and':
+                return args[0] && args[1]
+                    ? BELNAP_AND[this.evaluateBelnap(args[0], v)][this.evaluateBelnap(args[1], v)]
+                    : 'N';
+            case 'or':
+                return args[0] && args[1]
+                    ? BELNAP_OR[this.evaluateBelnap(args[0], v)][this.evaluateBelnap(args[1], v)]
+                    : 'N';
+            case 'implies':
+                // Implicación en Belnap (A -> B es !A | B)
+                return args[0] && args[1]
+                    ? BELNAP_OR[BELNAP_NOT[this.evaluateBelnap(args[0], v)]][this.evaluateBelnap(args[1], v)]
+                    : 'N';
+            default:
+                return 'N';
+        }
+    }
+    generateBelnapTable(formula) {
+        const atoms = Array.from(this.collectAtoms(formula)).sort();
+        const rows = this.generateBelnapValuations(atoms).map((v) => ({
+            valuation: v,
+            result: this.evaluateBelnap(formula, v),
+        }));
+        return {
+            variables: atoms,
+            rows,
+            isTautology: rows.every((r) => new Set(['T', 'B']).has(String(r.result))),
+            isSatisfiable: rows.some((r) => new Set(['T', 'B']).has(String(r.result))),
+            isContradiction: rows.every((r) => !new Set(['T', 'B']).has(String(r.result))),
+        };
+    }
+    collectAtoms(f) {
+        const atoms = new Set();
+        const walk = (node) => {
+            if (node.kind === 'atom' && node.name)
+                atoms.add(node.name);
+            if (node.args)
+                node.args.forEach(walk);
+        };
+        walk(f);
+        return atoms;
+    }
+    generateBelnapValuations(atoms) {
+        if (atoms.length === 0)
+            return [{}];
+        const sub = this.generateBelnapValuations(atoms.slice(1));
+        const result = [];
+        for (const v of sub) {
+            for (const val of VALUES) {
+                result.push({ ...v, [atoms[0]]: val });
+            }
+        }
+        return result;
     }
 }
 exports.ParaconsistentBelnap = ParaconsistentBelnap;