@stevenvo780/st-lang 4.2.0 → 4.3.0

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

@@ -0,0 +1,78 @@
+/** Una fórmula (formato libre — strings, opaque al motor). */
+export type Formula = string;
+/**
+ * Oráculo de consecuencia lógica: dado un conjunto de premisas P y
+ * una fórmula objetivo q, devuelve `true` sii P ⊨ q.
+ *
+ * El motor abductivo es agnóstico al sistema lógico. Quien usa la
+ * librería provee este oráculo (puede ser propositional, FOL,
+ * description logic, etc).
+ */
+export type EntailmentOracle = (premises: ReadonlyArray<Formula>, target: Formula) => boolean;
+/**
+ * Oráculo de consistencia: dado un conjunto de fórmulas, devuelve
+ * `true` sii admite al menos un modelo. Default razonable: si no
+ * lo dan, decimos consistente sii NO P ⊨ ⊥. Como no tenemos ⊥
+ * estándar en strings, en la práctica conviene pasar este oráculo.
+ */
+export type ConsistencyOracle = (premises: ReadonlyArray<Formula>) => boolean;
+/**
+ * Problema abductivo.
+ *
+ * - `kb`: background knowledge (axiomas del dominio).
+ * - `observation`: fórmula que queremos explicar.
+ * - `abducibles`: el conjunto de fórmulas elegibles como hipótesis.
+ *   El razonador buscará H ⊆ abducibles.
+ */
+export interface AbductionProblem {
+    kb: ReadonlyArray<Formula>;
+    observation: Formula;
+    abducibles: ReadonlyArray<Formula>;
+}
+/**
+ * Una explicación candidata.
+ *
+ * - `hypotheses`: subconjunto de abducibles.
+ * - `size`: cardinalidad (= hypotheses.length).
+ * - `parsimonious`: true sii no existe subconjunto propio que
+ *   también explique la observación de forma consistente.
+ *   (Equivale a "minimal por inclusión".)
+ * - `costScore`: suma de costos si se proveyó costFunction.
+ */
+export interface Explanation {
+    hypotheses: ReadonlyArray<Formula>;
+    size: number;
+    parsimonious: boolean;
+    costScore?: number;
+}
+/**
+ * Criterio de preferencia sobre el conjunto de explicaciones.
+ *
+ * - `all`: todas las explicaciones encontradas (no filtra).
+ * - `minimal`: solo las minimal-por-inclusión (parsimonious).
+ * - `minimum-cardinality`: las de menor |H| entre las minimales.
+ * - `minimum-cost`: las de menor costo total (requiere costFunction).
+ */
+export type Preference = 'all' | 'minimal' | 'minimum-cardinality' | 'minimum-cost';
+export interface AbductionOptions {
+    /** Oráculo de entailment. Default: `defaultEntails` (propositional, ver entails.ts). */
+    entails?: EntailmentOracle;
+    /** Oráculo de consistencia. Default: derivado de `entails` (no entails ⊥-equiv). */
+    consistent?: ConsistencyOracle;
+    /**
+     * Tope de explicaciones a retornar. Útil cuando hay explosión
+     * combinatoria. Default: 1024.
+     */
+    maxHypotheses?: number;
+    /**
+     * Tope para |H|. Acota el espacio de búsqueda. Default: igual a
+     * |abducibles| (sin tope efectivo). Bajarlo es una buena idea
+     * para |abducibles| > 12.
+     */
+    maxSize?: number;
+    /** Función de costo por hipótesis. Default: 1 por hipótesis. */
+    costFunction?: (h: Formula) => number;
+    /** Cómo filtrar/ordenar el output. Default: `minimal`. */
+    preferred?: Preference;
+}
+//# sourceMappingURL=types.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../src/runtime/abduction/types.ts"],"names":[],"mappings":"AAqBA,8DAA8D;AAC9D,MAAM,MAAM,OAAO,GAAG,MAAM,CAAC;AAE7B;;;;;;;GAOG;AACH,MAAM,MAAM,gBAAgB,GAAG,CAAC,QAAQ,EAAE,aAAa,CAAC,OAAO,CAAC,EAAE,MAAM,EAAE,OAAO,KAAK,OAAO,CAAC;AAE9F;;;;;GAKG;AACH,MAAM,MAAM,iBAAiB,GAAG,CAAC,QAAQ,EAAE,aAAa,CAAC,OAAO,CAAC,KAAK,OAAO,CAAC;AAE9E;;;;;;;GAOG;AACH,MAAM,WAAW,gBAAgB;IAC/B,EAAE,EAAE,aAAa,CAAC,OAAO,CAAC,CAAC;IAC3B,WAAW,EAAE,OAAO,CAAC;IACrB,UAAU,EAAE,aAAa,CAAC,OAAO,CAAC,CAAC;CACpC;AAED;;;;;;;;;GASG;AACH,MAAM,WAAW,WAAW;IAC1B,UAAU,EAAE,aAAa,CAAC,OAAO,CAAC,CAAC;IACnC,IAAI,EAAE,MAAM,CAAC;IACb,YAAY,EAAE,OAAO,CAAC;IACtB,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAED;;;;;;;GAOG;AACH,MAAM,MAAM,UAAU,GAAG,KAAK,GAAG,SAAS,GAAG,qBAAqB,GAAG,cAAc,CAAC;AAEpF,MAAM,WAAW,gBAAgB;IAC/B,wFAAwF;IACxF,OAAO,CAAC,EAAE,gBAAgB,CAAC;IAC3B,oFAAoF;IACpF,UAAU,CAAC,EAAE,iBAAiB,CAAC;IAC/B;;;OAGG;IACH,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB;;;;OAIG;IACH,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,gEAAgE;IAChE,YAAY,CAAC,EAAE,CAAC,CAAC,EAAE,OAAO,KAAK,MAAM,CAAC;IACtC,0DAA0D;IAC1D,SAAS,CAAC,EAAE,UAAU,CAAC;CACxB"}

package/dist/runtime/abduction/types.js

@@ -0,0 +1,23 @@
+"use strict";
+// ============================================================
+// ST Abduction — Tipos públicos
+// ============================================================
+//
+// Razonamiento abductivo (Peirce 1903; Reiter 1987): dado un
+// background knowledge KB y una observación O, encontrar
+// hipótesis H ⊆ Abducibles tal que:
+//
+//   1. KB ∪ H ⊨ O       (la hipótesis explica la observación)
+//   2. KB ∪ H consistent (la hipótesis es compatible con KB)
+//   3. H es minimal (no hay H' ⊂ H que cumpla 1 y 2)
+//
+// Usos típicos:
+//   - Diagnóstico (¿qué fallas explican estos síntomas?)
+//   - Inferencia best-fit (la hipótesis más simple/barata gana)
+//   - Generación de explicaciones (debugging de cadenas causales)
+//
+// El espacio de hipótesis se enumera sobre 2^|abducibles|. Para
+// |abducibles| ≲ 16 la enumeración exhaustiva es viable. Para más
+// grande, conviene un oráculo SAT incremental.
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=types.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../src/runtime/abduction/types.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,gCAAgC;AAChC,+DAA+D;AAC/D,EAAE;AACF,6DAA6D;AAC7D,yDAAyD;AACzD,oCAAoC;AACpC,EAAE;AACF,8DAA8D;AAC9D,6DAA6D;AAC7D,qDAAqD;AACrD,EAAE;AACF,gBAAgB;AAChB,yDAAyD;AACzD,gEAAgE;AAChE,kEAAkE;AAClE,EAAE;AACF,gEAAgE;AAChE,kEAAkE;AAClE,+CAA+C"}

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

@@ -0,0 +1,22 @@
+import type { BayesianNetwork, CPT, Evidence } from './types';
+export interface Factor {
+    variables: string[];
+    domains: Record<string, string[]>;
+    values: Map<string, number>;
+}
+export declare function assignmentKey(variables: string[], assignment: Record<string, string>): string;
+export declare function parseParentKey(parents: string[], key: string): Record<string, string>;
+export declare function buildParentKey(parents: string[], assignment: Record<string, string>): string;
+export declare function iterateAssignments(variables: string[], domains: Record<string, string[]>): Generator<Record<string, string>>;
+export declare function factorFromCPT(cpt: CPT, variableDomains: Record<string, string[]>): Factor;
+export declare function restrictFactor(factor: Factor, evidence: Evidence): Factor;
+export declare function parseAssignmentKey(key: string): Record<string, string>;
+export declare function multiplyFactors(a: Factor, b: Factor): Factor;
+export declare function sumOut(factor: Factor, variable: string): Factor;
+export declare function maxOut(factor: Factor, variable: string): {
+    factor: Factor;
+    backpointer: Map<string, string>;
+};
+export declare function normalizeFactor(factor: Factor): Factor;
+export declare function variableDomainsOf(net: BayesianNetwork): Record<string, string[]>;
+//# sourceMappingURL=factor.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"factor.d.ts","sourceRoot":"","sources":["../../../src/runtime/bayesian/factor.ts"],"names":[],"mappings":"AAUA,OAAO,KAAK,EAAE,eAAe,EAAE,GAAG,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAE9D,MAAM,WAAW,MAAM;IACrB,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;IAGlC,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CAC7B;AAID,wBAAgB,aAAa,CAAC,SAAS,EAAE,MAAM,EAAE,EAAE,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,MAAM,CAO7F;AAED,wBAAgB,cAAc,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAYrF;AAGD,wBAAgB,cAAc,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,MAAM,CAO5F;AAID,wBAAiB,kBAAkB,CACjC,SAAS,EAAE,MAAM,EAAE,EACnB,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,GAChC,SAAS,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CA0BnC;AAID,wBAAgB,aAAa,CAAC,GAAG,EAAE,GAAG,EAAE,eAAe,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,GAAG,MAAM,CAqBzF;AAID,wBAAgB,cAAc,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,GAAG,MAAM,CAsBzE;AAED,wBAAgB,kBAAkB,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAStE;AAID,wBAAgB,eAAe,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAgB5D;AAUD,wBAAgB,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,MAAM,CAc/D;AAQD,wBAAgB,MAAM,CACpB,MAAM,EAAE,MAAM,EACd,QAAQ,EAAE,MAAM,GACf;IAAE,MAAM,EAAE,MAAM,CAAC;IAAC,WAAW,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;CAAE,CAwBtD;AAID,wBAAgB,eAAe,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAUtD;AAID,wBAAgB,iBAAiB,CAAC,GAAG,EAAE,eAAe,GAAG,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAIhF"}

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"}