@stevenvo780/st-lang 4.2.0 → 4.3.0

package/dist/runtime/abduction/entails.js

@@ -0,0 +1,308 @@
+"use strict";
+// ============================================================
+// ST Abduction — Oráculo de entailment por defecto
+// ============================================================
+//
+// Implementación de entailment por forward-chaining sobre un
+// fragmento Horn con unificación simple:
+//
+//   Sintaxis soportada:
+//     - Átomos:   `p`, `bird(tweety)`, `parent(alice, bob)`
+//     - Reglas:   `A → B`  (también acepta `->`)
+//     - Reglas conjuntivas: `A ∧ B → C` (también `&&`, `and`, `,`)
+//     - Negación de conclusión: `A → ¬B` (también `~B`, `!B`)
+//
+//   Variables: identificadores que empiezan con letra minúscula y
+//   están dentro de argumentos de un predicado son variables
+//   universalmente cuantificadas (estilo Prolog implícito).
+//   Constantes: empiezan con mayúscula o son nombres entre comillas;
+//   los demás identificadores se tratan como variables si están
+//   dentro de un predicado.
+//
+//   Por convención de los tests del usuario, `bird(x)` tiene `x` como
+//   variable y `bird(tweety)` tiene `tweety` como constante: usamos
+//   un set de "variable names" configurable, default = nombres de
+//   una sola letra ASCII minúscula (`x`, `y`, `z`, `u`, `v`, `w`).
+//
+// Limitaciones consciente: no es un demostrador FOL completo. Es
+// suficiente para los casos de abducción típicos (diagnóstico,
+// Horn-like). Para fragmentos más ricos, pasar un `EntailmentOracle`
+// custom.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.defaultEntails = defaultEntails;
+exports.defaultConsistent = defaultConsistent;
+// Reservamos un set chico de variable-names canónicas. Para casos
+// que necesiten más, pasar un EntailmentOracle propio.
+const DEFAULT_VARS = new Set(['x', 'y', 'z', 'u', 'v', 'w']);
+function tokenizeArgs(s) {
+    const out = [];
+    let depth = 0;
+    let cur = '';
+    for (const ch of s) {
+        if (ch === '(') {
+            depth++;
+            cur += ch;
+        }
+        else if (ch === ')') {
+            depth--;
+            cur += ch;
+        }
+        else if (ch === ',' && depth === 0) {
+            out.push(cur.trim());
+            cur = '';
+        }
+        else {
+            cur += ch;
+        }
+    }
+    if (cur.trim().length > 0)
+        out.push(cur.trim());
+    return out;
+}
+function parseAtom(rawIn) {
+    let raw = rawIn.trim();
+    let negated = false;
+    while (raw.startsWith('¬') || raw.startsWith('~') || raw.startsWith('!')) {
+        negated = !negated;
+        raw = raw.slice(1).trim();
+    }
+    const lp = raw.indexOf('(');
+    if (lp === -1) {
+        return { predicate: raw, args: [], negated };
+    }
+    const rp = raw.lastIndexOf(')');
+    if (rp === -1 || rp < lp) {
+        return { predicate: raw, args: [], negated };
+    }
+    const predicate = raw.slice(0, lp).trim();
+    const argsRaw = raw.slice(lp + 1, rp);
+    const args = tokenizeArgs(argsRaw);
+    return { predicate, args, negated };
+}
+function splitImplication(formula) {
+    // Soportar → (→), -> y =>.
+    const arrows = ['→', '->', '=>'];
+    for (const arr of arrows) {
+        const idx = formula.indexOf(arr);
+        if (idx >= 0) {
+            return {
+                lhs: formula.slice(0, idx).trim(),
+                rhs: formula.slice(idx + arr.length).trim(),
+            };
+        }
+    }
+    return null;
+}
+function splitConjunction(lhs) {
+    // Soportar ∧, &&, ` and ` (con espacios), y ',' (a tope).
+    // Procesamos a profundidad-0 para no romper args(a, b).
+    const seps = ['∧', '&&'];
+    for (const s of seps) {
+        if (lhs.includes(s)) {
+            return lhs
+                .split(s)
+                .map((p) => p.trim())
+                .filter((p) => p.length > 0);
+        }
+    }
+    // ' and ' como separador case-insensitive.
+    const andRegex = /\s+and\s+/i;
+    if (andRegex.test(lhs)) {
+        return lhs
+            .split(andRegex)
+            .map((p) => p.trim())
+            .filter((p) => p.length > 0);
+    }
+    // ',' a profundidad 0 (no dentro de args(...)).
+    const parts = [];
+    let depth = 0;
+    let cur = '';
+    for (const ch of lhs) {
+        if (ch === '(') {
+            depth++;
+            cur += ch;
+        }
+        else if (ch === ')') {
+            depth--;
+            cur += ch;
+        }
+        else if (ch === ',' && depth === 0) {
+            parts.push(cur.trim());
+            cur = '';
+        }
+        else {
+            cur += ch;
+        }
+    }
+    if (cur.trim().length > 0)
+        parts.push(cur.trim());
+    return parts.filter((p) => p.length > 0);
+}
+function parseFormula(formula) {
+    const imp = splitImplication(formula);
+    if (imp) {
+        const premises = splitConjunction(imp.lhs).map(parseAtom);
+        const conclusion = parseAtom(imp.rhs);
+        return { premises, conclusion };
+    }
+    return { premises: [], conclusion: parseAtom(formula) };
+}
+function isVariable(term, varNames) {
+    return varNames.has(term);
+}
+function atomKey(a) {
+    const sign = a.negated ? '¬' : '';
+    if (a.args.length === 0)
+        return `${sign}${a.predicate}`;
+    return `${sign}${a.predicate}(${a.args.join(',')})`;
+}
+/** Unifica `pattern` (puede tener vars) con `ground` (sin vars).
+ *  Retorna mapa var→constante o null si falla. Asume ground sin vars. */
+function unify(pattern, ground, varNames, subst) {
+    if (pattern.predicate !== ground.predicate)
+        return null;
+    if (pattern.negated !== ground.negated)
+        return null;
+    if (pattern.args.length !== ground.args.length)
+        return null;
+    const next = new Map(subst);
+    for (let i = 0; i < pattern.args.length; i++) {
+        const pa = pattern.args[i];
+        const ga = ground.args[i];
+        if (pa === undefined || ga === undefined)
+            return null;
+        if (isVariable(pa, varNames)) {
+            const bound = next.get(pa);
+            if (bound !== undefined) {
+                if (bound !== ga)
+                    return null;
+            }
+            else {
+                next.set(pa, ga);
+            }
+        }
+        else if (pa !== ga) {
+            return null;
+        }
+    }
+    return next;
+}
+function applySubst(a, subst) {
+    return {
+        predicate: a.predicate,
+        args: a.args.map((arg) => subst.get(arg) ?? arg),
+        negated: a.negated,
+    };
+}
+function isGround(a, varNames) {
+    return a.args.every((arg) => !isVariable(arg, varNames));
+}
+/** Forward-chaining: deriva el cierre de hechos a partir de premisas. */
+function forwardChain(premises, varNames, maxIterations = 1000) {
+    const parsed = premises.map(parseFormula);
+    const facts = new Set();
+    const rules = [];
+    for (const p of parsed) {
+        if (p.premises.length === 0 && isGround(p.conclusion, varNames)) {
+            facts.add(atomKey(p.conclusion));
+        }
+        else {
+            rules.push(p);
+        }
+    }
+    // Check trivial inconsistency en facts (p y ¬p ambos hechos).
+    for (const f of facts) {
+        if (f.startsWith('¬')) {
+            if (facts.has(f.slice(1)))
+                return { facts, inconsistent: true };
+        }
+        else {
+            if (facts.has(`¬${f}`))
+                return { facts, inconsistent: true };
+        }
+    }
+    let changed = true;
+    let iter = 0;
+    while (changed && iter < maxIterations) {
+        changed = false;
+        iter++;
+        for (const rule of rules) {
+            // Generar todas las substituciones que satisfacen las premisas.
+            const substitutions = matchPremises(rule.premises, facts, varNames);
+            for (const subst of substitutions) {
+                const conc = applySubst(rule.conclusion, subst);
+                if (!isGround(conc, varNames))
+                    continue;
+                const key = atomKey(conc);
+                if (!facts.has(key)) {
+                    // ¿Crea inconsistencia con un hecho existente?
+                    const opposite = conc.negated ? atomKey({ ...conc, negated: false }) : `¬${key}`;
+                    if (facts.has(opposite)) {
+                        facts.add(key);
+                        return { facts, inconsistent: true };
+                    }
+                    facts.add(key);
+                    changed = true;
+                }
+            }
+        }
+    }
+    return { facts, inconsistent: false };
+}
+/** Devuelve todas las substituciones que satisfacen una lista de premisas
+ *  contra el conjunto actual de hechos (ground). */
+function matchPremises(premises, facts, varNames) {
+    if (premises.length === 0)
+        return [new Map()];
+    // Parse facts a atoms ground una sola vez.
+    const groundAtoms = [];
+    for (const f of facts)
+        groundAtoms.push(parseAtom(f));
+    let cur = [new Map()];
+    for (const prem of premises) {
+        const next = [];
+        for (const subst of cur) {
+            const inst = applySubst(prem, subst);
+            for (const ga of groundAtoms) {
+                const u = unify(inst, ga, varNames, subst);
+                if (u !== null)
+                    next.push(u);
+            }
+        }
+        cur = next;
+        if (cur.length === 0)
+            return [];
+    }
+    return cur;
+}
+/**
+ * Oráculo de entailment por defecto. Forward-chaining sobre Horn-like.
+ *
+ * Devuelve `true` sii `target` (ground) es derivable de `premises`.
+ * Si `target` contiene variables se reporta `false` (no soportamos
+ * ∃-targets aquí; usar custom oracle).
+ */
+function defaultEntails(opts = {}) {
+    const varNames = opts.variableNames ?? DEFAULT_VARS;
+    const maxIter = opts.maxIterations ?? 1000;
+    return (premises, target) => {
+        const { facts } = forwardChain(premises, varNames, maxIter);
+        const targetAtom = parseAtom(target);
+        if (!isGround(targetAtom, varNames))
+            return false;
+        return facts.has(atomKey(targetAtom));
+    };
+}
+/**
+ * Oráculo de consistencia por defecto. Considera inconsistente sii
+ * el forward-chaining deriva un par {p, ¬p}.
+ */
+function defaultConsistent(opts = {}) {
+    const varNames = opts.variableNames ?? DEFAULT_VARS;
+    const maxIter = opts.maxIterations ?? 1000;
+    return (premises) => {
+        const { inconsistent } = forwardChain(premises, varNames, maxIter);
+        return !inconsistent;
+    };
+}
+//# sourceMappingURL=entails.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"entails.js","sourceRoot":"","sources":["../../../src/runtime/abduction/entails.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,mDAAmD;AACnD,+DAA+D;AAC/D,EAAE;AACF,6DAA6D;AAC7D,yCAAyC;AACzC,EAAE;AACF,wBAAwB;AACxB,4DAA4D;AAC5D,iDAAiD;AACjD,mEAAmE;AACnE,8DAA8D;AAC9D,EAAE;AACF,kEAAkE;AAClE,6DAA6D;AAC7D,4DAA4D;AAC5D,qEAAqE;AACrE,gEAAgE;AAChE,4BAA4B;AAC5B,EAAE;AACF,sEAAsE;AACtE,oEAAoE;AACpE,kEAAkE;AAClE,mEAAmE;AACnE,EAAE;AACF,iEAAiE;AACjE,+DAA+D;AAC/D,qEAAqE;AACrE,UAAU;;AAwRV,wCASC;AAMD,8CASC;AA5SD,kEAAkE;AAClE,uDAAuD;AACvD,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;AAc7D,SAAS,YAAY,CAAC,CAAS;IAC7B,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,GAAG,GAAG,EAAE,CAAC;IACb,KAAK,MAAM,EAAE,IAAI,CAAC,EAAE,CAAC;QACnB,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;YACf,KAAK,EAAE,CAAC;YACR,GAAG,IAAI,EAAE,CAAC;QACZ,CAAC;aAAM,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;YACtB,KAAK,EAAE,CAAC;YACR,GAAG,IAAI,EAAE,CAAC;QACZ,CAAC;aAAM,IAAI,EAAE,KAAK,GAAG,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;YACrC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC;YACrB,GAAG,GAAG,EAAE,CAAC;QACX,CAAC;aAAM,CAAC;YACN,GAAG,IAAI,EAAE,CAAC;QACZ,CAAC;IACH,CAAC;IACD,IAAI,GAAG,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC;QAAE,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC;IAChD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,SAAS,CAAC,KAAa;IAC9B,IAAI,GAAG,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC;IACvB,IAAI,OAAO,GAAG,KAAK,CAAC;IACpB,OAAO,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;QACzE,OAAO,GAAG,CAAC,OAAO,CAAC;QACnB,GAAG,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IAC5B,CAAC;IACD,MAAM,EAAE,GAAG,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IAC5B,IAAI,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC;QACd,OAAO,EAAE,SAAS,EAAE,GAAG,EAAE,IAAI,EAAE,EAAE,EAAE,OAAO,EAAE,CAAC;IAC/C,CAAC;IACD,MAAM,EAAE,GAAG,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;IAChC,IAAI,EAAE,KAAK,CAAC,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;QACzB,OAAO,EAAE,SAAS,EAAE,GAAG,EAAE,IAAI,EAAE,EAAE,EAAE,OAAO,EAAE,CAAC;IAC/C,CAAC;IACD,MAAM,SAAS,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;IAC1C,MAAM,OAAO,GAAG,GAAG,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC;IACtC,MAAM,IAAI,GAAG,YAAY,CAAC,OAAO,CAAC,CAAC;IACnC,OAAO,EAAE,SAAS,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;AACtC,CAAC;AAED,SAAS,gBAAgB,CAAC,OAAe;IACvC,2BAA2B;IAC3B,MAAM,MAAM,GAAG,CAAC,GAAG,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;IACjC,KAAK,MAAM,GAAG,IAAI,MAAM,EAAE,CAAC;QACzB,MAAM,GAAG,GAAG,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QACjC,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC;YACb,OAAO;gBACL,GAAG,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE;gBACjC,GAAG,EAAE,OAAO,CAAC,KAAK,CAAC,GAAG,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE;aAC5C,CAAC;QACJ,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,gBAAgB,CAAC,GAAW;IACnC,0DAA0D;IAC1D,wDAAwD;IACxD,MAAM,IAAI,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;IACzB,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;YACpB,OAAO,GAAG;iBACP,KAAK,CAAC,CAAC,CAAC;iBACR,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;iBACpB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACjC,CAAC;IACH,CAAC;IACD,2CAA2C;IAC3C,MAAM,QAAQ,GAAG,YAAY,CAAC;IAC9B,IAAI,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACvB,OAAO,GAAG;aACP,KAAK,CAAC,QAAQ,CAAC;aACf,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;aACpB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACjC,CAAC;IACD,gDAAgD;IAChD,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,GAAG,GAAG,EAAE,CAAC;IACb,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;QACrB,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;YACf,KAAK,EAAE,CAAC;YACR,GAAG,IAAI,EAAE,CAAC;QACZ,CAAC;aAAM,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;YACtB,KAAK,EAAE,CAAC;YACR,GAAG,IAAI,EAAE,CAAC;QACZ,CAAC;aAAM,IAAI,EAAE,KAAK,GAAG,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;YACrC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC;YACvB,GAAG,GAAG,EAAE,CAAC;QACX,CAAC;aAAM,CAAC;YACN,GAAG,IAAI,EAAE,CAAC;QACZ,CAAC;IACH,CAAC;IACD,IAAI,GAAG,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC;QAAE,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC;IAClD,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AAC3C,CAAC;AAED,SAAS,YAAY,CAAC,OAAgB;IACpC,MAAM,GAAG,GAAG,gBAAgB,CAAC,OAAO,CAAC,CAAC;IACtC,IAAI,GAAG,EAAE,CAAC;QACR,MAAM,QAAQ,GAAG,gBAAgB,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAC1D,MAAM,UAAU,GAAG,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACtC,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,CAAC;IAClC,CAAC;IACD,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,UAAU,EAAE,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC;AAC1D,CAAC;AAED,SAAS,UAAU,CAAC,IAAY,EAAE,QAA6B;IAC7D,OAAO,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;AAC5B,CAAC;AAED,SAAS,OAAO,CAAC,CAAO;IACtB,MAAM,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;IAClC,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,GAAG,IAAI,GAAG,CAAC,CAAC,SAAS,EAAE,CAAC;IACxD,OAAO,GAAG,IAAI,GAAG,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;AACtD,CAAC;AAED;yEACyE;AACzE,SAAS,KAAK,CACZ,OAAa,EACb,MAAY,EACZ,QAA6B,EAC7B,KAA0B;IAE1B,IAAI,OAAO,CAAC,SAAS,KAAK,MAAM,CAAC,SAAS;QAAE,OAAO,IAAI,CAAC;IACxD,IAAI,OAAO,CAAC,OAAO,KAAK,MAAM,CAAC,OAAO;QAAE,OAAO,IAAI,CAAC;IACpD,IAAI,OAAO,CAAC,IAAI,CAAC,MAAM,KAAK,MAAM,CAAC,IAAI,CAAC,MAAM;QAAE,OAAO,IAAI,CAAC;IAC5D,MAAM,IAAI,GAAG,IAAI,GAAG,CAAiB,KAAK,CAAC,CAAC;IAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7C,MAAM,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC3B,MAAM,EAAE,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1B,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,SAAS;YAAE,OAAO,IAAI,CAAC;QACtD,IAAI,UAAU,CAAC,EAAE,EAAE,QAAQ,CAAC,EAAE,CAAC;YAC7B,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC3B,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;gBACxB,IAAI,KAAK,KAAK,EAAE;oBAAE,OAAO,IAAI,CAAC;YAChC,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YACnB,CAAC;QACH,CAAC;aAAM,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;YACrB,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,UAAU,CAAC,CAAO,EAAE,KAAkC;IAC7D,OAAO;QACL,SAAS,EAAE,CAAC,CAAC,SAAS;QACtB,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC;QAChD,OAAO,EAAE,CAAC,CAAC,OAAO;KACnB,CAAC;AACJ,CAAC;AAED,SAAS,QAAQ,CAAC,CAAO,EAAE,QAA6B;IACtD,OAAO,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC,CAAC;AAC3D,CAAC;AAED,yEAAyE;AACzE,SAAS,YAAY,CACnB,QAAgC,EAChC,QAA6B,EAC7B,aAAa,GAAG,IAAI;IAEpB,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;IAC1C,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;IAChC,MAAM,KAAK,GAAoB,EAAE,CAAC;IAElC,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,IAAI,CAAC,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,UAAU,EAAE,QAAQ,CAAC,EAAE,CAAC;YAChE,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;QACnC,CAAC;aAAM,CAAC;YACN,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAChB,CAAC;IACH,CAAC;IAED,8DAA8D;IAC9D,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,IAAI,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;YACtB,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBAAE,OAAO,EAAE,KAAK,EAAE,YAAY,EAAE,IAAI,EAAE,CAAC;QAClE,CAAC;aAAM,CAAC;YACN,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBAAE,OAAO,EAAE,KAAK,EAAE,YAAY,EAAE,IAAI,EAAE,CAAC;QAC/D,CAAC;IACH,CAAC;IAED,IAAI,OAAO,GAAG,IAAI,CAAC;IACnB,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,OAAO,OAAO,IAAI,IAAI,GAAG,aAAa,EAAE,CAAC;QACvC,OAAO,GAAG,KAAK,CAAC;QAChB,IAAI,EAAE,CAAC;QACP,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,gEAAgE;YAChE,MAAM,aAAa,GAAG,aAAa,CAAC,IAAI,CAAC,QAAQ,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;YACpE,KAAK,MAAM,KAAK,IAAI,aAAa,EAAE,CAAC;gBAClC,MAAM,IAAI,GAAG,UAAU,CAAC,IAAI,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;gBAChD,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC;oBAAE,SAAS;gBACxC,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;gBAC1B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;oBACpB,+CAA+C;oBAC/C,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,GAAG,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,EAAE,CAAC;oBACjF,IAAI,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;wBACxB,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;wBACf,OAAO,EAAE,KAAK,EAAE,YAAY,EAAE,IAAI,EAAE,CAAC;oBACvC,CAAC;oBACD,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;oBACf,OAAO,GAAG,IAAI,CAAC;gBACjB,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,YAAY,EAAE,KAAK,EAAE,CAAC;AACxC,CAAC;AAED;oDACoD;AACpD,SAAS,aAAa,CACpB,QAA6B,EAC7B,KAA0B,EAC1B,QAA6B;IAE7B,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,IAAI,GAAG,EAAkB,CAAC,CAAC;IAE9D,2CAA2C;IAC3C,MAAM,WAAW,GAAW,EAAE,CAAC;IAC/B,KAAK,MAAM,CAAC,IAAI,KAAK;QAAE,WAAW,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;IAEtD,IAAI,GAAG,GAA0B,CAAC,IAAI,GAAG,EAAkB,CAAC,CAAC;IAC7D,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;QAC5B,MAAM,IAAI,GAA0B,EAAE,CAAC;QACvC,KAAK,MAAM,KAAK,IAAI,GAAG,EAAE,CAAC;YACxB,MAAM,IAAI,GAAG,UAAU,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;YACrC,KAAK,MAAM,EAAE,IAAI,WAAW,EAAE,CAAC;gBAC7B,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,EAAE,EAAE,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;gBAC3C,IAAI,CAAC,KAAK,IAAI;oBAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC/B,CAAC;QACH,CAAC;QACD,GAAG,GAAG,IAAI,CAAC;QACX,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;IAClC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AASD;;;;;;GAMG;AACH,SAAgB,cAAc,CAAC,OAA8B,EAAE;IAC7D,MAAM,QAAQ,GAAG,IAAI,CAAC,aAAa,IAAI,YAAY,CAAC;IACpD,MAAM,OAAO,GAAG,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC;IAC3C,OAAO,CAAC,QAAQ,EAAE,MAAM,EAAE,EAAE;QAC1B,MAAM,EAAE,KAAK,EAAE,GAAG,YAAY,CAAC,QAAQ,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;QAC5D,MAAM,UAAU,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC;QACrC,IAAI,CAAC,QAAQ,CAAC,UAAU,EAAE,QAAQ,CAAC;YAAE,OAAO,KAAK,CAAC;QAClD,OAAO,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC;IACxC,CAAC,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,SAAgB,iBAAiB,CAC/B,OAA8B,EAAE;IAEhC,MAAM,QAAQ,GAAG,IAAI,CAAC,aAAa,IAAI,YAAY,CAAC;IACpD,MAAM,OAAO,GAAG,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC;IAC3C,OAAO,CAAC,QAAQ,EAAE,EAAE;QAClB,MAAM,EAAE,YAAY,EAAE,GAAG,YAAY,CAAC,QAAQ,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;QACnE,OAAO,CAAC,YAAY,CAAC;IACvB,CAAC,CAAC;AACJ,CAAC"}

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

@@ -0,0 +1,18 @@
+import type { AbductionOptions, AbductionProblem, Explanation } from './types';
+/**
+ * Encuentra todas las explicaciones de un problema abductivo.
+ *
+ * - Enumera subsets de abducibles en orden creciente de tamaño.
+ * - Filtra los inconsistentes y los que no implican la observación.
+ * - Calcula minimalidad por inclusión (parsimony) post-hoc.
+ * - Aplica el filtro `preferred` para el output final.
+ */
+export declare function findExplanations(problem: AbductionProblem, opts?: AbductionOptions): Explanation[];
+/**
+ * Devuelve UNA explicación: la "mejor" según `preferred`. Si hay
+ * empate, la primera en orden lex (consistente y reproducible).
+ *
+ * Devuelve `null` si no hay explicación posible.
+ */
+export declare function bestExplanation(problem: AbductionProblem, opts?: AbductionOptions): Explanation | null;
+//# sourceMappingURL=find.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"find.d.ts","sourceRoot":"","sources":["../../../src/runtime/abduction/find.ts"],"names":[],"mappings":"AAuBA,OAAO,KAAK,EACV,gBAAgB,EAChB,gBAAgB,EAGhB,WAAW,EAGZ,MAAM,SAAS,CAAC;AAwEjB;;;;;;;GAOG;AACH,wBAAgB,gBAAgB,CAC9B,OAAO,EAAE,gBAAgB,EACzB,IAAI,CAAC,EAAE,gBAAgB,GACtB,WAAW,EAAE,CAsEf;AA6BD;;;;;GAKG;AACH,wBAAgB,eAAe,CAC7B,OAAO,EAAE,gBAAgB,EACzB,IAAI,CAAC,EAAE,gBAAgB,GACtB,WAAW,GAAG,IAAI,CAQpB"}

package/dist/runtime/abduction/find.js

@@ -0,0 +1,202 @@
+"use strict";
+// ============================================================
+// ST Abduction — Núcleo: búsqueda de explicaciones
+// ============================================================
+//
+// Estrategia: enumeración por tamaño creciente (BFS sobre subsets).
+//
+//   for k in 0..maxSize:
+//     for cada subset H ⊆ abducibles con |H| = k:
+//       si KB ∪ H ⊨ O y KB ∪ H consistent:
+//         registrar H como explicación
+//         marcar todos sus supersets como redundantes (no parsimoniosos)
+//
+// Las explicaciones se reportan ordenadas por tamaño ascendente. La
+// minimalidad por inclusión se verifica al final con una pasada O(N²)
+// sobre las explicaciones encontradas (suficiente para |explicaciones|
+// ≲ algunos miles; en problemas grandes acotar `maxHypotheses`).
+//
+// Para `preferred = 'minimal'`, solo se reportan las parsimoniosas.
+// Para `minimum-cardinality`, se reportan únicamente las de tamaño
+// igual al mínimo encontrado. Para `minimum-cost`, las de costo
+// mínimo (requiere costFunction o se usa size).
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.findExplanations = findExplanations;
+exports.bestExplanation = bestExplanation;
+const entails_1 = require("./entails");
+function resolveOptions(abducibles, opts) {
+    const entails = opts?.entails ?? (0, entails_1.defaultEntails)();
+    const consistent = opts?.consistent ?? (0, entails_1.defaultConsistent)();
+    return {
+        entails,
+        consistent,
+        maxHypotheses: opts?.maxHypotheses ?? 1024,
+        maxSize: opts?.maxSize ?? abducibles.length,
+        costFunction: opts?.costFunction ?? (() => 1),
+        preferred: opts?.preferred ?? 'minimal',
+    };
+}
+/** Itera sobre todos los subsets de [0..n) de tamaño exactamente k (orden lex). */
+function* combinations(n, k) {
+    if (k < 0 || k > n)
+        return;
+    if (k === 0) {
+        yield [];
+        return;
+    }
+    const idx = new Array(k);
+    for (let i = 0; i < k; i++)
+        idx[i] = i;
+    while (true) {
+        yield idx.slice();
+        // Avanzar al siguiente combination en orden lex.
+        let i = k - 1;
+        while (i >= 0 && idx[i] === n - k + i)
+            i--;
+        if (i < 0)
+            return;
+        idx[i] = idx[i] + 1;
+        for (let j = i + 1; j < k; j++)
+            idx[j] = idx[j - 1] + 1;
+    }
+}
+function isSubsetOf(a, b) {
+    if (a.length > b.length)
+        return false;
+    let i = 0;
+    let j = 0;
+    while (i < a.length && j < b.length) {
+        const ai = a[i];
+        const bj = b[j];
+        if (ai === bj) {
+            i++;
+            j++;
+        }
+        else if (ai < bj) {
+            return false;
+        }
+        else {
+            j++;
+        }
+    }
+    return i === a.length;
+}
+/**
+ * Encuentra todas las explicaciones de un problema abductivo.
+ *
+ * - Enumera subsets de abducibles en orden creciente de tamaño.
+ * - Filtra los inconsistentes y los que no implican la observación.
+ * - Calcula minimalidad por inclusión (parsimony) post-hoc.
+ * - Aplica el filtro `preferred` para el output final.
+ */
+function findExplanations(problem, opts) {
+    const { kb, observation, abducibles } = problem;
+    const resolved = resolveOptions(abducibles, opts);
+    const n = abducibles.length;
+    const maxK = Math.min(resolved.maxSize, n);
+    // Pre-check: si KB ya implica O sin ninguna hipótesis, la explicación
+    // vacía es la única parsimoniosa.
+    // (Esto requiere consistencia de KB y derivación.)
+    const raw = [];
+    if (resolved.consistent(kb) && resolved.entails(kb, observation)) {
+        raw.push({ indices: [], hypotheses: [], costScore: 0 });
+    }
+    // Buscamos también H no vacíos. Si la vacía explica, según
+    // `preferred` puede ser todo lo que necesitamos (case-by-case).
+    outer: for (let k = 1; k <= maxK; k++) {
+        for (const idx of combinations(n, k)) {
+            const hypotheses = [];
+            let costScore = 0;
+            for (const i of idx) {
+                const f = abducibles[i];
+                if (f === undefined)
+                    continue;
+                hypotheses.push(f);
+                costScore += resolved.costFunction(f);
+            }
+            const combined = [...kb, ...hypotheses];
+            // Skip duplicate trivial: si algún subset menor ya está en raw y es
+            // subset de este, este NO va a ser parsimonious. Lo enumeramos
+            // igual porque `preferred=all` debe verlos, pero podemos saltarlo
+            // si `preferred` ∈ {minimal, minimum-cardinality, minimum-cost}.
+            if (resolved.preferred !== 'all' &&
+                raw.some((r) => r.indices.length < idx.length && isSubsetOf(r.indices, idx))) {
+                continue;
+            }
+            if (!resolved.consistent(combined))
+                continue;
+            if (!resolved.entails(combined, observation))
+                continue;
+            raw.push({ indices: idx, hypotheses, costScore });
+            if (raw.length >= resolved.maxHypotheses)
+                break outer;
+        }
+    }
+    // Determinar parsimony por inclusión: una H es parsimoniosa sii no
+    // existe H' ∈ raw con H' ⊂ H (subconjunto propio).
+    const parsimonyMap = new Map();
+    const keyFor = (r) => r.indices.join(',');
+    for (const r of raw) {
+        let parsim = true;
+        for (const other of raw) {
+            if (other === r)
+                continue;
+            if (other.indices.length >= r.indices.length)
+                continue;
+            if (isSubsetOf(other.indices, r.indices)) {
+                parsim = false;
+                break;
+            }
+        }
+        parsimonyMap.set(keyFor(r), parsim);
+    }
+    // Convertir a Explanation[].
+    const explanations = raw.map((r) => ({
+        hypotheses: r.hypotheses,
+        size: r.hypotheses.length,
+        parsimonious: parsimonyMap.get(keyFor(r)) ?? false,
+        costScore: r.costScore,
+    }));
+    return applyPreference(explanations, resolved);
+}
+function applyPreference(expls, resolved) {
+    if (expls.length === 0)
+        return [];
+    switch (resolved.preferred) {
+        case 'all':
+            return expls.slice();
+        case 'minimal':
+            return expls.filter((e) => e.parsimonious);
+        case 'minimum-cardinality': {
+            const minimal = expls.filter((e) => e.parsimonious);
+            if (minimal.length === 0)
+                return [];
+            const minSize = minimal.reduce((m, e) => Math.min(m, e.size), Infinity);
+            return minimal.filter((e) => e.size === minSize);
+        }
+        case 'minimum-cost': {
+            const minimal = expls.filter((e) => e.parsimonious);
+            if (minimal.length === 0)
+                return [];
+            const minCost = minimal.reduce((m, e) => Math.min(m, e.costScore ?? Infinity), Infinity);
+            return minimal.filter((e) => (e.costScore ?? Infinity) === minCost);
+        }
+        default:
+            return expls.slice();
+    }
+}
+/**
+ * Devuelve UNA explicación: la "mejor" según `preferred`. Si hay
+ * empate, la primera en orden lex (consistente y reproducible).
+ *
+ * Devuelve `null` si no hay explicación posible.
+ */
+function bestExplanation(problem, opts) {
+    // Para best-explanation, forzamos minimum-cost si hay costFunction;
+    // si no, minimum-cardinality. El cliente puede overridear con
+    // opts.preferred.
+    const preferred = opts?.preferred ?? (opts?.costFunction ? 'minimum-cost' : 'minimum-cardinality');
+    const all = findExplanations(problem, { ...opts, preferred });
+    return all.length > 0 ? all[0] : null;
+}
+//# sourceMappingURL=find.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"find.js","sourceRoot":"","sources":["../../../src/runtime/abduction/find.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,mDAAmD;AACnD,+DAA+D;AAC/D,EAAE;AACF,oEAAoE;AACpE,EAAE;AACF,yBAAyB;AACzB,kDAAkD;AAClD,2CAA2C;AAC3C,uCAAuC;AACvC,yEAAyE;AACzE,EAAE;AACF,oEAAoE;AACpE,sEAAsE;AACtE,uEAAuE;AACvE,iEAAiE;AACjE,EAAE;AACF,oEAAoE;AACpE,mEAAmE;AACnE,gEAAgE;AAChE,gDAAgD;;AA2FhD,4CAyEC;AAmCD,0CAWC;AAhND,uCAA8D;AAoB9D,SAAS,cAAc,CACrB,UAAkC,EAClC,IAAuB;IAEvB,MAAM,OAAO,GAAG,IAAI,EAAE,OAAO,IAAI,IAAA,wBAAc,GAAE,CAAC;IAClD,MAAM,UAAU,GAAG,IAAI,EAAE,UAAU,IAAI,IAAA,2BAAiB,GAAE,CAAC;IAC3D,OAAO;QACL,OAAO;QACP,UAAU;QACV,aAAa,EAAE,IAAI,EAAE,aAAa,IAAI,IAAI;QAC1C,OAAO,EAAE,IAAI,EAAE,OAAO,IAAI,UAAU,CAAC,MAAM;QAC3C,YAAY,EAAE,IAAI,EAAE,YAAY,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAC7C,SAAS,EAAE,IAAI,EAAE,SAAS,IAAI,SAAS;KACxC,CAAC;AACJ,CAAC;AAED,mFAAmF;AACnF,QAAQ,CAAC,CAAC,YAAY,CAAC,CAAS,EAAE,CAAS;IACzC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC;QAAE,OAAO;IAC3B,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACZ,MAAM,EAAE,CAAC;QACT,OAAO;IACT,CAAC;IACD,MAAM,GAAG,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC;IACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACvC,OAAO,IAAI,EAAE,CAAC;QACZ,MAAM,GAAG,CAAC,KAAK,EAAE,CAAC;QAClB,iDAAiD;QACjD,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACd,OAAO,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,CAAC,EAAE,CAAC;QAC3C,IAAI,CAAC,GAAG,CAAC;YAAE,OAAO;QAClB,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACpB,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IAC1D,CAAC;AACH,CAAC;AAED,SAAS,UAAU,CAAC,CAAwB,EAAE,CAAwB;IACpE,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM;QAAE,OAAO,KAAK,CAAC;IACtC,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC;QACpC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAChB,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAChB,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;YACd,CAAC,EAAE,CAAC;YACJ,CAAC,EAAE,CAAC;QACN,CAAC;aAAM,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;YACnB,OAAO,KAAK,CAAC;QACf,CAAC;aAAM,CAAC;YACN,CAAC,EAAE,CAAC;QACN,CAAC;IACH,CAAC;IACD,OAAO,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC;AACxB,CAAC;AAQD;;;;;;;GAOG;AACH,SAAgB,gBAAgB,CAC9B,OAAyB,EACzB,IAAuB;IAEvB,MAAM,EAAE,EAAE,EAAE,WAAW,EAAE,UAAU,EAAE,GAAG,OAAO,CAAC;IAChD,MAAM,QAAQ,GAAG,cAAc,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;IAClD,MAAM,CAAC,GAAG,UAAU,CAAC,MAAM,CAAC;IAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;IAE3C,sEAAsE;IACtE,kCAAkC;IAClC,mDAAmD;IACnD,MAAM,GAAG,GAAqB,EAAE,CAAC;IACjC,IAAI,QAAQ,CAAC,UAAU,CAAC,EAAE,CAAC,IAAI,QAAQ,CAAC,OAAO,CAAC,EAAE,EAAE,WAAW,CAAC,EAAE,CAAC;QACjE,GAAG,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,UAAU,EAAE,EAAE,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC;IAC1D,CAAC;IAED,2DAA2D;IAC3D,gEAAgE;IAChE,KAAK,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,KAAK,MAAM,GAAG,IAAI,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;YACrC,MAAM,UAAU,GAAc,EAAE,CAAC;YACjC,IAAI,SAAS,GAAG,CAAC,CAAC;YAClB,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE,CAAC;gBACpB,MAAM,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;gBACxB,IAAI,CAAC,KAAK,SAAS;oBAAE,SAAS;gBAC9B,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACnB,SAAS,IAAI,QAAQ,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YACxC,CAAC;YACD,MAAM,QAAQ,GAAG,CAAC,GAAG,EAAE,EAAE,GAAG,UAAU,CAAC,CAAC;YACxC,oEAAoE;YACpE,+DAA+D;YAC/D,kEAAkE;YAClE,iEAAiE;YACjE,IACE,QAAQ,CAAC,SAAS,KAAK,KAAK;gBAC5B,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,GAAG,GAAG,CAAC,MAAM,IAAI,UAAU,CAAC,CAAC,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC,EAC5E,CAAC;gBACD,SAAS;YACX,CAAC;YACD,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,QAAQ,CAAC;gBAAE,SAAS;YAC7C,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,QAAQ,EAAE,WAAW,CAAC;gBAAE,SAAS;YACvD,GAAG,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,UAAU,EAAE,SAAS,EAAE,CAAC,CAAC;YAClD,IAAI,GAAG,CAAC,MAAM,IAAI,QAAQ,CAAC,aAAa;gBAAE,MAAM,KAAK,CAAC;QACxD,CAAC;IACH,CAAC;IAED,mEAAmE;IACnE,mDAAmD;IACnD,MAAM,YAAY,GAAG,IAAI,GAAG,EAAmB,CAAC;IAChD,MAAM,MAAM,GAAG,CAAC,CAAiB,EAAU,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAClE,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE,CAAC;QACpB,IAAI,MAAM,GAAG,IAAI,CAAC;QAClB,KAAK,MAAM,KAAK,IAAI,GAAG,EAAE,CAAC;YACxB,IAAI,KAAK,KAAK,CAAC;gBAAE,SAAS;YAC1B,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,IAAI,CAAC,CAAC,OAAO,CAAC,MAAM;gBAAE,SAAS;YACvD,IAAI,UAAU,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC;gBACzC,MAAM,GAAG,KAAK,CAAC;gBACf,MAAM;YACR,CAAC;QACH,CAAC;QACD,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IACtC,CAAC;IAED,6BAA6B;IAC7B,MAAM,YAAY,GAAkB,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAClD,UAAU,EAAE,CAAC,CAAC,UAAU;QACxB,IAAI,EAAE,CAAC,CAAC,UAAU,CAAC,MAAM;QACzB,YAAY,EAAE,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK;QAClD,SAAS,EAAE,CAAC,CAAC,SAAS;KACvB,CAAC,CAAC,CAAC;IAEJ,OAAO,eAAe,CAAC,YAAY,EAAE,QAAQ,CAAC,CAAC;AACjD,CAAC;AAED,SAAS,eAAe,CACtB,KAAiC,EACjC,QAAyB;IAEzB,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAClC,QAAQ,QAAQ,CAAC,SAAS,EAAE,CAAC;QAC3B,KAAK,KAAK;YACR,OAAO,KAAK,CAAC,KAAK,EAAE,CAAC;QACvB,KAAK,SAAS;YACZ,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC;QAC7C,KAAK,qBAAqB,CAAC,CAAC,CAAC;YAC3B,MAAM,OAAO,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC;YACpD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,EAAE,CAAC;YACpC,MAAM,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,QAAQ,CAAC,CAAC;YACxE,OAAO,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC;QACnD,CAAC;QACD,KAAK,cAAc,CAAC,CAAC,CAAC;YACpB,MAAM,OAAO,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC;YACpD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,EAAE,CAAC;YACpC,MAAM,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,SAAS,IAAI,QAAQ,CAAC,EAAE,QAAQ,CAAC,CAAC;YACzF,OAAO,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,IAAI,QAAQ,CAAC,KAAK,OAAO,CAAC,CAAC;QACtE,CAAC;QACD;YACE,OAAO,KAAK,CAAC,KAAK,EAAE,CAAC;IACzB,CAAC;AACH,CAAC;AAED;;;;;GAKG;AACH,SAAgB,eAAe,CAC7B,OAAyB,EACzB,IAAuB;IAEvB,oEAAoE;IACpE,8DAA8D;IAC9D,kBAAkB;IAClB,MAAM,SAAS,GACb,IAAI,EAAE,SAAS,IAAI,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,qBAAqB,CAAC,CAAC;IACnF,MAAM,GAAG,GAAG,gBAAgB,CAAC,OAAO,EAAE,EAAE,GAAG,IAAI,EAAE,SAAS,EAAE,CAAC,CAAC;IAC9D,OAAO,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;AACxC,CAAC"}

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

@@ -0,0 +1,4 @@
+export { findExplanations, bestExplanation } from './find';
+export { defaultEntails, defaultConsistent } from './entails';
+export type { AbductionOptions, AbductionProblem, ConsistencyOracle, EntailmentOracle, Explanation, Formula, Preference, } from './types';
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/runtime/abduction/index.ts"],"names":[],"mappings":"AAiBA,OAAO,EAAE,gBAAgB,EAAE,eAAe,EAAE,MAAM,QAAQ,CAAC;AAC3D,OAAO,EAAE,cAAc,EAAE,iBAAiB,EAAE,MAAM,WAAW,CAAC;AAC9D,YAAY,EACV,gBAAgB,EAChB,gBAAgB,EAChB,iBAAiB,EACjB,gBAAgB,EAChB,WAAW,EACX,OAAO,EACP,UAAU,GACX,MAAM,SAAS,CAAC"}

package/dist/runtime/abduction/index.js

@@ -0,0 +1,26 @@
+"use strict";
+// ============================================================
+// ST Abduction — Barrel
+// ============================================================
+//
+// Razonamiento abductivo: dado un knowledge base KB y una observación
+// O, encontrar la hipótesis mínima H ⊆ Abducibles tal que
+// KB ∪ H ⊨ O y KB ∪ H es consistente.
+//
+// API pública:
+//   - `findExplanations(problem, opts?)`  → todas las explicaciones
+//   - `bestExplanation(problem, opts?)`   → la mejor según preferencia
+//   - `defaultEntails(opts?)`             → oráculo entailment Horn-like
+//   - `defaultConsistent(opts?)`          → oráculo consistencia derivado
+//
+// Tipos: `AbductionProblem`, `Explanation`, `AbductionOptions`,
+// `EntailmentOracle`, `ConsistencyOracle`, `Preference`, `Formula`.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.defaultConsistent = exports.defaultEntails = exports.bestExplanation = exports.findExplanations = void 0;
+var find_1 = require("./find");
+Object.defineProperty(exports, "findExplanations", { enumerable: true, get: function () { return find_1.findExplanations; } });
+Object.defineProperty(exports, "bestExplanation", { enumerable: true, get: function () { return find_1.bestExplanation; } });
+var entails_1 = require("./entails");
+Object.defineProperty(exports, "defaultEntails", { enumerable: true, get: function () { return entails_1.defaultEntails; } });
+Object.defineProperty(exports, "defaultConsistent", { enumerable: true, get: function () { return entails_1.defaultConsistent; } });
+//# sourceMappingURL=index.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/runtime/abduction/index.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,wBAAwB;AACxB,+DAA+D;AAC/D,EAAE;AACF,sEAAsE;AACtE,0DAA0D;AAC1D,sCAAsC;AACtC,EAAE;AACF,eAAe;AACf,oEAAoE;AACpE,uEAAuE;AACvE,yEAAyE;AACzE,0EAA0E;AAC1E,EAAE;AACF,gEAAgE;AAChE,oEAAoE;;;AAEpE,+BAA2D;AAAlD,wGAAA,gBAAgB,OAAA;AAAE,uGAAA,eAAe,OAAA;AAC1C,qCAA8D;AAArD,yGAAA,cAAc,OAAA;AAAE,4GAAA,iBAAiB,OAAA"}