@stevenvo780/st-lang 4.2.0 → 4.4.0

package/dist/runtime/bayesian/factor.js

@@ -0,0 +1,249 @@
+"use strict";
+// ============================================================
+// Bayesian Inference — Factor representation
+// ============================================================
+//
+// Un Factor representa una función φ(X₁,…,Xₙ) → ℝ⁺ sobre un
+// conjunto de variables discretas. Las CPTs se convierten a
+// factores; los algoritmos de variable elimination producen
+// y consumen factores con tres operaciones: restricción por
+// evidencia, producto, y suma-marginalización.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.assignmentKey = assignmentKey;
+exports.parseParentKey = parseParentKey;
+exports.buildParentKey = buildParentKey;
+exports.iterateAssignments = iterateAssignments;
+exports.factorFromCPT = factorFromCPT;
+exports.restrictFactor = restrictFactor;
+exports.parseAssignmentKey = parseAssignmentKey;
+exports.multiplyFactors = multiplyFactors;
+exports.sumOut = sumOut;
+exports.maxOut = maxOut;
+exports.normalizeFactor = normalizeFactor;
+exports.variableDomainsOf = variableDomainsOf;
+// ── Helpers de claves ─────────────────────────────────────────
+function assignmentKey(variables, assignment) {
+    // Asume `variables` ya está ordenado consistentemente.
+    const parts = [];
+    for (const v of variables) {
+        parts.push(`${v}=${assignment[v]}`);
+    }
+    return parts.join('|');
+}
+function parseParentKey(parents, key) {
+    const out = {};
+    if (parents.length === 0)
+        return out;
+    const parts = key.split('|');
+    for (const part of parts) {
+        const eq = part.indexOf('=');
+        if (eq < 0)
+            continue;
+        const k = part.slice(0, eq);
+        const v = part.slice(eq + 1);
+        out[k] = v;
+    }
+    return out;
+}
+// Construye la clave canónica de padres en el orden declarado por el CPT.
+function buildParentKey(parents, assignment) {
+    if (parents.length === 0)
+        return '';
+    const parts = [];
+    for (const p of parents) {
+        parts.push(`${p}=${assignment[p]}`);
+    }
+    return parts.join('|');
+}
+// ── Iteración cartesiana sobre dominios ──────────────────────
+function* iterateAssignments(variables, domains) {
+    if (variables.length === 0) {
+        yield {};
+        return;
+    }
+    const sizes = variables.map((v) => domains[v]?.length ?? 0);
+    if (sizes.some((s) => s === 0))
+        return;
+    const idx = variables.map(() => 0);
+    while (true) {
+        const a = {};
+        for (let i = 0; i < variables.length; i++) {
+            const v = variables[i];
+            const dom = domains[v];
+            a[v] = dom[idx[i]];
+        }
+        yield a;
+        // incrementar como contador
+        let k = variables.length - 1;
+        while (k >= 0) {
+            idx[k] = (idx[k] ?? 0) + 1;
+            if (idx[k] < sizes[k])
+                break;
+            idx[k] = 0;
+            k--;
+        }
+        if (k < 0)
+            break;
+    }
+}
+// ── Construcción de factor desde CPT ─────────────────────────
+function factorFromCPT(cpt, variableDomains) {
+    const factorVars = [cpt.variable, ...cpt.parents].slice().sort();
+    const domains = {};
+    for (const v of factorVars) {
+        const dom = variableDomains[v];
+        if (!dom)
+            throw new Error(`Variable "${v}" sin dominio definido`);
+        domains[v] = dom;
+    }
+    const values = new Map();
+    for (const assign of iterateAssignments(factorVars, domains)) {
+        const parentKey = buildParentKey(cpt.parents, assign);
+        const row = cpt.entries[parentKey];
+        if (!row) {
+            // Fila ausente: probabilidad 0 (red mal definida — pero no fallamos aquí).
+            values.set(assignmentKey(factorVars, assign), 0);
+            continue;
+        }
+        const p = row[assign[cpt.variable]];
+        values.set(assignmentKey(factorVars, assign), p ?? 0);
+    }
+    return { variables: factorVars, domains, values };
+}
+// ── Restricción por evidencia ────────────────────────────────
+function restrictFactor(factor, evidence) {
+    const evVars = factor.variables.filter((v) => v in evidence);
+    if (evVars.length === 0)
+        return factor;
+    const newVars = factor.variables.filter((v) => !(v in evidence));
+    const newDomains = {};
+    for (const v of newVars)
+        newDomains[v] = factor.domains[v];
+    const values = new Map();
+    for (const [key, val] of factor.values) {
+        const assign = parseAssignmentKey(key);
+        let consistent = true;
+        for (const ev of evVars) {
+            if (assign[ev] !== evidence[ev]) {
+                consistent = false;
+                break;
+            }
+        }
+        if (!consistent)
+            continue;
+        const projected = {};
+        for (const v of newVars)
+            projected[v] = assign[v];
+        values.set(assignmentKey(newVars, projected), val);
+    }
+    return { variables: newVars, domains: newDomains, values };
+}
+function parseAssignmentKey(key) {
+    if (key === '')
+        return {};
+    const out = {};
+    for (const part of key.split('|')) {
+        const eq = part.indexOf('=');
+        if (eq < 0)
+            continue;
+        out[part.slice(0, eq)] = part.slice(eq + 1);
+    }
+    return out;
+}
+// ── Producto de factores ─────────────────────────────────────
+function multiplyFactors(a, b) {
+    const varSet = new Set([...a.variables, ...b.variables]);
+    const newVars = Array.from(varSet).sort();
+    const domains = {};
+    for (const v of newVars) {
+        domains[v] = a.domains[v] ?? b.domains[v];
+    }
+    const values = new Map();
+    for (const assign of iterateAssignments(newVars, domains)) {
+        const aKey = assignmentKey(a.variables, projectAssignment(assign, a.variables));
+        const bKey = assignmentKey(b.variables, projectAssignment(assign, b.variables));
+        const va = a.values.get(aKey) ?? 0;
+        const vb = b.values.get(bKey) ?? 0;
+        values.set(assignmentKey(newVars, assign), va * vb);
+    }
+    return { variables: newVars, domains, values };
+}
+function projectAssignment(assign, vars) {
+    const out = {};
+    for (const v of vars)
+        out[v] = assign[v];
+    return out;
+}
+// ── Suma-marginalización ─────────────────────────────────────
+function sumOut(factor, variable) {
+    if (!factor.variables.includes(variable))
+        return factor;
+    const newVars = factor.variables.filter((v) => v !== variable);
+    const newDomains = {};
+    for (const v of newVars)
+        newDomains[v] = factor.domains[v];
+    const values = new Map();
+    for (const [key, val] of factor.values) {
+        const assign = parseAssignmentKey(key);
+        const projected = {};
+        for (const v of newVars)
+            projected[v] = assign[v];
+        const pKey = assignmentKey(newVars, projected);
+        values.set(pKey, (values.get(pKey) ?? 0) + val);
+    }
+    return { variables: newVars, domains: newDomains, values };
+}
+// ── Max-marginalización (para MPE) ───────────────────────────
+//
+// Devuelve dos factores: el factor max-marginalizado y un mapa
+// backpointer key→valor(varEliminada) usado para reconstruir el
+// argmax.
+function maxOut(factor, variable) {
+    if (!factor.variables.includes(variable)) {
+        return { factor, backpointer: new Map() };
+    }
+    const newVars = factor.variables.filter((v) => v !== variable);
+    const newDomains = {};
+    for (const v of newVars)
+        newDomains[v] = factor.domains[v];
+    const values = new Map();
+    const backpointer = new Map();
+    for (const [key, val] of factor.values) {
+        const assign = parseAssignmentKey(key);
+        const projected = {};
+        for (const v of newVars)
+            projected[v] = assign[v];
+        const pKey = assignmentKey(newVars, projected);
+        const prev = values.get(pKey);
+        if (prev === undefined || val > prev) {
+            values.set(pKey, val);
+            backpointer.set(`${pKey}::${variable}`, assign[variable]);
+        }
+    }
+    return {
+        factor: { variables: newVars, domains: newDomains, values },
+        backpointer,
+    };
+}
+// ── Normalización ────────────────────────────────────────────
+function normalizeFactor(factor) {
+    let total = 0;
+    for (const v of factor.values.values())
+        total += v;
+    if (total === 0) {
+        // Evidencia inconsistente: devolver factor uniforme nulo.
+        return factor;
+    }
+    const values = new Map();
+    for (const [k, v] of factor.values)
+        values.set(k, v / total);
+    return { variables: factor.variables, domains: factor.domains, values };
+}
+// ── Utilidades de red ────────────────────────────────────────
+function variableDomainsOf(net) {
+    const out = {};
+    for (const v of net.variables)
+        out[v.name] = v.values;
+    return out;
+}
+//# sourceMappingURL=factor.js.map

package/dist/runtime/bayesian/factor.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"factor.js","sourceRoot":"","sources":["../../../src/runtime/bayesian/factor.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,6CAA6C;AAC7C,+DAA+D;AAC/D,EAAE;AACF,4DAA4D;AAC5D,4DAA4D;AAC5D,4DAA4D;AAC5D,4DAA4D;AAC5D,+CAA+C;;AAc/C,sCAOC;AAED,wCAYC;AAGD,wCAOC;AAID,gDA6BC;AAID,sCAqBC;AAID,wCAsBC;AAED,gDASC;AAID,0CAgBC;AAUD,wBAcC;AAQD,wBA2BC;AAID,0CAUC;AAID,8CAIC;AArOD,iEAAiE;AAEjE,SAAgB,aAAa,CAAC,SAAmB,EAAE,UAAkC;IACnF,uDAAuD;IACvD,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;QAC1B,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACtC,CAAC;IACD,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACzB,CAAC;AAED,SAAgB,cAAc,CAAC,OAAiB,EAAE,GAAW;IAC3D,MAAM,GAAG,GAA2B,EAAE,CAAC;IACvC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC;IACrC,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAC7B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAC7B,IAAI,EAAE,GAAG,CAAC;YAAE,SAAS;QACrB,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC5B,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;QAC7B,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACb,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,0EAA0E;AAC1E,SAAgB,cAAc,CAAC,OAAiB,EAAE,UAAkC;IAClF,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IACpC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACtC,CAAC;IACD,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACzB,CAAC;AAED,gEAAgE;AAEhE,QAAe,CAAC,CAAC,kBAAkB,CACjC,SAAmB,EACnB,OAAiC;IAEjC,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC3B,MAAM,EAAE,CAAC;QACT,OAAO;IACT,CAAC;IACD,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,MAAM,IAAI,CAAC,CAAC,CAAC;IAC5D,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;QAAE,OAAO;IACvC,MAAM,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IACnC,OAAO,IAAI,EAAE,CAAC;QACZ,MAAM,CAAC,GAA2B,EAAE,CAAC;QACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,MAAM,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;YACvB,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YACvB,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC;QACtB,CAAC;QACD,MAAM,CAAC,CAAC;QACR,4BAA4B;QAC5B,IAAI,CAAC,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;QAC7B,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YACd,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YAC3B,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;gBAAE,MAAM;YAC7B,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACX,CAAC,EAAE,CAAC;QACN,CAAC;QACD,IAAI,CAAC,GAAG,CAAC;YAAE,MAAM;IACnB,CAAC;AACH,CAAC;AAED,gEAAgE;AAEhE,SAAgB,aAAa,CAAC,GAAQ,EAAE,eAAyC;IAC/E,MAAM,UAAU,GAAG,CAAC,GAAG,CAAC,QAAQ,EAAE,GAAG,GAAG,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,CAAC;IACjE,MAAM,OAAO,GAA6B,EAAE,CAAC;IAC7C,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QAC3B,MAAM,GAAG,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;QAC/B,IAAI,CAAC,GAAG;YAAE,MAAM,IAAI,KAAK,CAAC,aAAa,CAAC,wBAAwB,CAAC,CAAC;QAClE,OAAO,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;IACnB,CAAC;IACD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,KAAK,MAAM,MAAM,IAAI,kBAAkB,CAAC,UAAU,EAAE,OAAO,CAAC,EAAE,CAAC;QAC7D,MAAM,SAAS,GAAG,cAAc,CAAC,GAAG,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;QACtD,MAAM,GAAG,GAAG,GAAG,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;QACnC,IAAI,CAAC,GAAG,EAAE,CAAC;YACT,2EAA2E;YAC3E,MAAM,CAAC,GAAG,CAAC,aAAa,CAAC,UAAU,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;YACjD,SAAS;QACX,CAAC;QACD,MAAM,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC;QACpC,MAAM,CAAC,GAAG,CAAC,aAAa,CAAC,UAAU,EAAE,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;IACxD,CAAC;IACD,OAAO,EAAE,SAAS,EAAE,UAAU,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC;AACpD,CAAC;AAED,gEAAgE;AAEhE,SAAgB,cAAc,CAAC,MAAc,EAAE,QAAkB;IAC/D,MAAM,MAAM,GAAG,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC;IAC7D,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,MAAM,CAAC;IACvC,MAAM,OAAO,GAAG,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC;IACjE,MAAM,UAAU,GAA6B,EAAE,CAAC;IAChD,KAAK,MAAM,CAAC,IAAI,OAAO;QAAE,UAAU,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC;IAC5D,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,KAAK,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;QACvC,MAAM,MAAM,GAAG,kBAAkB,CAAC,GAAG,CAAC,CAAC;QACvC,IAAI,UAAU,GAAG,IAAI,CAAC;QACtB,KAAK,MAAM,EAAE,IAAI,MAAM,EAAE,CAAC;YACxB,IAAI,MAAM,CAAC,EAAE,CAAC,KAAK,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC;gBAChC,UAAU,GAAG,KAAK,CAAC;gBACnB,MAAM;YACR,CAAC;QACH,CAAC;QACD,IAAI,CAAC,UAAU;YAAE,SAAS;QAC1B,MAAM,SAAS,GAA2B,EAAE,CAAC;QAC7C,KAAK,MAAM,CAAC,IAAI,OAAO;YAAE,SAAS,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAE,CAAC;QACnD,MAAM,CAAC,GAAG,CAAC,aAAa,CAAC,OAAO,EAAE,SAAS,CAAC,EAAE,GAAG,CAAC,CAAC;IACrD,CAAC;IACD,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE,CAAC;AAC7D,CAAC;AAED,SAAgB,kBAAkB,CAAC,GAAW;IAC5C,IAAI,GAAG,KAAK,EAAE;QAAE,OAAO,EAAE,CAAC;IAC1B,MAAM,GAAG,GAA2B,EAAE,CAAC;IACvC,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;QAClC,MAAM,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAC7B,IAAI,EAAE,GAAG,CAAC;YAAE,SAAS;QACrB,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;IAC9C,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,gEAAgE;AAEhE,SAAgB,eAAe,CAAC,CAAS,EAAE,CAAS;IAClD,MAAM,MAAM,GAAG,IAAI,GAAG,CAAS,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;IACjE,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC;IAC1C,MAAM,OAAO,GAA6B,EAAE,CAAC;IAC7C,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAC5C,CAAC;IACD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,KAAK,MAAM,MAAM,IAAI,kBAAkB,CAAC,OAAO,EAAE,OAAO,CAAC,EAAE,CAAC;QAC1D,MAAM,IAAI,GAAG,aAAa,CAAC,CAAC,CAAC,SAAS,EAAE,iBAAiB,CAAC,MAAM,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;QAChF,MAAM,IAAI,GAAG,aAAa,CAAC,CAAC,CAAC,SAAS,EAAE,iBAAiB,CAAC,MAAM,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;QAChF,MAAM,EAAE,GAAG,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,MAAM,EAAE,GAAG,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,MAAM,CAAC,GAAG,CAAC,aAAa,CAAC,OAAO,EAAE,MAAM,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC;IACtD,CAAC;IACD,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC;AACjD,CAAC;AAED,SAAS,iBAAiB,CAAC,MAA8B,EAAE,IAAc;IACvE,MAAM,GAAG,GAA2B,EAAE,CAAC;IACvC,KAAK,MAAM,CAAC,IAAI,IAAI;QAAE,GAAG,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAE,CAAC;IAC1C,OAAO,GAAG,CAAC;AACb,CAAC;AAED,gEAAgE;AAEhE,SAAgB,MAAM,CAAC,MAAc,EAAE,QAAgB;IACrD,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,QAAQ,CAAC;QAAE,OAAO,MAAM,CAAC;IACxD,MAAM,OAAO,GAAG,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,QAAQ,CAAC,CAAC;IAC/D,MAAM,UAAU,GAA6B,EAAE,CAAC;IAChD,KAAK,MAAM,CAAC,IAAI,OAAO;QAAE,UAAU,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC;IAC5D,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,KAAK,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;QACvC,MAAM,MAAM,GAAG,kBAAkB,CAAC,GAAG,CAAC,CAAC;QACvC,MAAM,SAAS,GAA2B,EAAE,CAAC;QAC7C,KAAK,MAAM,CAAC,IAAI,OAAO;YAAE,SAAS,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAE,CAAC;QACnD,MAAM,IAAI,GAAG,aAAa,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;QAC/C,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;IAClD,CAAC;IACD,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE,CAAC;AAC7D,CAAC;AAED,gEAAgE;AAChE,EAAE;AACF,+DAA+D;AAC/D,gEAAgE;AAChE,UAAU;AAEV,SAAgB,MAAM,CACpB,MAAc,EACd,QAAgB;IAEhB,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC;QACzC,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,IAAI,GAAG,EAAE,EAAE,CAAC;IAC5C,CAAC;IACD,MAAM,OAAO,GAAG,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,QAAQ,CAAC,CAAC;IAC/D,MAAM,UAAU,GAA6B,EAAE,CAAC;IAChD,KAAK,MAAM,CAAC,IAAI,OAAO;QAAE,UAAU,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC;IAC5D,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC9C,KAAK,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;QACvC,MAAM,MAAM,GAAG,kBAAkB,CAAC,GAAG,CAAC,CAAC;QACvC,MAAM,SAAS,GAA2B,EAAE,CAAC;QAC7C,KAAK,MAAM,CAAC,IAAI,OAAO;YAAE,SAAS,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAE,CAAC;QACnD,MAAM,IAAI,GAAG,aAAa,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;QAC/C,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC9B,IAAI,IAAI,KAAK,SAAS,IAAI,GAAG,GAAG,IAAI,EAAE,CAAC;YACrC,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YACtB,WAAW,CAAC,GAAG,CAAC,GAAG,IAAI,KAAK,QAAQ,EAAE,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;QAC5D,CAAC;IACH,CAAC;IACD,OAAO;QACL,MAAM,EAAE,EAAE,SAAS,EAAE,OAAO,EAAE,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE;QAC3D,WAAW;KACZ,CAAC;AACJ,CAAC;AAED,gEAAgE;AAEhE,SAAgB,eAAe,CAAC,MAAc;IAC5C,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE;QAAE,KAAK,IAAI,CAAC,CAAC;IACnD,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;QAChB,0DAA0D;QAC1D,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,MAAM;QAAE,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC;IAC7D,OAAO,EAAE,SAAS,EAAE,MAAM,CAAC,SAAS,EAAE,OAAO,EAAE,MAAM,CAAC,OAAO,EAAE,MAAM,EAAE,CAAC;AAC1E,CAAC;AAED,gEAAgE;AAEhE,SAAgB,iBAAiB,CAAC,GAAoB;IACpD,MAAM,GAAG,GAA6B,EAAE,CAAC;IACzC,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,SAAS;QAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IACtD,OAAO,GAAG,CAAC;AACb,CAAC"}

package/dist/runtime/bayesian/index.d.ts

@@ -0,0 +1,3 @@
+export { jointProbability, mostProbableExplanation, query, variableElimination } from './inference';
+export type { BayesianNetwork, CPT, DiscreteVariable, Evidence, PosteriorDistribution, } from './types';
+//# sourceMappingURL=index.d.ts.map

package/dist/runtime/bayesian/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/runtime/bayesian/index.ts"],"names":[],"mappings":"AAiBA,OAAO,EAAE,gBAAgB,EAAE,uBAAuB,EAAE,KAAK,EAAE,mBAAmB,EAAE,MAAM,aAAa,CAAC;AAEpG,YAAY,EACV,eAAe,EACf,GAAG,EACH,gBAAgB,EAChB,QAAQ,EACR,qBAAqB,GACtB,MAAM,SAAS,CAAC"}

package/dist/runtime/bayesian/index.js

@@ -0,0 +1,25 @@
+"use strict";
+// ============================================================
+// ST Bayesian Inference — Barrel
+// ============================================================
+//
+// Motor de inferencia bayesiana sobre redes discretas simples.
+// Variable elimination con orden min-fill, joint probability
+// y most probable explanation (MAP/MPE).
+//
+// API pública:
+//   - `query(net, queryVar, evidence?)`            → posterior P(Q | E)
+//   - `variableElimination(net, queryVar, ev?)`    → idem (alias explícito)
+//   - `jointProbability(net, assignment)`          → P(asignación completa)
+//   - `mostProbableExplanation(net, evidence?)`    → argmax P(· | E)
+//
+// Tipos: `BayesianNetwork`, `DiscreteVariable`, `CPT`, `Evidence`,
+// `PosteriorDistribution`.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.variableElimination = exports.query = exports.mostProbableExplanation = exports.jointProbability = void 0;
+var inference_1 = require("./inference");
+Object.defineProperty(exports, "jointProbability", { enumerable: true, get: function () { return inference_1.jointProbability; } });
+Object.defineProperty(exports, "mostProbableExplanation", { enumerable: true, get: function () { return inference_1.mostProbableExplanation; } });
+Object.defineProperty(exports, "query", { enumerable: true, get: function () { return inference_1.query; } });
+Object.defineProperty(exports, "variableElimination", { enumerable: true, get: function () { return inference_1.variableElimination; } });
+//# sourceMappingURL=index.js.map

package/dist/runtime/bayesian/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/runtime/bayesian/index.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,iCAAiC;AACjC,+DAA+D;AAC/D,EAAE;AACF,+DAA+D;AAC/D,6DAA6D;AAC7D,yCAAyC;AACzC,EAAE;AACF,eAAe;AACf,wEAAwE;AACxE,4EAA4E;AAC5E,4EAA4E;AAC5E,qEAAqE;AACrE,EAAE;AACF,mEAAmE;AACnE,2BAA2B;;;AAE3B,yCAAoG;AAA3F,6GAAA,gBAAgB,OAAA;AAAE,oHAAA,uBAAuB,OAAA;AAAE,kGAAA,KAAK,OAAA;AAAE,gHAAA,mBAAmB,OAAA"}

package/dist/runtime/bayesian/inference.d.ts

@@ -0,0 +1,6 @@
+import type { BayesianNetwork, Evidence, PosteriorDistribution } from './types';
+export declare function jointProbability(net: BayesianNetwork, assignment: Record<string, string>): number;
+export declare function variableElimination(net: BayesianNetwork, queryVar: string, evidence?: Evidence): PosteriorDistribution;
+export declare function query(net: BayesianNetwork, queryVar: string, evidence?: Evidence): PosteriorDistribution;
+export declare function mostProbableExplanation(net: BayesianNetwork, evidence?: Evidence): Record<string, string>;
+//# sourceMappingURL=inference.d.ts.map

package/dist/runtime/bayesian/inference.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"inference.d.ts","sourceRoot":"","sources":["../../../src/runtime/bayesian/inference.ts"],"names":[],"mappings":"AAsBA,OAAO,KAAK,EAAE,eAAe,EAAO,QAAQ,EAAE,qBAAqB,EAAE,MAAM,SAAS,CAAC;AA4BrF,wBAAgB,gBAAgB,CAAC,GAAG,EAAE,eAAe,EAAE,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,MAAM,CA4BjG;AAuDD,wBAAgB,mBAAmB,CACjC,GAAG,EAAE,eAAe,EACpB,QAAQ,EAAE,MAAM,EAChB,QAAQ,GAAE,QAAa,GACtB,qBAAqB,CAmDvB;AAID,wBAAgB,KAAK,CACnB,GAAG,EAAE,eAAe,EACpB,QAAQ,EAAE,MAAM,EAChB,QAAQ,GAAE,QAAa,GACtB,qBAAqB,CAEvB;AAQD,wBAAgB,uBAAuB,CACrC,GAAG,EAAE,eAAe,EACpB,QAAQ,GAAE,QAAa,GACtB,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAyExB"}

package/dist/runtime/bayesian/inference.js

@@ -0,0 +1,260 @@
+"use strict";
+// ============================================================
+// Bayesian Inference — Algorithms
+// ============================================================
+//
+// - jointProbability: producto P(Xᵢ | parents(Xᵢ)) sobre asignación completa.
+// - variableElimination: P(Q | E) marginalizando variables no-evidencia.
+// - query: alias semántico de variableElimination.
+// - mostProbableExplanation: MAP/MPE sobre variables no-evidencia.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.jointProbability = jointProbability;
+exports.variableElimination = variableElimination;
+exports.query = query;
+exports.mostProbableExplanation = mostProbableExplanation;
+const factor_1 = require("./factor");
+// ── Validación ───────────────────────────────────────────────
+function indexCPTs(net) {
+    const m = new Map();
+    for (const c of net.cpts)
+        m.set(c.variable, c);
+    return m;
+}
+function assertVariableExists(net, name) {
+    if (!net.variables.some((v) => v.name === name)) {
+        throw new Error(`Variable "${name}" no existe en la red`);
+    }
+}
+function assertEvidenceValid(net, evidence) {
+    for (const [k, v] of Object.entries(evidence)) {
+        const dvar = net.variables.find((x) => x.name === k);
+        if (!dvar)
+            throw new Error(`Evidencia "${k}" no existe en la red`);
+        if (!dvar.values.includes(v)) {
+            throw new Error(`Evidencia "${k}=${v}" fuera del dominio [${dvar.values.join(', ')}]`);
+        }
+    }
+}
+// ── jointProbability ─────────────────────────────────────────
+function jointProbability(net, assignment) {
+    // Toda variable de la red debe estar asignada y dentro del dominio.
+    for (const v of net.variables) {
+        const val = assignment[v.name];
+        if (val === undefined) {
+            throw new Error(`Asignación incompleta: falta "${v.name}"`);
+        }
+        if (!v.values.includes(val)) {
+            throw new Error(`Valor "${val}" fuera del dominio de "${v.name}" [${v.values.join(', ')}]`);
+        }
+    }
+    const cptIndex = indexCPTs(net);
+    let p = 1;
+    for (const v of net.variables) {
+        const cpt = cptIndex.get(v.name);
+        if (!cpt)
+            throw new Error(`Sin CPT para "${v.name}"`);
+        const parentKey = (0, factor_1.buildParentKey)(cpt.parents, assignment);
+        const row = cpt.entries[parentKey];
+        if (!row) {
+            throw new Error(`CPT incompleta: falta fila "${parentKey}" para "${v.name}"`);
+        }
+        const prob = row[assignment[v.name]];
+        if (prob === undefined) {
+            throw new Error(`CPT incompleta: sin entrada para "${v.name}=${assignment[v.name]}"`);
+        }
+        p *= prob;
+    }
+    return p;
+}
+// ── Heurística de orden de eliminación ───────────────────────
+//
+// Min-fill simple: eliminar primero la variable cuya remoción
+// agrega menos aristas al gráfico residual. Implementación O(n²)
+// — suficiente para redes pequeñas. Para redes triviales con
+// pocas variables el costo es despreciable.
+function eliminationOrder(toEliminate, factors) {
+    const remaining = new Set(toEliminate);
+    const order = [];
+    const factorsAlive = factors.slice();
+    while (remaining.size > 0) {
+        let best = null;
+        let bestCost = Infinity;
+        for (const v of remaining) {
+            const involved = factorsAlive.filter((f) => f.variables.includes(v));
+            const merged = new Set();
+            for (const f of involved)
+                for (const x of f.variables)
+                    merged.add(x);
+            merged.delete(v);
+            const cost = merged.size; // proxy del tamaño del cluster
+            if (cost < bestCost) {
+                bestCost = cost;
+                best = v;
+            }
+        }
+        if (best === null)
+            break;
+        order.push(best);
+        remaining.delete(best);
+        // simular eliminación: reemplazar factores involucrados por uno fusionado
+        const involved = factorsAlive.filter((f) => f.variables.includes(best));
+        const others = factorsAlive.filter((f) => !f.variables.includes(best));
+        const mergedVars = new Set();
+        const mergedDomains = {};
+        for (const f of involved) {
+            for (const v of f.variables) {
+                if (v === best)
+                    continue;
+                mergedVars.add(v);
+                mergedDomains[v] = f.domains[v];
+            }
+        }
+        const fakeFactor = {
+            variables: Array.from(mergedVars).sort(),
+            domains: mergedDomains,
+            values: new Map(),
+        };
+        factorsAlive.length = 0;
+        factorsAlive.push(...others, fakeFactor);
+    }
+    return order;
+}
+// ── variableElimination ──────────────────────────────────────
+function variableElimination(net, queryVar, evidence = {}) {
+    assertVariableExists(net, queryVar);
+    assertEvidenceValid(net, evidence);
+    if (queryVar in evidence) {
+        // Si la query está observada, el posterior es degenerado.
+        const qDomain = net.variables.find((v) => v.name === queryVar).values;
+        const dist = {};
+        const out = {};
+        for (const val of qDomain)
+            out[val] = val === evidence[queryVar] ? 1 : 0;
+        void dist;
+        return { variable: queryVar, distribution: out };
+    }
+    const domains = (0, factor_1.variableDomainsOf)(net);
+    // 1. Construir factores desde CPTs, restringidos por evidencia.
+    let factors = net.cpts.map((cpt) => {
+        const f = (0, factor_1.factorFromCPT)(cpt, domains);
+        return (0, factor_1.restrictFactor)(f, evidence);
+    });
+    // 2. Determinar variables a eliminar (todas menos query y evidencia).
+    const toEliminate = net.variables
+        .map((v) => v.name)
+        .filter((n) => n !== queryVar && !(n in evidence));
+    const order = eliminationOrder(toEliminate, factors);
+    // 3. Eliminar cada variable: multiplicar todos los factores que la contengan
+    //    y sumar-marginalizar.
+    for (const v of order) {
+        const involved = factors.filter((f) => f.variables.includes(v));
+        const others = factors.filter((f) => !f.variables.includes(v));
+        if (involved.length === 0)
+            continue;
+        let product = involved[0];
+        for (let i = 1; i < involved.length; i++) {
+            product = (0, factor_1.multiplyFactors)(product, involved[i]);
+        }
+        const reduced = (0, factor_1.sumOut)(product, v);
+        factors = [...others, reduced];
+    }
+    // 4. Multiplicar los factores restantes (todos sobre queryVar tras la elim).
+    let result = factors[0];
+    for (let i = 1; i < factors.length; i++) {
+        result = (0, factor_1.multiplyFactors)(result, factors[i]);
+    }
+    // 5. Normalizar.
+    const normalized = (0, factor_1.normalizeFactor)(result);
+    // 6. Extraer la distribución sobre la query.
+    const distribution = {};
+    const qDomain = net.variables.find((v) => v.name === queryVar).values;
+    for (const val of qDomain) {
+        const key = (0, factor_1.assignmentKey)([queryVar], { [queryVar]: val });
+        distribution[val] = normalized.values.get(key) ?? 0;
+    }
+    return { variable: queryVar, distribution };
+}
+// ── query (alias semántico) ──────────────────────────────────
+function query(net, queryVar, evidence = {}) {
+    return variableElimination(net, queryVar, evidence);
+}
+// ── Most Probable Explanation (MPE / MAP completo) ───────────
+//
+// Devuelve la asignación de máxima probabilidad sobre todas las
+// variables no observadas, dada la evidencia. Implementación:
+// max-product variable elimination con tracking de backpointers.
+function mostProbableExplanation(net, evidence = {}) {
+    assertEvidenceValid(net, evidence);
+    const domains = (0, factor_1.variableDomainsOf)(net);
+    let factors = net.cpts.map((cpt) => {
+        const f = (0, factor_1.factorFromCPT)(cpt, domains);
+        return (0, factor_1.restrictFactor)(f, evidence);
+    });
+    const toEliminate = net.variables.map((v) => v.name).filter((n) => !(n in evidence));
+    // Para reconstruir el argmax necesitamos eliminar en un orden
+    // determinístico y guardar, en cada paso, la mejor asignación
+    // de la variable eliminada como función de las restantes.
+    const order = eliminationOrder(toEliminate, factors);
+    const steps = [];
+    for (const v of order) {
+        const involved = factors.filter((f) => f.variables.includes(v));
+        const others = factors.filter((f) => !f.variables.includes(v));
+        if (involved.length === 0)
+            continue;
+        let product = involved[0];
+        for (let i = 1; i < involved.length; i++) {
+            product = (0, factor_1.multiplyFactors)(product, involved[i]);
+        }
+        const contextVars = product.variables.filter((x) => x !== v);
+        // Construir chooser: para cada asignación de contextVars,
+        // qué valor de v maximiza el producto.
+        const chooser = new Map();
+        const best = new Map();
+        for (const [key, val] of product.values) {
+            const assign = (0, factor_1.parseAssignmentKey)(key);
+            const ctx = {};
+            for (const c of contextVars)
+                ctx[c] = assign[c];
+            const ctxKey = (0, factor_1.assignmentKey)(contextVars, ctx);
+            const prev = best.get(ctxKey);
+            if (prev === undefined || val > prev) {
+                best.set(ctxKey, val);
+                chooser.set(ctxKey, assign[v]);
+            }
+        }
+        steps.push({ variable: v, contextVars, chooser });
+        const { factor: reduced } = (0, factor_1.maxOut)(product, v);
+        factors = [...others, reduced];
+    }
+    // Tras eliminar todas las variables no-evidencia, queda un
+    // factor escalar (sin variables). La asignación óptima se
+    // reconstruye recorriendo `steps` en orden inverso.
+    const assignment = { ...evidence };
+    for (let i = steps.length - 1; i >= 0; i--) {
+        const step = steps[i];
+        const ctx = {};
+        for (const c of step.contextVars) {
+            const val = assignment[c];
+            if (val === undefined) {
+                // No debería ocurrir si el orden es válido — defensa.
+                ctx[c] = '';
+            }
+            else {
+                ctx[c] = val;
+            }
+        }
+        const ctxKey = (0, factor_1.assignmentKey)(step.contextVars, ctx);
+        const chosen = step.chooser.get(ctxKey);
+        if (chosen !== undefined) {
+            assignment[step.variable] = chosen;
+        }
+        else {
+            // Fallback: primer valor del dominio. Solo posible con CPT degenerada.
+            const dom = domains[step.variable];
+            if (dom && dom.length > 0)
+                assignment[step.variable] = dom[0];
+        }
+    }
+    return assignment;
+}
+//# sourceMappingURL=inference.js.map

package/dist/runtime/bayesian/inference.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"inference.js","sourceRoot":"","sources":["../../../src/runtime/bayesian/inference.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,kCAAkC;AAClC,+DAA+D;AAC/D,EAAE;AACF,8EAA8E;AAC9E,yEAAyE;AACzE,mDAAmD;AACnD,mEAAmE;;AA2CnE,4CA4BC;AAuDD,kDAuDC;AAID,sBAMC;AAQD,0DA4EC;AAjRD,qCAYkB;AAGlB,gEAAgE;AAEhE,SAAS,SAAS,CAAC,GAAoB;IACrC,MAAM,CAAC,GAAG,IAAI,GAAG,EAAe,CAAC;IACjC,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,IAAI;QAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;IAC/C,OAAO,CAAC,CAAC;AACX,CAAC;AAED,SAAS,oBAAoB,CAAC,GAAoB,EAAE,IAAY;IAC9D,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC;QAChD,MAAM,IAAI,KAAK,CAAC,aAAa,IAAI,uBAAuB,CAAC,CAAC;IAC5D,CAAC;AACH,CAAC;AAED,SAAS,mBAAmB,CAAC,GAAoB,EAAE,QAAkB;IACnE,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;QAC9C,MAAM,IAAI,GAAG,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC;QACrD,IAAI,CAAC,IAAI;YAAE,MAAM,IAAI,KAAK,CAAC,cAAc,CAAC,uBAAuB,CAAC,CAAC;QACnE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;YAC7B,MAAM,IAAI,KAAK,CAAC,cAAc,CAAC,IAAI,CAAC,wBAAwB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACzF,CAAC;IACH,CAAC;AACH,CAAC;AAED,gEAAgE;AAEhE,SAAgB,gBAAgB,CAAC,GAAoB,EAAE,UAAkC;IACvF,oEAAoE;IACpE,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,SAAS,EAAE,CAAC;QAC9B,MAAM,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAC/B,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;YACtB,MAAM,IAAI,KAAK,CAAC,iCAAiC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC;QAC9D,CAAC;QACD,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;YAC5B,MAAM,IAAI,KAAK,CAAC,UAAU,GAAG,2BAA2B,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC9F,CAAC;IACH,CAAC;IACD,MAAM,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC;IAChC,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,SAAS,EAAE,CAAC;QAC9B,MAAM,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACjC,IAAI,CAAC,GAAG;YAAE,MAAM,IAAI,KAAK,CAAC,iBAAiB,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC;QACtD,MAAM,SAAS,GAAG,IAAA,uBAAc,EAAC,GAAG,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;QAC1D,MAAM,GAAG,GAAG,GAAG,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;QACnC,IAAI,CAAC,GAAG,EAAE,CAAC;YACT,MAAM,IAAI,KAAK,CAAC,+BAA+B,SAAS,WAAW,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC;QAChF,CAAC;QACD,MAAM,IAAI,GAAG,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QACrC,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,MAAM,IAAI,KAAK,CAAC,qCAAqC,CAAC,CAAC,IAAI,IAAI,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACxF,CAAC;QACD,CAAC,IAAI,IAAI,CAAC;IACZ,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED,gEAAgE;AAChE,EAAE;AACF,8DAA8D;AAC9D,iEAAiE;AACjE,6DAA6D;AAC7D,4CAA4C;AAE5C,SAAS,gBAAgB,CAAC,WAAqB,EAAE,OAAiB;IAChE,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,CAAC;IACvC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,YAAY,GAAG,OAAO,CAAC,KAAK,EAAE,CAAC;IACrC,OAAO,SAAS,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;QAC1B,IAAI,IAAI,GAAkB,IAAI,CAAC;QAC/B,IAAI,QAAQ,GAAG,QAAQ,CAAC;QACxB,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;YAC1B,MAAM,QAAQ,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;YACrE,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;YACjC,KAAK,MAAM,CAAC,IAAI,QAAQ;gBAAE,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,SAAS;oBAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACrE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACjB,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,+BAA+B;YACzD,IAAI,IAAI,GAAG,QAAQ,EAAE,CAAC;gBACpB,QAAQ,GAAG,IAAI,CAAC;gBAChB,IAAI,GAAG,CAAC,CAAC;YACX,CAAC;QACH,CAAC;QACD,IAAI,IAAI,KAAK,IAAI;YAAE,MAAM;QACzB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjB,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACvB,0EAA0E;QAC1E,MAAM,QAAQ,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;QACxE,MAAM,MAAM,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;QACvE,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;QACrC,MAAM,aAAa,GAA6B,EAAE,CAAC;QACnD,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YACzB,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,CAAC;gBAC5B,IAAI,CAAC,KAAK,IAAI;oBAAE,SAAS;gBACzB,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBAClB,aAAa,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC;YACnC,CAAC;QACH,CAAC;QACD,MAAM,UAAU,GAAW;YACzB,SAAS,EAAE,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,IAAI,EAAE;YACxC,OAAO,EAAE,aAAa;YACtB,MAAM,EAAE,IAAI,GAAG,EAAE;SAClB,CAAC;QACF,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC;QACxB,YAAY,CAAC,IAAI,CAAC,GAAG,MAAM,EAAE,UAAU,CAAC,CAAC;IAC3C,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,gEAAgE;AAEhE,SAAgB,mBAAmB,CACjC,GAAoB,EACpB,QAAgB,EAChB,WAAqB,EAAE;IAEvB,oBAAoB,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;IACpC,mBAAmB,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;IACnC,IAAI,QAAQ,IAAI,QAAQ,EAAE,CAAC;QACzB,0DAA0D;QAC1D,MAAM,OAAO,GAAG,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAE,CAAC,MAAM,CAAC;QACvE,MAAM,IAAI,GAAoD,EAAE,CAAC;QACjE,MAAM,GAAG,GAA2B,EAAE,CAAC;QACvC,KAAK,MAAM,GAAG,IAAI,OAAO;YAAE,GAAG,CAAC,GAAG,CAAC,GAAG,GAAG,KAAK,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACzE,KAAK,IAAI,CAAC;QACV,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,YAAY,EAAE,GAAG,EAAE,CAAC;IACnD,CAAC;IACD,MAAM,OAAO,GAAG,IAAA,0BAAiB,EAAC,GAAG,CAAC,CAAC;IACvC,gEAAgE;IAChE,IAAI,OAAO,GAAa,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE;QAC3C,MAAM,CAAC,GAAG,IAAA,sBAAa,EAAC,GAAG,EAAE,OAAO,CAAC,CAAC;QACtC,OAAO,IAAA,uBAAc,EAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IACH,sEAAsE;IACtE,MAAM,WAAW,GAAG,GAAG,CAAC,SAAS;SAC9B,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;SAClB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,QAAQ,IAAI,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC;IACrD,MAAM,KAAK,GAAG,gBAAgB,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC;IACrD,6EAA6E;IAC7E,2BAA2B;IAC3B,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,MAAM,QAAQ,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QAChE,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/D,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QACpC,IAAI,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,OAAO,GAAG,IAAA,wBAAe,EAAC,OAAO,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QAClD,CAAC;QACD,MAAM,OAAO,GAAG,IAAA,eAAM,EAAC,OAAO,EAAE,CAAC,CAAC,CAAC;QACnC,OAAO,GAAG,CAAC,GAAG,MAAM,EAAE,OAAO,CAAC,CAAC;IACjC,CAAC;IACD,6EAA6E;IAC7E,IAAI,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;IACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,MAAM,GAAG,IAAA,wBAAe,EAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/C,CAAC;IACD,iBAAiB;IACjB,MAAM,UAAU,GAAG,IAAA,wBAAe,EAAC,MAAM,CAAC,CAAC;IAC3C,6CAA6C;IAC7C,MAAM,YAAY,GAA2B,EAAE,CAAC;IAChD,MAAM,OAAO,GAAG,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAE,CAAC,MAAM,CAAC;IACvE,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;QAC1B,MAAM,GAAG,GAAG,IAAA,sBAAa,EAAC,CAAC,QAAQ,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;QAC3D,YAAY,CAAC,GAAG,CAAC,GAAG,UAAU,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACtD,CAAC;IACD,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,YAAY,EAAE,CAAC;AAC9C,CAAC;AAED,gEAAgE;AAEhE,SAAgB,KAAK,CACnB,GAAoB,EACpB,QAAgB,EAChB,WAAqB,EAAE;IAEvB,OAAO,mBAAmB,CAAC,GAAG,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;AACtD,CAAC;AAED,gEAAgE;AAChE,EAAE;AACF,gEAAgE;AAChE,8DAA8D;AAC9D,iEAAiE;AAEjE,SAAgB,uBAAuB,CACrC,GAAoB,EACpB,WAAqB,EAAE;IAEvB,mBAAmB,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;IACnC,MAAM,OAAO,GAAG,IAAA,0BAAiB,EAAC,GAAG,CAAC,CAAC;IACvC,IAAI,OAAO,GAAa,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE;QAC3C,MAAM,CAAC,GAAG,IAAA,sBAAa,EAAC,GAAG,EAAE,OAAO,CAAC,CAAC;QACtC,OAAO,IAAA,uBAAc,EAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IACH,MAAM,WAAW,GAAG,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC;IACrF,8DAA8D;IAC9D,8DAA8D;IAC9D,0DAA0D;IAC1D,MAAM,KAAK,GAAG,gBAAgB,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC;IAMrD,MAAM,KAAK,GAAW,EAAE,CAAC;IACzB,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,MAAM,QAAQ,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QAChE,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/D,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QACpC,IAAI,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,OAAO,GAAG,IAAA,wBAAe,EAAC,OAAO,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QAClD,CAAC;QACD,MAAM,WAAW,GAAG,OAAO,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QAC7D,0DAA0D;QAC1D,uCAAuC;QACvC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC1C,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC;QACvC,KAAK,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;YACxC,MAAM,MAAM,GAAG,IAAA,2BAAkB,EAAC,GAAG,CAAC,CAAC;YACvC,MAAM,GAAG,GAA2B,EAAE,CAAC;YACvC,KAAK,MAAM,CAAC,IAAI,WAAW;gBAAE,GAAG,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAE,CAAC;YACjD,MAAM,MAAM,GAAG,IAAA,sBAAa,EAAC,WAAW,EAAE,GAAG,CAAC,CAAC;YAC/C,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAC9B,IAAI,IAAI,KAAK,SAAS,IAAI,GAAG,GAAG,IAAI,EAAE,CAAC;gBACrC,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;gBACtB,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YACjC,CAAC;QACH,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,WAAW,EAAE,OAAO,EAAE,CAAC,CAAC;QAClD,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,GAAG,IAAA,eAAM,EAAC,OAAO,EAAE,CAAC,CAAC,CAAC;QAC/C,OAAO,GAAG,CAAC,GAAG,MAAM,EAAE,OAAO,CAAC,CAAC;IACjC,CAAC;IACD,2DAA2D;IAC3D,0DAA0D;IAC1D,oDAAoD;IACpD,MAAM,UAAU,GAA2B,EAAE,GAAG,QAAQ,EAAE,CAAC;IAC3D,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3C,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACtB,MAAM,GAAG,GAA2B,EAAE,CAAC;QACvC,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YACjC,MAAM,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;YAC1B,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;gBACtB,sDAAsD;gBACtD,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;YACd,CAAC;iBAAM,CAAC;gBACN,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;YACf,CAAC;QACH,CAAC;QACD,MAAM,MAAM,GAAG,IAAA,sBAAa,EAAC,IAAI,CAAC,WAAW,EAAE,GAAG,CAAC,CAAC;QACpD,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACxC,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,MAAM,CAAC;QACrC,CAAC;aAAM,CAAC;YACN,uEAAuE;YACvE,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACnC,IAAI,GAAG,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC;gBAAE,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,GAAG,CAAC,CAAC,CAAE,CAAC;QACjE,CAAC;IACH,CAAC;IACD,OAAO,UAAU,CAAC;AACpB,CAAC"}

package/dist/runtime/bayesian/types.d.ts

@@ -0,0 +1,19 @@
+export interface DiscreteVariable {
+    name: string;
+    values: string[];
+}
+export interface CPT {
+    variable: string;
+    parents: string[];
+    entries: Record<string, Record<string, number>>;
+}
+export interface BayesianNetwork {
+    variables: DiscreteVariable[];
+    cpts: CPT[];
+}
+export type Evidence = Record<string, string>;
+export interface PosteriorDistribution {
+    variable: string;
+    distribution: Record<string, number>;
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/runtime/bayesian/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../src/runtime/bayesian/types.ts"],"names":[],"mappings":"AAOA,MAAM,WAAW,gBAAgB;IAC/B,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB;AAED,MAAM,WAAW,GAAG;IAClB,QAAQ,EAAE,MAAM,CAAC;IACjB,OAAO,EAAE,MAAM,EAAE,CAAC;IAGlB,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;CACjD;AAED,MAAM,WAAW,eAAe;IAC9B,SAAS,EAAE,gBAAgB,EAAE,CAAC;IAC9B,IAAI,EAAE,GAAG,EAAE,CAAC;CACb;AAED,MAAM,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;AAE9C,MAAM,WAAW,qBAAqB;IACpC,QAAQ,EAAE,MAAM,CAAC;IACjB,YAAY,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CACtC"}

package/dist/runtime/bayesian/types.js

@@ -0,0 +1,9 @@
+"use strict";
+// ============================================================
+// Bayesian Inference — Types
+// ============================================================
+//
+// Tipos para representar redes bayesianas discretas y consultas
+// de inferencia probabilística.
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=types.js.map

package/dist/runtime/bayesian/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../src/runtime/bayesian/types.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,6BAA6B;AAC7B,+DAA+D;AAC/D,EAAE;AACF,gEAAgE;AAChE,gCAAgC"}

package/dist/runtime/bisimulation/index.d.ts

@@ -0,0 +1,4 @@
+export type { LTS, BisimulationResult } from './types';
+export { paigeTarjan } from './paige-tarjan';
+export { areBisimilar, quotientLTS, strongBisimulation, weakBisimulation } from './operations';
+//# sourceMappingURL=index.d.ts.map

package/dist/runtime/bisimulation/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/runtime/bisimulation/index.ts"],"names":[],"mappings":"AAWA,YAAY,EAAE,GAAG,EAAE,kBAAkB,EAAE,MAAM,SAAS,CAAC;AACvD,OAAO,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAC7C,OAAO,EAAE,YAAY,EAAE,WAAW,EAAE,kBAAkB,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAC"}