@stevenvo780/st-lang 4.0.1 → 4.2.0

package/dist/profiles/sequent-g3/prover.js

@@ -0,0 +1,348 @@
+"use strict";
+// ============================================================
+// G3 — Backward proof search
+// ============================================================
+//
+// Busqueda hacia atras (root-first). Las reglas de G3 son
+// invertibles, por lo que NO hay que retroceder al elegir la
+// proxima regla: cualquier formula compleja que aplique cierra
+// el subgoal sii la version sin descomponer era cerrable.
+//
+// Terminacion: cada paso reemplaza una formula compleja por
+// sub-formulas estrictamente menores. Para evitar contracciones
+// redundantes en multisets, se dedupica por clave sintactica
+// antes de aplicar la siguiente regla.
+//
+// Branching:
+//   - andR, orL, impL ramifican en 2 premisas (cada una debe cerrar).
+//   - andL, orR, impR, notL, notR son lineales (1 premisa).
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.proveSequent = proveSequent;
+exports.proveFormula = proveFormula;
+const normalize_1 = require("./normalize");
+function slotsOf(list) {
+    return list.map((f) => ({ formula: f, key: (0, normalize_1.formulaKey)(f) }));
+}
+function dedupSlots(slots) {
+    const seen = new Set();
+    const out = [];
+    for (const slot of slots) {
+        if (!seen.has(slot.key)) {
+            seen.add(slot.key);
+            out.push(slot);
+        }
+    }
+    return out;
+}
+function isAtomic(f) {
+    // En G3, los atomos del calculo proposicional son atom/true/false.
+    // Tambien tratamos como opacas las formulas no-proposicionales
+    // (predicados, modales, ...) para que el prover no las descomponga.
+    switch (f.kind) {
+        case 'atom':
+        case 'true':
+        case 'false':
+            return true;
+        case 'not':
+        case 'and':
+        case 'or':
+        case 'implies':
+            return false;
+        default:
+            // Predicados/cuantificadores/etc: opacos.
+            return true;
+    }
+}
+function findAxiomMatch(left, right) {
+    const rightKeys = new Set(right.map((s) => s.key));
+    for (const slot of left) {
+        if (rightKeys.has(slot.key))
+            return slot.formula;
+    }
+    return undefined;
+}
+function findFalseLeft(left) {
+    return left.find((s) => s.formula.kind === 'false')?.formula;
+}
+function findTrueRight(right) {
+    return right.find((s) => s.formula.kind === 'true')?.formula;
+}
+/**
+ * Busca la primera formula no-atomica en `slots` y devuelve su indice y
+ * el slot. Si no hay ninguna, devuelve undefined.
+ */
+function findFirstComplex(slots) {
+    for (let i = 0; i < slots.length; i++) {
+        const slot = slots[i];
+        if (slot && !isAtomic(slot.formula))
+            return { index: i, slot };
+    }
+    return undefined;
+}
+function removeAt(arr, idx) {
+    const copy = arr.slice();
+    copy.splice(idx, 1);
+    return copy;
+}
+function toSequent(left, right) {
+    return {
+        left: left.map((s) => s.formula),
+        right: right.map((s) => s.formula),
+    };
+}
+function exhausted(ctx) {
+    return ctx.used >= ctx.budget;
+}
+function prove(left, right, ctx) {
+    ctx.used++;
+    if (exhausted(ctx))
+        return undefined;
+    const dedupL = dedupSlots(left);
+    const dedupR = dedupSlots(right);
+    const goal = toSequent(dedupL, dedupR);
+    // 1. Axioma: misma formula a izquierda y derecha.
+    const axiomFormula = findAxiomMatch(dedupL, dedupR);
+    if (axiomFormula) {
+        return { goal, rule: 'axiom', principalFormula: axiomFormula, premises: [], closed: true };
+    }
+    // 2. ⊥ en la izquierda cierra inmediatamente.
+    const bottomLeft = findFalseLeft(dedupL);
+    if (bottomLeft) {
+        return { goal, rule: 'falseL', principalFormula: bottomLeft, premises: [], closed: true };
+    }
+    // 3. ⊤ en la derecha cierra inmediatamente.
+    const topRight = findTrueRight(dedupR);
+    if (topRight) {
+        return { goal, rule: 'trueR', principalFormula: topRight, premises: [], closed: true };
+    }
+    // 4. Reglas no-ramificantes primero (siempre que existan).
+    //    Esto reduce el espacio antes de ramificar y produce arboles mas
+    //    pequenos sin sacrificar completitud (las reglas son invertibles).
+    // notL: Γ, ¬A ⊢ Δ  ↦  Γ ⊢ A, Δ
+    for (let i = 0; i < dedupL.length; i++) {
+        const slot = dedupL[i];
+        if (slot && slot.formula.kind === 'not' && slot.formula.args && slot.formula.args[0]) {
+            const inner = slot.formula.args[0];
+            const newL = removeAt(dedupL, i);
+            const newR = [{ formula: inner, key: (0, normalize_1.formulaKey)(inner) }, ...dedupR];
+            const sub = prove(newL, newR, ctx);
+            if (!sub)
+                return undefined;
+            return {
+                goal,
+                rule: 'notL',
+                principalFormula: slot.formula,
+                premises: [sub],
+                closed: sub.closed,
+            };
+        }
+    }
+    // notR: Γ ⊢ ¬A, Δ  ↦  Γ, A ⊢ Δ
+    for (let i = 0; i < dedupR.length; i++) {
+        const slot = dedupR[i];
+        if (slot && slot.formula.kind === 'not' && slot.formula.args && slot.formula.args[0]) {
+            const inner = slot.formula.args[0];
+            const newR = removeAt(dedupR, i);
+            const newL = [{ formula: inner, key: (0, normalize_1.formulaKey)(inner) }, ...dedupL];
+            const sub = prove(newL, newR, ctx);
+            if (!sub)
+                return undefined;
+            return {
+                goal,
+                rule: 'notR',
+                principalFormula: slot.formula,
+                premises: [sub],
+                closed: sub.closed,
+            };
+        }
+    }
+    // andL: Γ, A∧B ⊢ Δ  ↦  Γ, A, B ⊢ Δ
+    for (let i = 0; i < dedupL.length; i++) {
+        const slot = dedupL[i];
+        if (slot &&
+            slot.formula.kind === 'and' &&
+            slot.formula.args &&
+            slot.formula.args[0] &&
+            slot.formula.args[1]) {
+            const a = slot.formula.args[0];
+            const b = slot.formula.args[1];
+            const newL = [
+                { formula: a, key: (0, normalize_1.formulaKey)(a) },
+                { formula: b, key: (0, normalize_1.formulaKey)(b) },
+                ...removeAt(dedupL, i),
+            ];
+            const sub = prove(newL, dedupR, ctx);
+            if (!sub)
+                return undefined;
+            return {
+                goal,
+                rule: 'andL',
+                principalFormula: slot.formula,
+                premises: [sub],
+                closed: sub.closed,
+            };
+        }
+    }
+    // orR: Γ ⊢ A∨B, Δ  ↦  Γ ⊢ A, B, Δ
+    for (let i = 0; i < dedupR.length; i++) {
+        const slot = dedupR[i];
+        if (slot &&
+            slot.formula.kind === 'or' &&
+            slot.formula.args &&
+            slot.formula.args[0] &&
+            slot.formula.args[1]) {
+            const a = slot.formula.args[0];
+            const b = slot.formula.args[1];
+            const newR = [
+                { formula: a, key: (0, normalize_1.formulaKey)(a) },
+                { formula: b, key: (0, normalize_1.formulaKey)(b) },
+                ...removeAt(dedupR, i),
+            ];
+            const sub = prove(dedupL, newR, ctx);
+            if (!sub)
+                return undefined;
+            return {
+                goal,
+                rule: 'orR',
+                principalFormula: slot.formula,
+                premises: [sub],
+                closed: sub.closed,
+            };
+        }
+    }
+    // impR: Γ ⊢ A→B, Δ  ↦  Γ, A ⊢ B, Δ
+    for (let i = 0; i < dedupR.length; i++) {
+        const slot = dedupR[i];
+        if (slot &&
+            slot.formula.kind === 'implies' &&
+            slot.formula.args &&
+            slot.formula.args[0] &&
+            slot.formula.args[1]) {
+            const a = slot.formula.args[0];
+            const b = slot.formula.args[1];
+            const newL = [{ formula: a, key: (0, normalize_1.formulaKey)(a) }, ...dedupL];
+            const newR = [{ formula: b, key: (0, normalize_1.formulaKey)(b) }, ...removeAt(dedupR, i)];
+            const sub = prove(newL, newR, ctx);
+            if (!sub)
+                return undefined;
+            return {
+                goal,
+                rule: 'impR',
+                principalFormula: slot.formula,
+                premises: [sub],
+                closed: sub.closed,
+            };
+        }
+    }
+    // 5. Reglas ramificantes (despues de las lineales).
+    // andR: Γ ⊢ A∧B, Δ  ↦  Γ ⊢ A, Δ  ∧  Γ ⊢ B, Δ
+    for (let i = 0; i < dedupR.length; i++) {
+        const slot = dedupR[i];
+        if (slot &&
+            slot.formula.kind === 'and' &&
+            slot.formula.args &&
+            slot.formula.args[0] &&
+            slot.formula.args[1]) {
+            const a = slot.formula.args[0];
+            const b = slot.formula.args[1];
+            const restR = removeAt(dedupR, i);
+            const subA = prove(dedupL, [{ formula: a, key: (0, normalize_1.formulaKey)(a) }, ...restR], ctx);
+            if (!subA)
+                return undefined;
+            const subB = prove(dedupL, [{ formula: b, key: (0, normalize_1.formulaKey)(b) }, ...restR], ctx);
+            if (!subB)
+                return undefined;
+            return {
+                goal,
+                rule: 'andR',
+                principalFormula: slot.formula,
+                premises: [subA, subB],
+                closed: subA.closed && subB.closed,
+            };
+        }
+    }
+    // orL: Γ, A∨B ⊢ Δ  ↦  Γ, A ⊢ Δ  ∧  Γ, B ⊢ Δ
+    for (let i = 0; i < dedupL.length; i++) {
+        const slot = dedupL[i];
+        if (slot &&
+            slot.formula.kind === 'or' &&
+            slot.formula.args &&
+            slot.formula.args[0] &&
+            slot.formula.args[1]) {
+            const a = slot.formula.args[0];
+            const b = slot.formula.args[1];
+            const restL = removeAt(dedupL, i);
+            const subA = prove([{ formula: a, key: (0, normalize_1.formulaKey)(a) }, ...restL], dedupR, ctx);
+            if (!subA)
+                return undefined;
+            const subB = prove([{ formula: b, key: (0, normalize_1.formulaKey)(b) }, ...restL], dedupR, ctx);
+            if (!subB)
+                return undefined;
+            return {
+                goal,
+                rule: 'orL',
+                principalFormula: slot.formula,
+                premises: [subA, subB],
+                closed: subA.closed && subB.closed,
+            };
+        }
+    }
+    // impL: Γ, A→B ⊢ Δ  ↦  Γ ⊢ A, Δ  ∧  Γ, B ⊢ Δ
+    for (let i = 0; i < dedupL.length; i++) {
+        const slot = dedupL[i];
+        if (slot &&
+            slot.formula.kind === 'implies' &&
+            slot.formula.args &&
+            slot.formula.args[0] &&
+            slot.formula.args[1]) {
+            const a = slot.formula.args[0];
+            const b = slot.formula.args[1];
+            const restL = removeAt(dedupL, i);
+            const subA = prove(restL, [{ formula: a, key: (0, normalize_1.formulaKey)(a) }, ...dedupR], ctx);
+            if (!subA)
+                return undefined;
+            const subB = prove([{ formula: b, key: (0, normalize_1.formulaKey)(b) }, ...restL], dedupR, ctx);
+            if (!subB)
+                return undefined;
+            return {
+                goal,
+                rule: 'impL',
+                principalFormula: slot.formula,
+                premises: [subA, subB],
+                closed: subA.closed && subB.closed,
+            };
+        }
+    }
+    // 6. Si llegamos aca, no quedan formulas complejas que descomponer y
+    //    no se encontro axioma: el secuente no es derivable (es una hoja
+    //    abierta del arbol de busqueda).
+    const complexL = findFirstComplex(dedupL);
+    const complexR = findFirstComplex(dedupR);
+    if (!complexL && !complexR) {
+        return { goal, premises: [], closed: false };
+    }
+    // Si todavia queda complejidad pero nuestras ramas fueron consumidas,
+    // significa que el algoritmo no encontro forma de avanzar. No deberia
+    // ocurrir con la base normalizada; devolvemos undefined como senal.
+    return undefined;
+}
+/**
+ * Demuestra `seq` (Γ ⊢ Δ) por backward search en G3.
+ * Normaliza las formulas antes de comenzar.
+ */
+function proveSequent(seq, options = {}) {
+    const normLeft = seq.left.map(normalize_1.normalizeForG3);
+    const normRight = seq.right.map(normalize_1.normalizeForG3);
+    const ctx = { budget: options.budget ?? 5_000, used: 0 };
+    const tree = prove(slotsOf(normLeft), slotsOf(normRight), ctx);
+    if (!tree)
+        return { provable: false };
+    return { provable: tree.closed, proof: tree };
+}
+/**
+ * Atajo: demuestra que `⊢ φ` (formula sin hipotesis) es valida en G3.
+ */
+function proveFormula(formula, options = {}) {
+    return proveSequent({ left: [], right: [formula] }, options);
+}
+//# sourceMappingURL=prover.js.map

package/dist/profiles/sequent-g3/prover.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"prover.js","sourceRoot":"","sources":["../../../src/profiles/sequent-g3/prover.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,6BAA6B;AAC7B,+DAA+D;AAC/D,EAAE;AACF,0DAA0D;AAC1D,6DAA6D;AAC7D,+DAA+D;AAC/D,0DAA0D;AAC1D,EAAE;AACF,4DAA4D;AAC5D,gEAAgE;AAChE,6DAA6D;AAC7D,uCAAuC;AACvC,EAAE;AACF,aAAa;AACb,sEAAsE;AACtE,4DAA4D;;AAgW5D,oCAOC;AAKD,oCAEC;AA1WD,2CAAyD;AAOzD,SAAS,OAAO,CAAC,IAAe;IAC9B,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,GAAG,EAAE,IAAA,sBAAU,EAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAC/D,CAAC;AAED,SAAS,UAAU,CAAC,KAAoB;IACtC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,GAAG,GAAkB,EAAE,CAAC;IAC9B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YACxB,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACnB,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjB,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,QAAQ,CAAC,CAAU;IAC1B,mEAAmE;IACnE,+DAA+D;IAC/D,oEAAoE;IACpE,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,MAAM,CAAC;QACZ,KAAK,MAAM,CAAC;QACZ,KAAK,OAAO;YACV,OAAO,IAAI,CAAC;QACd,KAAK,KAAK,CAAC;QACX,KAAK,KAAK,CAAC;QACX,KAAK,IAAI,CAAC;QACV,KAAK,SAAS;YACZ,OAAO,KAAK,CAAC;QACf;YACE,0CAA0C;YAC1C,OAAO,IAAI,CAAC;IAChB,CAAC;AACH,CAAC;AAED,SAAS,cAAc,CAAC,IAAmB,EAAE,KAAoB;IAC/D,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACnD,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;QACxB,IAAI,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC;YAAE,OAAO,IAAI,CAAC,OAAO,CAAC;IACnD,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,SAAS,aAAa,CAAC,IAAmB;IACxC,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,KAAK,OAAO,CAAC,EAAE,OAAO,CAAC;AAC/D,CAAC;AAED,SAAS,aAAa,CAAC,KAAoB;IACzC,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,KAAK,MAAM,CAAC,EAAE,OAAO,CAAC;AAC/D,CAAC;AAED;;;GAGG;AACH,SAAS,gBAAgB,CAAC,KAAoB;IAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACtB,IAAI,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC;YAAE,OAAO,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC;IACjE,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,SAAS,QAAQ,CAAI,GAAQ,EAAE,GAAW;IACxC,MAAM,IAAI,GAAG,GAAG,CAAC,KAAK,EAAE,CAAC;IACzB,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IACpB,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,SAAS,CAAC,IAAmB,EAAE,KAAoB;IAC1D,OAAO;QACL,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC;QAChC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC;KACnC,CAAC;AACJ,CAAC;AAQD,SAAS,SAAS,CAAC,GAAa;IAC9B,OAAO,GAAG,CAAC,IAAI,IAAI,GAAG,CAAC,MAAM,CAAC;AAChC,CAAC;AAED,SAAS,KAAK,CAAC,IAAmB,EAAE,KAAoB,EAAE,GAAa;IACrE,GAAG,CAAC,IAAI,EAAE,CAAC;IACX,IAAI,SAAS,CAAC,GAAG,CAAC;QAAE,OAAO,SAAS,CAAC;IAErC,MAAM,MAAM,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC;IAChC,MAAM,MAAM,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;IACjC,MAAM,IAAI,GAAG,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAEvC,kDAAkD;IAClD,MAAM,YAAY,GAAG,cAAc,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACpD,IAAI,YAAY,EAAE,CAAC;QACjB,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,gBAAgB,EAAE,YAAY,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;IAC7F,CAAC;IAED,8CAA8C;IAC9C,MAAM,UAAU,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC;IACzC,IAAI,UAAU,EAAE,CAAC;QACf,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,gBAAgB,EAAE,UAAU,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;IAC5F,CAAC;IAED,4CAA4C;IAC5C,MAAM,QAAQ,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC;IACvC,IAAI,QAAQ,EAAE,CAAC;QACb,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,gBAAgB,EAAE,QAAQ,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;IACzF,CAAC;IAED,2DAA2D;IAC3D,qEAAqE;IACrE,uEAAuE;IAEvE,+BAA+B;IAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACvB,IAAI,IAAI,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;YACrF,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACnC,MAAM,IAAI,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YACjC,MAAM,IAAI,GAAG,CAAC,EAAE,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,IAAA,sBAAU,EAAC,KAAK,CAAC,EAAE,EAAE,GAAG,MAAM,CAAC,CAAC;YACrE,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;YACnC,IAAI,CAAC,GAAG;gBAAE,OAAO,SAAS,CAAC;YAC3B,OAAO;gBACL,IAAI;gBACJ,IAAI,EAAE,MAAM;gBACZ,gBAAgB,EAAE,IAAI,CAAC,OAAO;gBAC9B,QAAQ,EAAE,CAAC,GAAG,CAAC;gBACf,MAAM,EAAE,GAAG,CAAC,MAAM;aACnB,CAAC;QACJ,CAAC;IACH,CAAC;IAED,+BAA+B;IAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACvB,IAAI,IAAI,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;YACrF,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACnC,MAAM,IAAI,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YACjC,MAAM,IAAI,GAAG,CAAC,EAAE,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,IAAA,sBAAU,EAAC,KAAK,CAAC,EAAE,EAAE,GAAG,MAAM,CAAC,CAAC;YACrE,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;YACnC,IAAI,CAAC,GAAG;gBAAE,OAAO,SAAS,CAAC;YAC3B,OAAO;gBACL,IAAI;gBACJ,IAAI,EAAE,MAAM;gBACZ,gBAAgB,EAAE,IAAI,CAAC,OAAO;gBAC9B,QAAQ,EAAE,CAAC,GAAG,CAAC;gBACf,MAAM,EAAE,GAAG,CAAC,MAAM;aACnB,CAAC;QACJ,CAAC;IACH,CAAC;IAED,mCAAmC;IACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACvB,IACE,IAAI;YACJ,IAAI,CAAC,OAAO,CAAC,IAAI,KAAK,KAAK;YAC3B,IAAI,CAAC,OAAO,CAAC,IAAI;YACjB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;YACpB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EACpB,CAAC;YACD,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC/B,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC/B,MAAM,IAAI,GAAG;gBACX,EAAE,OAAO,EAAE,CAAC,EAAE,GAAG,EAAE,IAAA,sBAAU,EAAC,CAAC,CAAC,EAAE;gBAClC,EAAE,OAAO,EAAE,CAAC,EAAE,GAAG,EAAE,IAAA,sBAAU,EAAC,CAAC,CAAC,EAAE;gBAClC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC;aACvB,CAAC;YACF,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;YACrC,IAAI,CAAC,GAAG;gBAAE,OAAO,SAAS,CAAC;YAC3B,OAAO;gBACL,IAAI;gBACJ,IAAI,EAAE,MAAM;gBACZ,gBAAgB,EAAE,IAAI,CAAC,OAAO;gBAC9B,QAAQ,EAAE,CAAC,GAAG,CAAC;gBACf,MAAM,EAAE,GAAG,CAAC,MAAM;aACnB,CAAC;QACJ,CAAC;IACH,CAAC;IAED,kCAAkC;IAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACvB,IACE,IAAI;YACJ,IAAI,CAAC,OAAO,CAAC,IAAI,KAAK,IAAI;YAC1B,IAAI,CAAC,OAAO,CAAC,IAAI;YACjB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;YACpB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EACpB,CAAC;YACD,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC/B,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC/B,MAAM,IAAI,GAAG;gBACX,EAAE,OAAO,EAAE,CAAC,EAAE,GAAG,EAAE,IAAA,sBAAU,EAAC,CAAC,CAAC,EAAE;gBAClC,EAAE,OAAO,EAAE,CAAC,EAAE,GAAG,EAAE,IAAA,sBAAU,EAAC,CAAC,CAAC,EAAE;gBAClC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC;aACvB,CAAC;YACF,MAAM,GAAG,GAAG,KAAK,CAAC,MAAM,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;YACrC,IAAI,CAAC,GAAG;gBAAE,OAAO,SAAS,CAAC;YAC3B,OAAO;gBACL,IAAI;gBACJ,IAAI,EAAE,KAAK;gBACX,gBAAgB,EAAE,IAAI,CAAC,OAAO;gBAC9B,QAAQ,EAAE,CAAC,GAAG,CAAC;gBACf,MAAM,EAAE,GAAG,CAAC,MAAM;aACnB,CAAC;QACJ,CAAC;IACH,CAAC;IAED,mCAAmC;IACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACvB,IACE,IAAI;YACJ,IAAI,CAAC,OAAO,CAAC,IAAI,KAAK,SAAS;YAC/B,IAAI,CAAC,OAAO,CAAC,IAAI;YACjB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;YACpB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EACpB,CAAC;YACD,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC/B,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC/B,MAAM,IAAI,GAAG,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,GAAG,EAAE,IAAA,sBAAU,EAAC,CAAC,CAAC,EAAE,EAAE,GAAG,MAAM,CAAC,CAAC;YAC7D,MAAM,IAAI,GAAG,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,GAAG,EAAE,IAAA,sBAAU,EAAC,CAAC,CAAC,EAAE,EAAE,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC;YAC1E,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;YACnC,IAAI,CAAC,GAAG;gBAAE,OAAO,SAAS,CAAC;YAC3B,OAAO;gBACL,IAAI;gBACJ,IAAI,EAAE,MAAM;gBACZ,gBAAgB,EAAE,IAAI,CAAC,OAAO;gBAC9B,QAAQ,EAAE,CAAC,GAAG,CAAC;gBACf,MAAM,EAAE,GAAG,CAAC,MAAM;aACnB,CAAC;QACJ,CAAC;IACH,CAAC;IAED,oDAAoD;IAEpD,6CAA6C;IAC7C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACvB,IACE,IAAI;YACJ,IAAI,CAAC,OAAO,CAAC,IAAI,KAAK,KAAK;YAC3B,IAAI,CAAC,OAAO,CAAC,IAAI;YACjB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;YACpB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EACpB,CAAC;YACD,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC/B,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC/B,MAAM,KAAK,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YAClC,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,GAAG,EAAE,IAAA,sBAAU,EAAC,CAAC,CAAC,EAAE,EAAE,GAAG,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC;YAChF,IAAI,CAAC,IAAI;gBAAE,OAAO,SAAS,CAAC;YAC5B,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,GAAG,EAAE,IAAA,sBAAU,EAAC,CAAC,CAAC,EAAE,EAAE,GAAG,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC;YAChF,IAAI,CAAC,IAAI;gBAAE,OAAO,SAAS,CAAC;YAC5B,OAAO;gBACL,IAAI;gBACJ,IAAI,EAAE,MAAM;gBACZ,gBAAgB,EAAE,IAAI,CAAC,OAAO;gBAC9B,QAAQ,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;gBACtB,MAAM,EAAE,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM;aACnC,CAAC;QACJ,CAAC;IACH,CAAC;IAED,4CAA4C;IAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACvB,IACE,IAAI;YACJ,IAAI,CAAC,OAAO,CAAC,IAAI,KAAK,IAAI;YAC1B,IAAI,CAAC,OAAO,CAAC,IAAI;YACjB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;YACpB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EACpB,CAAC;YACD,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC/B,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC/B,MAAM,KAAK,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YAClC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,GAAG,EAAE,IAAA,sBAAU,EAAC,CAAC,CAAC,EAAE,EAAE,GAAG,KAAK,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;YAChF,IAAI,CAAC,IAAI;gBAAE,OAAO,SAAS,CAAC;YAC5B,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,GAAG,EAAE,IAAA,sBAAU,EAAC,CAAC,CAAC,EAAE,EAAE,GAAG,KAAK,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;YAChF,IAAI,CAAC,IAAI;gBAAE,OAAO,SAAS,CAAC;YAC5B,OAAO;gBACL,IAAI;gBACJ,IAAI,EAAE,KAAK;gBACX,gBAAgB,EAAE,IAAI,CAAC,OAAO;gBAC9B,QAAQ,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;gBACtB,MAAM,EAAE,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM;aACnC,CAAC;QACJ,CAAC;IACH,CAAC;IAED,6CAA6C;IAC7C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACvB,IACE,IAAI;YACJ,IAAI,CAAC,OAAO,CAAC,IAAI,KAAK,SAAS;YAC/B,IAAI,CAAC,OAAO,CAAC,IAAI;YACjB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;YACpB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EACpB,CAAC;YACD,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC/B,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC/B,MAAM,KAAK,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YAClC,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,GAAG,EAAE,IAAA,sBAAU,EAAC,CAAC,CAAC,EAAE,EAAE,GAAG,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC;YAChF,IAAI,CAAC,IAAI;gBAAE,OAAO,SAAS,CAAC;YAC5B,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,GAAG,EAAE,IAAA,sBAAU,EAAC,CAAC,CAAC,EAAE,EAAE,GAAG,KAAK,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;YAChF,IAAI,CAAC,IAAI;gBAAE,OAAO,SAAS,CAAC;YAC5B,OAAO;gBACL,IAAI;gBACJ,IAAI,EAAE,MAAM;gBACZ,gBAAgB,EAAE,IAAI,CAAC,OAAO;gBAC9B,QAAQ,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;gBACtB,MAAM,EAAE,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM;aACnC,CAAC;QACJ,CAAC;IACH,CAAC;IAED,qEAAqE;IACrE,qEAAqE;IACrE,qCAAqC;IACrC,MAAM,QAAQ,GAAG,gBAAgB,CAAC,MAAM,CAAC,CAAC;IAC1C,MAAM,QAAQ,GAAG,gBAAgB,CAAC,MAAM,CAAC,CAAC;IAC1C,IAAI,CAAC,QAAQ,IAAI,CAAC,QAAQ,EAAE,CAAC;QAC3B,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC;IAC/C,CAAC;IAED,sEAAsE;IACtE,sEAAsE;IACtE,oEAAoE;IACpE,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;GAGG;AACH,SAAgB,YAAY,CAAC,GAAY,EAAE,UAA+B,EAAE;IAC1E,MAAM,QAAQ,GAAG,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,0BAAc,CAAC,CAAC;IAC9C,MAAM,SAAS,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,0BAAc,CAAC,CAAC;IAChD,MAAM,GAAG,GAAa,EAAE,MAAM,EAAE,OAAO,CAAC,MAAM,IAAI,KAAK,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC;IACnE,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,OAAO,CAAC,SAAS,CAAC,EAAE,GAAG,CAAC,CAAC;IAC/D,IAAI,CAAC,IAAI;QAAE,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC;IACtC,OAAO,EAAE,QAAQ,EAAE,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;AAChD,CAAC;AAED;;GAEG;AACH,SAAgB,YAAY,CAAC,OAAgB,EAAE,UAA+B,EAAE;IAC9E,OAAO,YAAY,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,OAAO,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;AAC/D,CAAC"}

package/dist/profiles/sequent-g3/types.d.ts

@@ -0,0 +1,30 @@
+import { Formula } from '../../types';
+/**
+ * Reglas del calculo G3 (proposicional clasico).
+ *
+ * - `axiom`        : Γ, A ⊢ A, Δ   (A atomico)
+ * - `andL` / `andR`: descomposicion de ∧ a izquierda / derecha
+ * - `orL`  / `orR` : descomposicion de ∨
+ * - `impL` / `impR`: descomposicion de →
+ * - `notL` / `notR`: descomposicion de ¬
+ * - `falseL`       : Γ, ⊥ ⊢ Δ es axioma
+ * - `trueR`        : Γ ⊢ ⊤, Δ es axioma
+ */
+export type SequentRule = 'axiom' | 'falseL' | 'trueR' | 'andL' | 'andR' | 'orL' | 'orR' | 'impL' | 'impR' | 'notL' | 'notR';
+export interface Sequent {
+    left: Formula[];
+    right: Formula[];
+}
+export interface ProofTree {
+    goal: Sequent;
+    rule?: SequentRule;
+    /** Formula principal a la que se aplica la regla. */
+    principalFormula?: Formula;
+    premises: ProofTree[];
+    closed: boolean;
+}
+export interface ProveResult {
+    provable: boolean;
+    proof?: ProofTree;
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/profiles/sequent-g3/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../src/profiles/sequent-g3/types.ts"],"names":[],"mappings":"AAcA,OAAO,EAAE,OAAO,EAAE,MAAM,aAAa,CAAC;AAEtC;;;;;;;;;;GAUG;AACH,MAAM,MAAM,WAAW,GACnB,OAAO,GACP,QAAQ,GACR,OAAO,GACP,MAAM,GACN,MAAM,GACN,KAAK,GACL,KAAK,GACL,MAAM,GACN,MAAM,GACN,MAAM,GACN,MAAM,CAAC;AAEX,MAAM,WAAW,OAAO;IACtB,IAAI,EAAE,OAAO,EAAE,CAAC;IAChB,KAAK,EAAE,OAAO,EAAE,CAAC;CAClB;AAED,MAAM,WAAW,SAAS;IACxB,IAAI,EAAE,OAAO,CAAC;IACd,IAAI,CAAC,EAAE,WAAW,CAAC;IACnB,qDAAqD;IACrD,gBAAgB,CAAC,EAAE,OAAO,CAAC;IAC3B,QAAQ,EAAE,SAAS,EAAE,CAAC;IACtB,MAAM,EAAE,OAAO,CAAC;CACjB;AAED,MAAM,WAAW,WAAW;IAC1B,QAAQ,EAAE,OAAO,CAAC;IAClB,KAAK,CAAC,EAAE,SAAS,CAAC;CACnB"}

package/dist/profiles/sequent-g3/types.js

@@ -0,0 +1,16 @@
+"use strict";
+// ============================================================
+// G3 Sequent Calculus — Types
+// ============================================================
+//
+// Calculo de secuentes G3 (Gentzen reformulado por Kleene) para
+// logica proposicional clasica. Sus reglas son invertibles, las
+// premisas son sub-formulas de la conclusion y el sistema admite
+// eliminacion del corte (cut elimination), por lo que la busqueda
+// hacia atras es completa y terminante.
+//
+// Convencion: un secuente Γ ⊢ Δ se representa con `left` y `right`
+// como multisets (arrays con duplicados permitidos). El orden no
+// importa logicamente pero se preserva para reproducibilidad.
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=types.js.map

package/dist/profiles/sequent-g3/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../src/profiles/sequent-g3/types.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,8BAA8B;AAC9B,+DAA+D;AAC/D,EAAE;AACF,gEAAgE;AAChE,gEAAgE;AAChE,iEAAiE;AACjE,kEAAkE;AAClE,wCAAwC;AACxC,EAAE;AACF,mEAAmE;AACnE,iEAAiE;AACjE,8DAA8D"}

package/dist/runtime/countermodel-min/index.d.ts

@@ -0,0 +1,3 @@
+export { minimizeCountermodel } from './minimize';
+export type { CountermodelMinOptions, CountermodelMinAlgorithm, CountermodelAssignment, MinimalCountermodel, } from './types';
+//# sourceMappingURL=index.d.ts.map

package/dist/runtime/countermodel-min/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/runtime/countermodel-min/index.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,oBAAoB,EAAE,MAAM,YAAY,CAAC;AAClD,YAAY,EACV,sBAAsB,EACtB,wBAAwB,EACxB,sBAAsB,EACtB,mBAAmB,GACpB,MAAM,SAAS,CAAC"}

package/dist/runtime/countermodel-min/index.js

@@ -0,0 +1,9 @@
+"use strict";
+// ============================================================
+// ST Countermodel Minimization — Barrel
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.minimizeCountermodel = void 0;
+var minimize_1 = require("./minimize");
+Object.defineProperty(exports, "minimizeCountermodel", { enumerable: true, get: function () { return minimize_1.minimizeCountermodel; } });
+//# sourceMappingURL=index.js.map

package/dist/runtime/countermodel-min/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/runtime/countermodel-min/index.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,wCAAwC;AACxC,+DAA+D;;;AAE/D,uCAAkD;AAAzC,gHAAA,oBAAoB,OAAA"}

package/dist/runtime/countermodel-min/minimize.d.ts

@@ -0,0 +1,17 @@
+import type { Formula } from '../../types';
+import type { CountermodelMinOptions, MinimalCountermodel } from './types';
+/**
+ * Minimiza un contramodelo: devuelve el subconjunto más pequeño de
+ * asignaciones que aún hace `evaluator(asg) === false` para toda
+ * completación de las variables removidas.
+ *
+ * @param _formula  AST de la fórmula (queda en la firma para
+ *                  compatibilidad y futura especialización; el motor
+ *                  trata el evaluator como caja negra).
+ * @param fullCounter Contramodelo total: asignación que falsifica F.
+ * @param evaluator Función que devuelve `true` si la fórmula es válida
+ *                  bajo la asignación total dada.
+ * @param opts      Algoritmo y maxSteps.
+ */
+export declare function minimizeCountermodel(_formula: Formula, fullCounter: Record<string, boolean>, evaluator: (asg: Record<string, boolean>) => boolean, opts?: CountermodelMinOptions): MinimalCountermodel;
+//# sourceMappingURL=minimize.d.ts.map

package/dist/runtime/countermodel-min/minimize.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"minimize.d.ts","sourceRoot":"","sources":["../../../src/runtime/countermodel-min/minimize.ts"],"names":[],"mappings":"AAgCA,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,aAAa,CAAC;AAC3C,OAAO,KAAK,EACV,sBAAsB,EACtB,mBAAmB,EAEpB,MAAM,SAAS,CAAC;AAWjB;;;;;;;;;;;;GAYG;AACH,wBAAgB,oBAAoB,CAClC,QAAQ,EAAE,OAAO,EACjB,WAAW,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EACpC,SAAS,EAAE,CAAC,GAAG,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,KAAK,OAAO,EACpD,IAAI,GAAE,sBAA2B,GAChC,mBAAmB,CAwDrB"}

package/dist/runtime/countermodel-min/minimize.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"minimize.js","sourceRoot":"","sources":["../../../src/runtime/countermodel-min/minimize.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,wCAAwC;AACxC,+DAA+D;AAC/D,EAAE;AACF,kEAAkE;AAClE,oEAAoE;AACpE,qCAAqC;AACrC,EAAE;AACF,gCAAgC;AAChC,oEAAoE;AACpE,qEAAqE;AACrE,uCAAuC;AACvC,EAAE;AACF,gBAAgB;AAChB,mEAAmE;AACnE,4DAA4D;AAC5D,qEAAqE;AACrE,kEAAkE;AAClE,qEAAqE;AACrE,wDAAwD;AACxD,EAAE;AACF,cAAc;AACd,qEAAqE;AACrE,6DAA6D;AAC7D,oEAAoE;AACpE,sEAAsE;AACtE,gEAAgE;AAChE,EAAE;AACF,uEAAuE;AACvE,wBAAwB;AACxB,+DAA+D;;AA+B/D,oDA6DC;AAnFD,MAAM,iBAAiB,GAAG,OAAO,CAAC;AAClC;;;;;GAKG;AACH,MAAM,cAAc,GAAG,EAAE,CAAC;AAE1B;;;;;;;;;;;;GAYG;AACH,SAAgB,oBAAoB,CAClC,QAAiB,EACjB,WAAoC,EACpC,SAAoD,EACpD,OAA+B,EAAE;IAEjC,MAAM,SAAS,GAA6B,IAAI,CAAC,SAAS,IAAI,aAAa,CAAC;IAC5E,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,IAAI,iBAAiB,CAAC;IAEpD,MAAM,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,IAAI,EAAE,CAAC;IAChD,MAAM,KAAK,GAAmB;QAC5B,WAAW;QACX,OAAO;QACP,SAAS;QACT,QAAQ;QACR,UAAU,EAAE,CAAC;QACb,KAAK,EAAE,IAAI,GAAG,EAAE;KACjB,CAAC;IAEF,iEAAiE;IACjE,iDAAiD;IACjD,KAAK,CAAC,UAAU,EAAE,CAAC;IACnB,IAAI,SAAS,CAAC,EAAE,GAAG,WAAW,EAAE,CAAC,EAAE,CAAC;QAClC,OAAO;YACL,WAAW,EAAE,aAAa,CAAC,WAAW,EAAE,OAAO,CAAC;YAChD,IAAI,EAAE,OAAO,CAAC,MAAM;YACpB,OAAO,EAAE,EAAE;YACX,UAAU,EAAE,KAAK,CAAC,UAAU;SAC7B,CAAC;IACJ,CAAC;IAED,IAAI,IAAc,CAAC;IACnB,QAAQ,SAAS,EAAE,CAAC;QAClB,KAAK,eAAe;YAClB,IAAI,GAAG,kBAAkB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;YAC1C,MAAM;QACR,KAAK,eAAe;YAClB,IAAI,GAAG,oBAAoB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;YAC5C,MAAM;QACR,KAAK,aAAa;YAChB,IAAI,GAAG,kBAAkB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;YAC1C,MAAM;QACR,sBAAsB;QACtB;YACE,MAAM,IAAI,KAAK,CAAC,0BAA0B,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;IACnE,CAAC;IAED,iEAAiE;IACjE,IAAI,SAAS,KAAK,eAAe,EAAE,CAAC;QAClC,IAAI,GAAG,kBAAkB,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IACzC,CAAC;IAED,IAAI,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,CAAC;IAC3B,MAAM,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IAEhE,OAAO;QACL,WAAW,EAAE,aAAa,CAAC,WAAW,EAAE,IAAI,CAAC;QAC7C,IAAI,EAAE,IAAI,CAAC,MAAM;QACjB,OAAO;QACP,UAAU,EAAE,KAAK,CAAC,UAAU;KAC7B,CAAC;AACJ,CAAC;AAeD;;;;GAIG;AACH,SAAS,YAAY,CAAC,KAAqB,EAAE,IAAc;IACzD,IAAI,KAAK,CAAC,UAAU,IAAI,KAAK,CAAC,QAAQ;QAAE,OAAO,KAAK,CAAC;IAErD,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,CAAC;IACvC,MAAM,GAAG,GAAG,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACjC,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACpC,IAAI,MAAM,KAAK,SAAS;QAAE,OAAO,MAAM,CAAC;IAExC,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,CAAC;IACjC,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAE1D,MAAM,MAAM,GACV,OAAO,CAAC,MAAM,IAAI,cAAc;QAC9B,CAAC,CAAC,eAAe,CAAC,KAAK,EAAE,UAAU,EAAE,OAAO,CAAC;QAC7C,CAAC,CAAC,cAAc,CAAC,KAAK,EAAE,UAAU,EAAE,OAAO,CAAC,CAAC;IAEjD,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;IAC7B,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;GAIG;AACH,SAAS,eAAe,CAAC,KAAqB,EAAE,IAAc,EAAE,OAAiB;IAC/E,MAAM,KAAK,GAAG,CAAC,IAAI,OAAO,CAAC,MAAM,CAAC;IAClC,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,KAAK,EAAE,IAAI,EAAE,EAAE,CAAC;QACxC,IAAI,KAAK,CAAC,UAAU,IAAI,KAAK,CAAC,QAAQ;YAAE,OAAO,KAAK,CAAC;QACrD,MAAM,GAAG,GAA4B,EAAE,CAAC;QACxC,KAAK,MAAM,CAAC,IAAI,IAAI;YAAE,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,WAAW,CAAC,CAAC,CAAE,CAAC;QACrD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAC5C,CAAC;QACD,KAAK,CAAC,UAAU,EAAE,CAAC;QACnB,IAAI,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC;YACzB,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;GAIG;AACH,SAAS,cAAc,CAAC,KAAqB,EAAE,IAAc,EAAE,OAAiB;IAC9E,KAAK,MAAM,IAAI,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC;QACjC,IAAI,KAAK,CAAC,UAAU,IAAI,KAAK,CAAC,QAAQ;YAAE,OAAO,KAAK,CAAC;QACrD,MAAM,GAAG,GAA4B,EAAE,CAAC;QACxC,KAAK,MAAM,CAAC,IAAI,IAAI;YAAE,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,WAAW,CAAC,CAAC,CAAE,CAAC;QACrD,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;YACxB,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;QAC/D,CAAC;QACD,KAAK,CAAC,UAAU,EAAE,CAAC;QACnB,IAAI,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC;YAAE,OAAO,KAAK,CAAC;IACzC,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,gEAAgE;AAEhE;;;;;;GAMG;AACH,SAAS,kBAAkB,CAAC,KAAqB,EAAE,IAAc;IAC/D,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,CAAC;IAC/B,IAAI,OAAO,GAAG,IAAI,CAAC;IACnB,OAAO,OAAO,IAAI,KAAK,CAAC,UAAU,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC;QACpD,OAAO,GAAG,KAAK,CAAC;QAChB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC;YAC7B,IAAI,KAAK,CAAC,UAAU,IAAI,KAAK,CAAC,QAAQ;gBAAE,MAAM;YAC9C,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;YAC9C,IAAI,YAAY,CAAC,KAAK,EAAE,SAAS,CAAC,EAAE,CAAC;gBACnC,IAAI,GAAG,SAAS,CAAC;gBACjB,OAAO,GAAG,IAAI,CAAC;YACjB,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;GAGG;AACH,SAAS,oBAAoB,CAAC,KAAqB,EAAE,IAAc;IACjE,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,CAAC;IAC/B,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IAElC,MAAM,SAAS,GAAG,CAAC,OAAiB,EAAY,EAAE;QAChD,IAAI,OAAO,CAAC,MAAM,IAAI,CAAC,IAAI,KAAK,CAAC,UAAU,IAAI,KAAK,CAAC,QAAQ;YAAE,OAAO,OAAO,CAAC;QAE9E,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC3C,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QACnC,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAEjC,IAAI,YAAY,CAAC,KAAK,EAAE,IAAI,CAAC;YAAE,OAAO,SAAS,CAAC,IAAI,CAAC,CAAC;QACtD,IAAI,YAAY,CAAC,KAAK,EAAE,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC,KAAK,CAAC,CAAC;QAExD,MAAM,WAAW,GAAG,kBAAkB,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;QAC3D,MAAM,YAAY,GAAG,kBAAkB,CAAC,KAAK,EAAE,KAAK,EAAE,WAAW,CAAC,CAAC;QACnE,OAAO,CAAC,GAAG,WAAW,EAAE,GAAG,YAAY,CAAC,CAAC;IAC3C,CAAC,CAAC;IAEF,IAAI,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;IACvB,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,kBAAkB,CAAC,KAAqB,EAAE,MAAgB,EAAE,KAAe;IAClF,IAAI,MAAM,CAAC,MAAM,IAAI,CAAC,IAAI,KAAK,CAAC,UAAU,IAAI,KAAK,CAAC,QAAQ;QAAE,OAAO,MAAM,CAAC;IAE5E,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC1C,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IAClC,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAEhC,IAAI,YAAY,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI,EAAE,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC;QAC7C,OAAO,kBAAkB,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;IAChD,CAAC;IACD,IAAI,YAAY,CAAC,KAAK,EAAE,CAAC,GAAG,KAAK,EAAE,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC;QAC9C,OAAO,kBAAkB,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;IACjD,CAAC;IACD,MAAM,WAAW,GAAG,kBAAkB,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,GAAG,KAAK,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;IAC1E,MAAM,YAAY,GAAG,kBAAkB,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,GAAG,WAAW,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;IAClF,OAAO,CAAC,GAAG,WAAW,EAAE,GAAG,YAAY,CAAC,CAAC;AAC3C,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,kBAAkB,CAAC,KAAqB,EAAE,IAAc;IAC/D,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,CAAC;IAC5B,IAAI,CAAC,GAAG,CAAC,CAAC;IAEV,OAAO,CAAC,CAAC,MAAM,IAAI,CAAC,IAAI,KAAK,CAAC,UAAU,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC;QAC1D,MAAM,MAAM,GAAG,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC/B,IAAI,OAAO,GAAG,KAAK,CAAC;QAEpB,kBAAkB;QAClB,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,IAAI,KAAK,CAAC,UAAU,IAAI,KAAK,CAAC,QAAQ;gBAAE,MAAM;YAC9C,IAAI,YAAY,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,CAAC;gBAC/B,CAAC,GAAG,KAAK,CAAC;gBACV,CAAC,GAAG,CAAC,CAAC;gBACN,OAAO,GAAG,IAAI,CAAC;gBACf,MAAM;YACR,CAAC;QACH,CAAC;QAED,IAAI,CAAC,OAAO,EAAE,CAAC;YACb,sBAAsB;YACtB,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;gBAC3B,IAAI,KAAK,CAAC,UAAU,IAAI,KAAK,CAAC,QAAQ;oBAAE,MAAM;gBAC9C,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC;gBAChC,MAAM,UAAU,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBACrD,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;oBAAE,SAAS;gBACtC,IAAI,YAAY,CAAC,KAAK,EAAE,UAAU,CAAC,EAAE,CAAC;oBACpC,CAAC,GAAG,UAAU,CAAC;oBACf,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;oBACvB,OAAO,GAAG,IAAI,CAAC;oBACf,MAAM;gBACR,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,CAAC,OAAO,EAAE,CAAC;YACb,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM;gBAAE,MAAM;YACzB,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;QAChC,CAAC;IACH,CAAC;IAED,OAAO,CAAC,CAAC;AACX,CAAC;AAED,gEAAgE;AAEhE,0DAA0D;AAC1D,SAAS,SAAS,CAAC,GAAa,EAAE,CAAS;IACzC,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IACpD,MAAM,GAAG,GAAe,EAAE,CAAC;IAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC;QAC1C,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;IACnC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,4EAA4E;AAC5E,SAAS,aAAa,CACpB,WAAoC,EACpC,IAAc;IAEd,MAAM,GAAG,GAA4B,EAAE,CAAC;IACxC,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;QACpC,GAAG,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAE,CAAC;IAC3B,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC"}

package/dist/runtime/countermodel-min/types.d.ts

@@ -0,0 +1,40 @@
+/**
+ * Algoritmo de minimización a usar.
+ *
+ * - `one-at-a-time`: O(n) pruebas. Por cada variable intenta removerla;
+ *   si la fórmula sigue siendo falsada (para ambas completaciones de la
+ *   variable removida), la elimina permanentemente.
+ * - `binary-search`: O(n log n). Divide el conjunto de assignments en
+ *   mitades y trata de descartar la mitad completa de una vez.
+ * - `delta-debug`: O(n log n) en el peor caso, mucho más rápido en la
+ *   práctica. Granularidad creciente al estilo Zeller 1999. Empieza
+ *   removiendo bloques grandes y se reduce a granularidad 1.
+ */
+export type CountermodelMinAlgorithm = 'delta-debug' | 'binary-search' | 'one-at-a-time';
+export interface CountermodelMinOptions {
+    /** Algoritmo a utilizar. Default: `delta-debug`. */
+    algorithm?: CountermodelMinAlgorithm;
+    /** Tope superior de iteraciones (llamadas a evaluator). Default: 10_000. */
+    maxSteps?: number;
+}
+/**
+ * Asignación final: para cada variable que queda en el contramodelo
+ * mínimo, guardamos su valor.
+ *
+ * Para perfiles clásicos los valores son `boolean`. Se permite también
+ * `'T'`, `'F'`, `'both'`, `'neither'` para perfiles paraconsistentes
+ * (Belnap) — la API queda abierta a futuro aunque el algoritmo actual
+ * sólo opera sobre `boolean`.
+ */
+export type CountermodelAssignment = Record<string, boolean | 'T' | 'F' | 'both' | 'neither'>;
+export interface MinimalCountermodel {
+    /** Asignación mínima (solo variables relevantes). */
+    assignments: CountermodelAssignment;
+    /** Cantidad de variables en `assignments`. */
+    size: number;
+    /** Variables que el algoritmo eliminó (ordenadas alfabéticamente). */
+    removed: string[];
+    /** Iteraciones (llamadas a `evaluator`) consumidas. */
+    iterations: number;
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/runtime/countermodel-min/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../src/runtime/countermodel-min/types.ts"],"names":[],"mappings":"AAIA;;;;;;;;;;;GAWG;AACH,MAAM,MAAM,wBAAwB,GAAG,aAAa,GAAG,eAAe,GAAG,eAAe,CAAC;AAEzF,MAAM,WAAW,sBAAsB;IACrC,oDAAoD;IACpD,SAAS,CAAC,EAAE,wBAAwB,CAAC;IACrC,4EAA4E;IAC5E,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB;AAED;;;;;;;;GAQG;AACH,MAAM,MAAM,sBAAsB,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,GAAG,GAAG,GAAG,GAAG,GAAG,MAAM,GAAG,SAAS,CAAC,CAAC;AAE9F,MAAM,WAAW,mBAAmB;IAClC,qDAAqD;IACrD,WAAW,EAAE,sBAAsB,CAAC;IACpC,8CAA8C;IAC9C,IAAI,EAAE,MAAM,CAAC;IACb,sEAAsE;IACtE,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,uDAAuD;IACvD,UAAU,EAAE,MAAM,CAAC;CACpB"}

package/dist/runtime/countermodel-min/types.js

@@ -0,0 +1,6 @@
+"use strict";
+// ============================================================
+// ST Countermodel Minimization — Tipos públicos
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=types.js.map

package/dist/runtime/countermodel-min/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../src/runtime/countermodel-min/types.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,gDAAgD;AAChD,+DAA+D"}

package/dist/runtime/mus/extract.d.ts

@@ -0,0 +1,34 @@
+import type { MUSOptions, MUSResult, SATOracle, AssumptionSolver } from './types';
+/**
+ * Extrae un MUS (Minimal Unsatisfiable Subset) del conjunto unsat
+ * `clauses` usando el oráculo SAT provisto.
+ *
+ * Convenciones:
+ *   - Las cláusulas son arrays de literales enteros estilo DIMACS
+ *     (positivo / negativo). El motor no inspecciona la semántica;
+ *     todo lo delega al `satOracle`.
+ *   - El conjunto retornado en `mus` son índices sobre `clauses`.
+ *   - Si `clauses` ES satisfacible, devolvemos `mus = []` (no hay
+ *     MUS posible).
+ *   - Determinismo: orden numérico ascendente en todos los recorridos.
+ */
+export declare function extractMUS(clauses: number[][], satOracle: SATOracle, opts?: MUSOptions): MUSResult;
+/**
+ * Variante para SAT solvers incrementales con assumptions.
+ *
+ * El patrón típico es:
+ *   - Por cada cláusula original `C_i`, añadir un selector literal
+ *     `s_i` y convertirla en `C_i ∨ ¬s_i` (la cláusula está "off"
+ *     cuando `s_i = false`).
+ *   - Para "activar" un subset, pasar las correspondientes `s_i` como
+ *     assumptions positivas.
+ *   - Cuando el problema es unsat, el solver devuelve
+ *     `failedAssumptions ⊆ assumptions` — el unsat core proyectado
+ *     sobre los selectors.
+ *
+ * Esta función toma el `failedAssumptions` como punto de partida y
+ * lo minimiza con un pase deletion-based usando el mismo solver para
+ * garantizar minimalidad por inclusión.
+ */
+export declare function extractMUSWithSelectors(clauses: number[][], selectors: number[], solver: AssumptionSolver, opts?: MUSOptions): MUSResult;
+//# sourceMappingURL=extract.d.ts.map

package/dist/runtime/mus/extract.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"extract.d.ts","sourceRoot":"","sources":["../../../src/runtime/mus/extract.ts"],"names":[],"mappings":"AAkBA,OAAO,KAAK,EAAgB,UAAU,EAAE,SAAS,EAAE,SAAS,EAAE,gBAAgB,EAAE,MAAM,SAAS,CAAC;AAuHhG;;;;;;;;;;;;GAYG;AACH,wBAAgB,UAAU,CACxB,OAAO,EAAE,MAAM,EAAE,EAAE,EACnB,SAAS,EAAE,SAAS,EACpB,IAAI,GAAE,UAAe,GACpB,SAAS,CA8CX;AAID;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,uBAAuB,CACrC,OAAO,EAAE,MAAM,EAAE,EAAE,EACnB,SAAS,EAAE,MAAM,EAAE,EACnB,MAAM,EAAE,gBAAgB,EACxB,IAAI,GAAE,UAAe,GACpB,SAAS,CAsDX"}