@stevenvo780/st-lang 4.11.0 → 4.12.0

package/dist/proof-systems/fol-prover-advanced/unify.js

@@ -0,0 +1,144 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.unify = unify;
+exports.unifyLiterals = unifyLiterals;
+exports.applySubToTerm = applySubToTerm;
+exports.applySubToLiteral = applySubToLiteral;
+exports.termsEqual = termsEqual;
+exports.literalsEqual = literalsEqual;
+/**
+ * Unificación de Robinson con occurs-check. Devuelve la sustitución más
+ * general (mgu) o `null` si no unifica.
+ *
+ * Implementación iterativa sobre una pila de pares (t1,t2) para evitar
+ * recursión profunda en cláusulas grandes.
+ */
+function unify(t1, t2) {
+    const sub = new Map();
+    const stack = [[t1, t2]];
+    while (stack.length > 0) {
+        const pair = stack.pop();
+        if (!pair)
+            break;
+        const a = applySubToTerm(pair[0], sub);
+        const b = applySubToTerm(pair[1], sub);
+        if (termsEqual(a, b))
+            continue;
+        if (a.kind === 'variable') {
+            if (occurs(a.name, b))
+                return null;
+            bindVariable(sub, a.name, b);
+            continue;
+        }
+        if (b.kind === 'variable') {
+            if (occurs(b.name, a))
+                return null;
+            bindVariable(sub, b.name, a);
+            continue;
+        }
+        // Ambos son funciones/constantes
+        if (a.name !== b.name || a.args.length !== b.args.length)
+            return null;
+        for (let i = 0; i < a.args.length; i++) {
+            const ai = a.args[i];
+            const bi = b.args[i];
+            if (ai === undefined || bi === undefined)
+                return null;
+            stack.push([ai, bi]);
+        }
+    }
+    return sub;
+}
+function unifyLiterals(l1, l2) {
+    if (l1.predicate !== l2.predicate)
+        return null;
+    if (l1.args.length !== l2.args.length)
+        return null;
+    const sub = new Map();
+    for (let i = 0; i < l1.args.length; i++) {
+        const a = l1.args[i];
+        const b = l2.args[i];
+        if (a === undefined || b === undefined)
+            return null;
+        const partial = unify(applySubToTerm(a, sub), applySubToTerm(b, sub));
+        if (!partial)
+            return null;
+        for (const [k, v] of partial)
+            sub.set(k, applySubToTerm(v, sub));
+        // Re-aplicar sobre los ya existentes
+        for (const [k, v] of sub)
+            sub.set(k, applySubToTerm(v, partial));
+    }
+    return sub;
+}
+function applySubToTerm(t, sub) {
+    if (t.kind === 'variable') {
+        const bound = sub.get(t.name);
+        if (!bound)
+            return t;
+        // walk recursivo si la sustitución no está totalmente normalizada
+        return applySubToTerm(bound, sub);
+    }
+    return {
+        kind: 'function',
+        name: t.name,
+        args: t.args.map((a) => applySubToTerm(a, sub))
+    };
+}
+function applySubToLiteral(l, sub) {
+    return {
+        negated: l.negated,
+        predicate: l.predicate,
+        args: l.args.map((a) => applySubToTerm(a, sub))
+    };
+}
+function termsEqual(a, b) {
+    if (a.kind !== b.kind)
+        return false;
+    if (a.kind === 'variable' && b.kind === 'variable')
+        return a.name === b.name;
+    if (a.kind === 'function' && b.kind === 'function') {
+        if (a.name !== b.name || a.args.length !== b.args.length)
+            return false;
+        for (let i = 0; i < a.args.length; i++) {
+            const ai = a.args[i];
+            const bi = b.args[i];
+            if (ai === undefined || bi === undefined)
+                return false;
+            if (!termsEqual(ai, bi))
+                return false;
+        }
+        return true;
+    }
+    return false;
+}
+function literalsEqual(a, b) {
+    if (a.negated !== b.negated)
+        return false;
+    if (a.predicate !== b.predicate)
+        return false;
+    if (a.args.length !== b.args.length)
+        return false;
+    for (let i = 0; i < a.args.length; i++) {
+        const ai = a.args[i];
+        const bi = b.args[i];
+        if (ai === undefined || bi === undefined)
+            return false;
+        if (!termsEqual(ai, bi))
+            return false;
+    }
+    return true;
+}
+function occurs(varName, term) {
+    if (term.kind === 'variable')
+        return term.name === varName;
+    return term.args.some((a) => occurs(varName, a));
+}
+function bindVariable(sub, name, value) {
+    // Normalizar sustituciones previas para que no queden indirectas.
+    for (const [k, v] of sub) {
+        sub.set(k, applySubToTerm(v, new Map([[name, value]])));
+    }
+    sub.set(name, value);
+}
+//# sourceMappingURL=unify.js.map

package/dist/proof-systems/fol-prover-advanced/unify.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"unify.js","sourceRoot":"","sources":["../../../src/proof-systems/fol-prover-advanced/unify.ts"],"names":[],"mappings":";;AASA,sBAkCC;AAED,sCAeC;AAED,wCAYC;AAED,8CAMC;AAED,gCAcC;AAED,sCAWC;AA7GD;;;;;;GAMG;AACH,SAAgB,KAAK,CAAC,EAAW,EAAE,EAAW;IAC5C,MAAM,GAAG,GAAiB,IAAI,GAAG,EAAE,CAAC;IACpC,MAAM,KAAK,GAA8B,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;IAEpD,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;QACzB,IAAI,CAAC,IAAI;YAAE,MAAM;QACjB,MAAM,CAAC,GAAG,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QACvC,MAAM,CAAC,GAAG,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QAEvC,IAAI,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC;YAAE,SAAS;QAE/B,IAAI,CAAC,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;YAC1B,IAAI,MAAM,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;gBAAE,OAAO,IAAI,CAAC;YACnC,YAAY,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YAC7B,SAAS;QACX,CAAC;QACD,IAAI,CAAC,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;YAC1B,IAAI,MAAM,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;gBAAE,OAAO,IAAI,CAAC;YACnC,YAAY,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YAC7B,SAAS;QACX,CAAC;QAED,iCAAiC;QACjC,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC,IAAI,CAAC,MAAM;YAAE,OAAO,IAAI,CAAC;QACtE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACrB,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACrB,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,SAAS;gBAAE,OAAO,IAAI,CAAC;YACtD,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;QACvB,CAAC;IACH,CAAC;IAED,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAgB,aAAa,CAAC,EAAc,EAAE,EAAc;IAC1D,IAAI,EAAE,CAAC,SAAS,KAAK,EAAE,CAAC,SAAS;QAAE,OAAO,IAAI,CAAC;IAC/C,IAAI,EAAE,CAAC,IAAI,CAAC,MAAM,KAAK,EAAE,CAAC,IAAI,CAAC,MAAM;QAAE,OAAO,IAAI,CAAC;IACnD,MAAM,GAAG,GAAiB,IAAI,GAAG,EAAE,CAAC;IACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,MAAM,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACrB,MAAM,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACrB,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,SAAS;YAAE,OAAO,IAAI,CAAC;QACpD,MAAM,OAAO,GAAG,KAAK,CAAC,cAAc,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,cAAc,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;QACtE,IAAI,CAAC,OAAO;YAAE,OAAO,IAAI,CAAC;QAC1B,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,OAAO;YAAE,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;QACjE,qCAAqC;QACrC,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,GAAG;YAAE,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC;IACnE,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAgB,cAAc,CAAC,CAAU,EAAE,GAAiB;IAC1D,IAAI,CAAC,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;QAC1B,MAAM,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAC9B,IAAI,CAAC,KAAK;YAAE,OAAO,CAAC,CAAC;QACrB,kEAAkE;QAClE,OAAO,cAAc,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IACpC,CAAC;IACD,OAAO;QACL,IAAI,EAAE,UAAU;QAChB,IAAI,EAAE,CAAC,CAAC,IAAI;QACZ,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,cAAc,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;KAChD,CAAC;AACJ,CAAC;AAED,SAAgB,iBAAiB,CAAC,CAAa,EAAE,GAAiB;IAChE,OAAO;QACL,OAAO,EAAE,CAAC,CAAC,OAAO;QAClB,SAAS,EAAE,CAAC,CAAC,SAAS;QACtB,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,cAAc,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;KAChD,CAAC;AACJ,CAAC;AAED,SAAgB,UAAU,CAAC,CAAU,EAAE,CAAU;IAC/C,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI;QAAE,OAAO,KAAK,CAAC;IACpC,IAAI,CAAC,CAAC,IAAI,KAAK,UAAU,IAAI,CAAC,CAAC,IAAI,KAAK,UAAU;QAAE,OAAO,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,CAAC;IAC7E,IAAI,CAAC,CAAC,IAAI,KAAK,UAAU,IAAI,CAAC,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;QACnD,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC,IAAI,CAAC,MAAM;YAAE,OAAO,KAAK,CAAC;QACvE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACrB,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACrB,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,SAAS;gBAAE,OAAO,KAAK,CAAC;YACvD,IAAI,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,CAAC;gBAAE,OAAO,KAAK,CAAC;QACxC,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAgB,aAAa,CAAC,CAAa,EAAE,CAAa;IACxD,IAAI,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,OAAO;QAAE,OAAO,KAAK,CAAC;IAC1C,IAAI,CAAC,CAAC,SAAS,KAAK,CAAC,CAAC,SAAS;QAAE,OAAO,KAAK,CAAC;IAC9C,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC,IAAI,CAAC,MAAM;QAAE,OAAO,KAAK,CAAC;IAClD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACrB,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACrB,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,SAAS;YAAE,OAAO,KAAK,CAAC;QACvD,IAAI,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,CAAC;YAAE,OAAO,KAAK,CAAC;IACxC,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,MAAM,CAAC,OAAe,EAAE,IAAa;IAC5C,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU;QAAE,OAAO,IAAI,CAAC,IAAI,KAAK,OAAO,CAAC;IAC3D,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC;AACnD,CAAC;AAED,SAAS,YAAY,CAAC,GAAiB,EAAE,IAAY,EAAE,KAAc;IACnE,kEAAkE;IAClE,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,GAAG,EAAE,CAAC;QACzB,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1D,CAAC;IACD,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;AACvB,CAAC"}

package/dist/reasoning/combinatorics/basic-counts.d.ts

@@ -0,0 +1,6 @@
+export declare function factorial(n: number): bigint;
+export declare function binomial(n: number, k: number): bigint;
+export declare function multinomial(n: number, ks: number[]): bigint;
+export declare function permutations(n: number, r: number): bigint;
+export declare function combinations(n: number, r: number): bigint;
+//# sourceMappingURL=basic-counts.d.ts.map

package/dist/reasoning/combinatorics/basic-counts.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"basic-counts.d.ts","sourceRoot":"","sources":["../../../src/reasoning/combinatorics/basic-counts.ts"],"names":[],"mappings":"AAcA,wBAAgB,SAAS,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAU3C;AAED,wBAAgB,QAAQ,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAerD;AAED,wBAAgB,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,GAAG,MAAM,CAmB3D;AAED,wBAAgB,YAAY,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAYzD;AAED,wBAAgB,YAAY,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAEzD"}

package/dist/reasoning/combinatorics/basic-counts.js

@@ -0,0 +1,82 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.factorial = factorial;
+exports.binomial = binomial;
+exports.multinomial = multinomial;
+exports.permutations = permutations;
+exports.combinations = combinations;
+const bigint_helpers_1 = require("./bigint-helpers");
+const FACT_CACHE = [bigint_helpers_1.ONE];
+function ensureFactorialCache(n) {
+    for (let i = FACT_CACHE.length; i <= n; i++) {
+        const prev = FACT_CACHE[i - 1];
+        if (prev === undefined) {
+            throw new Error('factorial cache desincronizado');
+        }
+        FACT_CACHE[i] = prev * BigInt(i);
+    }
+}
+function factorial(n) {
+    if (!Number.isInteger(n) || n < 0) {
+        throw new RangeError(`factorial requiere entero no negativo, recibido ${n}`);
+    }
+    ensureFactorialCache(n);
+    const v = FACT_CACHE[n];
+    if (v === undefined) {
+        throw new Error('factorial cache miss inesperado');
+    }
+    return v;
+}
+function binomial(n, k) {
+    if (!Number.isInteger(n) || !Number.isInteger(k)) {
+        throw new RangeError('binomial requiere enteros');
+    }
+    if (k < 0 || k > n || n < 0) {
+        return bigint_helpers_1.ZERO;
+    }
+    const kk = k > n - k ? n - k : k;
+    let num = bigint_helpers_1.ONE;
+    let den = bigint_helpers_1.ONE;
+    for (let i = 1; i <= kk; i++) {
+        num *= BigInt(n - kk + i);
+        den *= BigInt(i);
+    }
+    return num / den;
+}
+function multinomial(n, ks) {
+    if (!Number.isInteger(n) || n < 0) {
+        throw new RangeError('multinomial requiere n entero no negativo');
+    }
+    let sum = 0;
+    for (const k of ks) {
+        if (!Number.isInteger(k) || k < 0) {
+            throw new RangeError('multinomial: cada k debe ser entero no negativo');
+        }
+        sum += k;
+    }
+    if (sum !== n) {
+        throw new RangeError(`multinomial: sum(ks)=${sum} debe igualar n=${n}`);
+    }
+    let result = factorial(n);
+    for (const k of ks) {
+        result /= factorial(k);
+    }
+    return result;
+}
+function permutations(n, r) {
+    if (!Number.isInteger(n) || !Number.isInteger(r)) {
+        throw new RangeError('permutations requiere enteros');
+    }
+    if (r < 0 || r > n || n < 0) {
+        return bigint_helpers_1.ZERO;
+    }
+    let result = bigint_helpers_1.ONE;
+    for (let i = 0; i < r; i++) {
+        result *= BigInt(n - i);
+    }
+    return result;
+}
+function combinations(n, r) {
+    return binomial(n, r);
+}
+//# sourceMappingURL=basic-counts.js.map

package/dist/reasoning/combinatorics/basic-counts.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"basic-counts.js","sourceRoot":"","sources":["../../../src/reasoning/combinatorics/basic-counts.ts"],"names":[],"mappings":";;AAcA,8BAUC;AAED,4BAeC;AAED,kCAmBC;AAED,oCAYC;AAED,oCAEC;AAhFD,qDAA6C;AAE7C,MAAM,UAAU,GAAa,CAAC,oBAAG,CAAC,CAAC;AAEnC,SAAS,oBAAoB,CAAC,CAAS;IACrC,KAAK,IAAI,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5C,MAAM,IAAI,GAAG,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/B,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,MAAM,IAAI,KAAK,CAAC,gCAAgC,CAAC,CAAC;QACpD,CAAC;QACD,UAAU,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC;AACH,CAAC;AAED,SAAgB,SAAS,CAAC,CAAS;IACjC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QAClC,MAAM,IAAI,UAAU,CAAC,mDAAmD,CAAC,EAAE,CAAC,CAAC;IAC/E,CAAC;IACD,oBAAoB,CAAC,CAAC,CAAC,CAAC;IACxB,MAAM,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;IACxB,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;QACpB,MAAM,IAAI,KAAK,CAAC,iCAAiC,CAAC,CAAC;IACrD,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED,SAAgB,QAAQ,CAAC,CAAS,EAAE,CAAS;IAC3C,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC;QACjD,MAAM,IAAI,UAAU,CAAC,2BAA2B,CAAC,CAAC;IACpD,CAAC;IACD,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QAC5B,OAAO,qBAAI,CAAC;IACd,CAAC;IACD,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACjC,IAAI,GAAG,GAAG,oBAAG,CAAC;IACd,IAAI,GAAG,GAAG,oBAAG,CAAC;IACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7B,GAAG,IAAI,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QAC1B,GAAG,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC;IACnB,CAAC;IACD,OAAO,GAAG,GAAG,GAAG,CAAC;AACnB,CAAC;AAED,SAAgB,WAAW,CAAC,CAAS,EAAE,EAAY;IACjD,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QAClC,MAAM,IAAI,UAAU,CAAC,2CAA2C,CAAC,CAAC;IACpE,CAAC;IACD,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;QACnB,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YAClC,MAAM,IAAI,UAAU,CAAC,iDAAiD,CAAC,CAAC;QAC1E,CAAC;QACD,GAAG,IAAI,CAAC,CAAC;IACX,CAAC;IACD,IAAI,GAAG,KAAK,CAAC,EAAE,CAAC;QACd,MAAM,IAAI,UAAU,CAAC,wBAAwB,GAAG,mBAAmB,CAAC,EAAE,CAAC,CAAC;IAC1E,CAAC;IACD,IAAI,MAAM,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;IAC1B,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;QACnB,MAAM,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC;IACzB,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAgB,YAAY,CAAC,CAAS,EAAE,CAAS;IAC/C,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC;QACjD,MAAM,IAAI,UAAU,CAAC,+BAA+B,CAAC,CAAC;IACxD,CAAC;IACD,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QAC5B,OAAO,qBAAI,CAAC;IACd,CAAC;IACD,IAAI,MAAM,GAAG,oBAAG,CAAC;IACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,MAAM,IAAI,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC1B,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAgB,YAAY,CAAC,CAAS,EAAE,CAAS;IAC/C,OAAO,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACxB,CAAC"}

package/dist/reasoning/combinatorics/bigint-helpers.d.ts

@@ -0,0 +1,5 @@
+export declare const ZERO: bigint;
+export declare const ONE: bigint;
+export declare const NEG_ONE: bigint;
+export declare const TWO: bigint;
+//# sourceMappingURL=bigint-helpers.d.ts.map

package/dist/reasoning/combinatorics/bigint-helpers.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"bigint-helpers.d.ts","sourceRoot":"","sources":["../../../src/reasoning/combinatorics/bigint-helpers.ts"],"names":[],"mappings":"AAAA,eAAO,MAAM,IAAI,QAAY,CAAC;AAC9B,eAAO,MAAM,GAAG,QAAY,CAAC;AAC7B,eAAO,MAAM,OAAO,QAAa,CAAC;AAClC,eAAO,MAAM,GAAG,QAAY,CAAC"}

package/dist/reasoning/combinatorics/bigint-helpers.js

@@ -0,0 +1,8 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.TWO = exports.NEG_ONE = exports.ONE = exports.ZERO = void 0;
+exports.ZERO = BigInt(0);
+exports.ONE = BigInt(1);
+exports.NEG_ONE = BigInt(-1);
+exports.TWO = BigInt(2);
+//# sourceMappingURL=bigint-helpers.js.map

package/dist/reasoning/combinatorics/bigint-helpers.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bigint-helpers.js","sourceRoot":"","sources":["../../../src/reasoning/combinatorics/bigint-helpers.ts"],"names":[],"mappings":";;;AAAa,QAAA,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;AACjB,QAAA,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;AAChB,QAAA,OAAO,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;AACrB,QAAA,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC"}

package/dist/reasoning/combinatorics/burnside.d.ts

@@ -0,0 +1,15 @@
+/**
+ * Aplica el lema de Burnside para contar órbitas. `items` es el alfabeto;
+ * el conjunto X sobre el que actúa el grupo son las cadenas de longitud
+ * `length` (collares de `length` perlas con `items.length` colores).
+ * `groupActions` son las funciones del grupo G actuando sobre X.
+ *
+ * |X/G| = (1/|G|) * sum_{g in G} |X^g|
+ */
+export declare function burnsideCount<T>(items: T[], length: number, groupActions: Array<(x: T[]) => T[]>): number;
+/**
+ * Genera las |group| rotaciones cíclicas de un arreglo de tamaño `length`.
+ * Útil para contar collares con simetría cíclica.
+ */
+export declare function cyclicRotations(length: number): Array<(x: unknown[]) => unknown[]>;
+//# sourceMappingURL=burnside.d.ts.map

package/dist/reasoning/combinatorics/burnside.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"burnside.d.ts","sourceRoot":"","sources":["../../../src/reasoning/combinatorics/burnside.ts"],"names":[],"mappings":"AA0BA;;;;;;;GAOG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAC7B,KAAK,EAAE,CAAC,EAAE,EACV,MAAM,EAAE,MAAM,EACd,YAAY,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC,GACnC,MAAM,CAwBR;AAED;;;GAGG;AACH,wBAAgB,eAAe,CAAC,MAAM,EAAE,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,KAAK,OAAO,EAAE,CAAC,CAoBlF"}

package/dist/reasoning/combinatorics/burnside.js

@@ -0,0 +1,91 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.burnsideCount = burnsideCount;
+exports.cyclicRotations = cyclicRotations;
+function arrayEquals(a, b) {
+    if (a.length !== b.length)
+        return false;
+    for (let i = 0; i < a.length; i++) {
+        if (a[i] !== b[i])
+            return false;
+    }
+    return true;
+}
+function cartesianProduct(items, length) {
+    if (length === 0)
+        return [[]];
+    const out = [];
+    function recurse(current) {
+        if (current.length === length) {
+            out.push(current.slice());
+            return;
+        }
+        for (const it of items) {
+            current.push(it);
+            recurse(current);
+            current.pop();
+        }
+    }
+    recurse([]);
+    return out;
+}
+/**
+ * Aplica el lema de Burnside para contar órbitas. `items` es el alfabeto;
+ * el conjunto X sobre el que actúa el grupo son las cadenas de longitud
+ * `length` (collares de `length` perlas con `items.length` colores).
+ * `groupActions` son las funciones del grupo G actuando sobre X.
+ *
+ * |X/G| = (1/|G|) * sum_{g in G} |X^g|
+ */
+function burnsideCount(items, length, groupActions) {
+    if (!Number.isInteger(length) || length < 0) {
+        throw new RangeError('burnsideCount: length debe ser entero no negativo');
+    }
+    if (groupActions.length === 0) {
+        throw new RangeError('burnsideCount: groupActions vacío');
+    }
+    const X = cartesianProduct(items, length);
+    let totalFixed = 0;
+    for (const g of groupActions) {
+        let fixed = 0;
+        for (const x of X) {
+            const gx = g(x);
+            if (gx.length !== x.length) {
+                throw new Error('burnsideCount: acción cambió la longitud');
+            }
+            if (arrayEquals(x, gx))
+                fixed++;
+        }
+        totalFixed += fixed;
+    }
+    if (totalFixed % groupActions.length !== 0) {
+        throw new Error('burnsideCount: total no es múltiplo de |G|, ¿G no es grupo?');
+    }
+    return totalFixed / groupActions.length;
+}
+/**
+ * Genera las |group| rotaciones cíclicas de un arreglo de tamaño `length`.
+ * Útil para contar collares con simetría cíclica.
+ */
+function cyclicRotations(length) {
+    if (!Number.isInteger(length) || length < 0) {
+        throw new RangeError('cyclicRotations: length entero no negativo');
+    }
+    const rots = [];
+    for (let k = 0; k < Math.max(1, length); k++) {
+        rots.push((x) => {
+            const n = x.length;
+            const out = new Array(n);
+            for (let i = 0; i < n; i++) {
+                const src = x[(i + k) % n];
+                if (src === undefined && !((i + k) % n in x)) {
+                    throw new Error('cyclicRotations: índice inválido');
+                }
+                out[i] = src;
+            }
+            return out;
+        });
+    }
+    return rots;
+}
+//# sourceMappingURL=burnside.js.map

package/dist/reasoning/combinatorics/burnside.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"burnside.js","sourceRoot":"","sources":["../../../src/reasoning/combinatorics/burnside.ts"],"names":[],"mappings":";;AAkCA,sCA4BC;AAMD,0CAoBC;AAxFD,SAAS,WAAW,CAAI,CAAM,EAAE,CAAM;IACpC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM;QAAE,OAAO,KAAK,CAAC;IACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;IAClC,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,gBAAgB,CAAI,KAAU,EAAE,MAAc;IACrD,IAAI,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,EAAE,CAAC,CAAC;IAC9B,MAAM,GAAG,GAAU,EAAE,CAAC;IACtB,SAAS,OAAO,CAAC,OAAY;QAC3B,IAAI,OAAO,CAAC,MAAM,KAAK,MAAM,EAAE,CAAC;YAC9B,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC,CAAC;YAC1B,OAAO;QACT,CAAC;QACD,KAAK,MAAM,EAAE,IAAI,KAAK,EAAE,CAAC;YACvB,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACjB,OAAO,CAAC,OAAO,CAAC,CAAC;YACjB,OAAO,CAAC,GAAG,EAAE,CAAC;QAChB,CAAC;IACH,CAAC;IACD,OAAO,CAAC,EAAE,CAAC,CAAC;IACZ,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;;;GAOG;AACH,SAAgB,aAAa,CAC3B,KAAU,EACV,MAAc,EACd,YAAoC;IAEpC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC;QAC5C,MAAM,IAAI,UAAU,CAAC,mDAAmD,CAAC,CAAC;IAC5E,CAAC;IACD,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC9B,MAAM,IAAI,UAAU,CAAC,mCAAmC,CAAC,CAAC;IAC5D,CAAC;IACD,MAAM,CAAC,GAAG,gBAAgB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IAC1C,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,KAAK,MAAM,CAAC,IAAI,YAAY,EAAE,CAAC;QAC7B,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;YAClB,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAChB,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC;gBAC3B,MAAM,IAAI,KAAK,CAAC,0CAA0C,CAAC,CAAC;YAC9D,CAAC;YACD,IAAI,WAAW,CAAC,CAAC,EAAE,EAAE,CAAC;gBAAE,KAAK,EAAE,CAAC;QAClC,CAAC;QACD,UAAU,IAAI,KAAK,CAAC;IACtB,CAAC;IACD,IAAI,UAAU,GAAG,YAAY,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC3C,MAAM,IAAI,KAAK,CAAC,6DAA6D,CAAC,CAAC;IACjF,CAAC;IACD,OAAO,UAAU,GAAG,YAAY,CAAC,MAAM,CAAC;AAC1C,CAAC;AAED;;;GAGG;AACH,SAAgB,eAAe,CAAC,MAAc;IAC5C,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC;QAC5C,MAAM,IAAI,UAAU,CAAC,4CAA4C,CAAC,CAAC;IACrE,CAAC;IACD,MAAM,IAAI,GAAuC,EAAE,CAAC;IACpD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7C,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE;YACd,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;YACnB,MAAM,GAAG,GAAc,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC;YACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC3B,IAAI,GAAG,KAAK,SAAS,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;oBAC7C,MAAM,IAAI,KAAK,CAAC,kCAAkC,CAAC,CAAC;gBACtD,CAAC;gBACD,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;YACf,CAAC;YACD,OAAO,GAAG,CAAC;QACb,CAAC,CAAC,CAAC;IACL,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC"}

package/dist/reasoning/combinatorics/generating-functions.d.ts

@@ -0,0 +1,12 @@
+export declare function multiplyPolynomials(a: number[], b: number[]): number[];
+/**
+ * Evalúa los primeros `n+1` coeficientes (grado 0..n) de la serie de potencias
+ * formal cuyos coeficientes están dados explícitamente por `coefficients`.
+ * Si `coefficients` tiene menos términos, los completa con 0.
+ */
+export declare function generatingFunction(coefficients: number[], n: number): number[];
+/**
+ * Devuelve los coeficientes de (1+x)^n (binomiales). Útil como GF estándar.
+ */
+export declare function binomialGF(n: number): number[];
+//# sourceMappingURL=generating-functions.d.ts.map

package/dist/reasoning/combinatorics/generating-functions.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"generating-functions.d.ts","sourceRoot":"","sources":["../../../src/reasoning/combinatorics/generating-functions.ts"],"names":[],"mappings":"AAAA,wBAAgB,mBAAmB,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,EAAE,CAgBtE;AAED;;;;GAIG;AACH,wBAAgB,kBAAkB,CAAC,YAAY,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE,CAU9E;AAED;;GAEG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE,CAkB9C"}

package/dist/reasoning/combinatorics/generating-functions.js

@@ -0,0 +1,67 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.multiplyPolynomials = multiplyPolynomials;
+exports.generatingFunction = generatingFunction;
+exports.binomialGF = binomialGF;
+function multiplyPolynomials(a, b) {
+    if (a.length === 0 || b.length === 0)
+        return [];
+    const out = new Array(a.length + b.length - 1).fill(0);
+    for (let i = 0; i < a.length; i++) {
+        const ai = a[i];
+        if (ai === undefined)
+            throw new Error('multiplyPolynomials: coef indefinido en a');
+        if (ai === 0)
+            continue;
+        for (let j = 0; j < b.length; j++) {
+            const bj = b[j];
+            if (bj === undefined)
+                throw new Error('multiplyPolynomials: coef indefinido en b');
+            const cur = out[i + j];
+            if (cur === undefined)
+                throw new Error('multiplyPolynomials: out indefinido');
+            out[i + j] = cur + ai * bj;
+        }
+    }
+    return out;
+}
+/**
+ * Evalúa los primeros `n+1` coeficientes (grado 0..n) de la serie de potencias
+ * formal cuyos coeficientes están dados explícitamente por `coefficients`.
+ * Si `coefficients` tiene menos términos, los completa con 0.
+ */
+function generatingFunction(coefficients, n) {
+    if (!Number.isInteger(n) || n < 0) {
+        throw new RangeError('generatingFunction: n debe ser entero no negativo');
+    }
+    const out = [];
+    for (let i = 0; i <= n; i++) {
+        const c = coefficients[i];
+        out.push(c === undefined ? 0 : c);
+    }
+    return out;
+}
+/**
+ * Devuelve los coeficientes de (1+x)^n (binomiales). Útil como GF estándar.
+ */
+function binomialGF(n) {
+    if (!Number.isInteger(n) || n < 0) {
+        throw new RangeError('binomialGF: n entero no negativo');
+    }
+    const row = [1];
+    for (let i = 1; i <= n; i++) {
+        const next = [1];
+        for (let j = 1; j < i; j++) {
+            const a = row[j - 1];
+            const b = row[j];
+            if (a === undefined || b === undefined)
+                throw new Error('binomialGF: índice');
+            next.push(a + b);
+        }
+        next.push(1);
+        row.length = 0;
+        row.push(...next);
+    }
+    return row;
+}
+//# sourceMappingURL=generating-functions.js.map

package/dist/reasoning/combinatorics/generating-functions.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"generating-functions.js","sourceRoot":"","sources":["../../../src/reasoning/combinatorics/generating-functions.ts"],"names":[],"mappings":";;AAAA,kDAgBC;AAOD,gDAUC;AAKD,gCAkBC;AAxDD,SAAgB,mBAAmB,CAAC,CAAW,EAAE,CAAW;IAC1D,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAChD,MAAM,GAAG,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC/D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAChB,IAAI,EAAE,KAAK,SAAS;YAAE,MAAM,IAAI,KAAK,CAAC,2CAA2C,CAAC,CAAC;QACnF,IAAI,EAAE,KAAK,CAAC;YAAE,SAAS;QACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAChB,IAAI,EAAE,KAAK,SAAS;gBAAE,MAAM,IAAI,KAAK,CAAC,2CAA2C,CAAC,CAAC;YACnF,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACvB,IAAI,GAAG,KAAK,SAAS;gBAAE,MAAM,IAAI,KAAK,CAAC,qCAAqC,CAAC,CAAC;YAC9E,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,GAAG,EAAE,GAAG,EAAE,CAAC;QAC7B,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;GAIG;AACH,SAAgB,kBAAkB,CAAC,YAAsB,EAAE,CAAS;IAClE,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QAClC,MAAM,IAAI,UAAU,CAAC,mDAAmD,CAAC,CAAC;IAC5E,CAAC;IACD,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,MAAM,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;QAC1B,GAAG,CAAC,IAAI,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACpC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;GAEG;AACH,SAAgB,UAAU,CAAC,CAAS;IAClC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QAClC,MAAM,IAAI,UAAU,CAAC,kCAAkC,CAAC,CAAC;IAC3D,CAAC;IACD,MAAM,GAAG,GAAa,CAAC,CAAC,CAAC,CAAC;IAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,MAAM,IAAI,GAAa,CAAC,CAAC,CAAC,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACrB,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;YACjB,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,SAAS;gBAAE,MAAM,IAAI,KAAK,CAAC,oBAAoB,CAAC,CAAC;YAC9E,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACnB,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACb,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC;QACf,GAAG,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;IACpB,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC"}

package/dist/reasoning/combinatorics/generators.d.ts

@@ -0,0 +1,5 @@
+export declare function generatePermutations<T>(items: T[]): Generator<T[]>;
+export declare function generateCombinations<T>(items: T[], r: number): Generator<T[]>;
+export declare function generatePowerSet<T>(items: T[]): Generator<T[]>;
+export declare function generateSubsetsOfSize<T>(items: T[], k: number): Generator<T[]>;
+//# sourceMappingURL=generators.d.ts.map

package/dist/reasoning/combinatorics/generators.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"generators.d.ts","sourceRoot":"","sources":["../../../src/reasoning/combinatorics/generators.ts"],"names":[],"mappings":"AAAA,wBAAiB,oBAAoB,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,SAAS,CAAC,CAAC,EAAE,CAAC,CAoCnE;AAED,wBAAiB,oBAAoB,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC,CAAC,EAAE,CAAC,CA2C9E;AAED,wBAAiB,gBAAgB,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,SAAS,CAAC,CAAC,EAAE,CAAC,CAgB/D;AAED,wBAAiB,qBAAqB,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC,CAAC,EAAE,CAAC,CAE/E"}

package/dist/reasoning/combinatorics/generators.js

@@ -0,0 +1,111 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.generatePermutations = generatePermutations;
+exports.generateCombinations = generateCombinations;
+exports.generatePowerSet = generatePowerSet;
+exports.generateSubsetsOfSize = generateSubsetsOfSize;
+function* generatePermutations(items) {
+    const n = items.length;
+    if (n === 0) {
+        yield [];
+        return;
+    }
+    const arr = items.slice();
+    function swap(i, j) {
+        const a = arr[i];
+        const b = arr[j];
+        if (a === undefined || b === undefined) {
+            if (!(i in arr) || !(j in arr)) {
+                throw new Error('generatePermutations: índice fuera de rango');
+            }
+        }
+        arr[i] = b;
+        arr[j] = a;
+    }
+    function* heap(k) {
+        if (k === 1) {
+            yield arr.slice();
+            return;
+        }
+        for (let i = 0; i < k; i++) {
+            yield* heap(k - 1);
+            if (k % 2 === 0) {
+                swap(i, k - 1);
+            }
+            else {
+                swap(0, k - 1);
+            }
+        }
+    }
+    yield* heap(n);
+}
+function* generateCombinations(items, r) {
+    if (!Number.isInteger(r) || r < 0) {
+        throw new RangeError('generateCombinations: r debe ser entero no negativo');
+    }
+    const n = items.length;
+    if (r > n)
+        return;
+    if (r === 0) {
+        yield [];
+        return;
+    }
+    const indices = [];
+    for (let i = 0; i < r; i++)
+        indices.push(i);
+    while (true) {
+        const out = [];
+        for (const idx of indices) {
+            const v = items[idx];
+            if (v === undefined && !(idx in items)) {
+                throw new Error('generateCombinations: índice fuera de rango');
+            }
+            out.push(v);
+        }
+        yield out;
+        let i = r - 1;
+        while (i >= 0) {
+            const cur = indices[i];
+            if (cur === undefined) {
+                throw new Error('generateCombinations: índice undefined');
+            }
+            if (cur !== i + n - r)
+                break;
+            i--;
+        }
+        if (i < 0)
+            return;
+        const cur = indices[i];
+        if (cur === undefined)
+            return;
+        indices[i] = cur + 1;
+        for (let j = i + 1; j < r; j++) {
+            const prev = indices[j - 1];
+            if (prev === undefined) {
+                throw new Error('generateCombinations: prev undefined');
+            }
+            indices[j] = prev + 1;
+        }
+    }
+}
+function* generatePowerSet(items) {
+    const n = items.length;
+    const total = 1 << n;
+    for (let mask = 0; mask < total; mask++) {
+        const subset = [];
+        for (let i = 0; i < n; i++) {
+            if ((mask >> i) & 1) {
+                const v = items[i];
+                if (v === undefined && !(i in items)) {
+                    throw new Error('generatePowerSet: índice fuera de rango');
+                }
+                subset.push(v);
+            }
+        }
+        yield subset;
+    }
+}
+function* generateSubsetsOfSize(items, k) {
+    yield* generateCombinations(items, k);
+}
+//# sourceMappingURL=generators.js.map

package/dist/reasoning/combinatorics/generators.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"generators.js","sourceRoot":"","sources":["../../../src/reasoning/combinatorics/generators.ts"],"names":[],"mappings":";;AAAA,oDAoCC;AAED,oDA2CC;AAED,4CAgBC;AAED,sDAEC;AAvGD,QAAe,CAAC,CAAC,oBAAoB,CAAI,KAAU;IACjD,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;IACvB,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACZ,MAAM,EAAE,CAAC;QACT,OAAO;IACT,CAAC;IACD,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;IAE1B,SAAS,IAAI,CAAC,CAAS,EAAE,CAAS;QAChC,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QACjB,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QACjB,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;YACvC,IAAI,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;gBAC/B,MAAM,IAAI,KAAK,CAAC,6CAA6C,CAAC,CAAC;YACjE,CAAC;QACH,CAAC;QACD,GAAG,CAAC,CAAC,CAAC,GAAG,CAAM,CAAC;QAChB,GAAG,CAAC,CAAC,CAAC,GAAG,CAAM,CAAC;IAClB,CAAC;IAED,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAS;QACtB,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACZ,MAAM,GAAG,CAAC,KAAK,EAAE,CAAC;YAClB,OAAO;QACT,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACnB,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBAChB,IAAI,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;YACjB,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;YACjB,CAAC;QACH,CAAC;IACH,CAAC;IAED,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AACjB,CAAC;AAED,QAAe,CAAC,CAAC,oBAAoB,CAAI,KAAU,EAAE,CAAS;IAC5D,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QAClC,MAAM,IAAI,UAAU,CAAC,qDAAqD,CAAC,CAAC;IAC9E,CAAC;IACD,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;IACvB,IAAI,CAAC,GAAG,CAAC;QAAE,OAAO;IAClB,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACZ,MAAM,EAAE,CAAC;QACT,OAAO;IACT,CAAC;IACD,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QAAE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5C,OAAO,IAAI,EAAE,CAAC;QACZ,MAAM,GAAG,GAAQ,EAAE,CAAC;QACpB,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;YAC1B,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;YACrB,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,CAAC,GAAG,IAAI,KAAK,CAAC,EAAE,CAAC;gBACvC,MAAM,IAAI,KAAK,CAAC,6CAA6C,CAAC,CAAC;YACjE,CAAC;YACD,GAAG,CAAC,IAAI,CAAC,CAAM,CAAC,CAAC;QACnB,CAAC;QACD,MAAM,GAAG,CAAC;QACV,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACd,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YACd,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YACvB,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;gBACtB,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAC;YAC5D,CAAC;YACD,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,MAAM;YAC7B,CAAC,EAAE,CAAC;QACN,CAAC;QACD,IAAI,CAAC,GAAG,CAAC;YAAE,OAAO;QAClB,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QACvB,IAAI,GAAG,KAAK,SAAS;YAAE,OAAO;QAC9B,OAAO,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC;QACrB,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/B,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC5B,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;gBACvB,MAAM,IAAI,KAAK,CAAC,sCAAsC,CAAC,CAAC;YAC1D,CAAC;YACD,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC;QACxB,CAAC;IACH,CAAC;AACH,CAAC;AAED,QAAe,CAAC,CAAC,gBAAgB,CAAI,KAAU;IAC7C,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;IACvB,MAAM,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC;IACrB,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,KAAK,EAAE,IAAI,EAAE,EAAE,CAAC;QACxC,MAAM,MAAM,GAAQ,EAAE,CAAC;QACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;gBACpB,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;gBACnB,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;oBACrC,MAAM,IAAI,KAAK,CAAC,yCAAyC,CAAC,CAAC;gBAC7D,CAAC;gBACD,MAAM,CAAC,IAAI,CAAC,CAAM,CAAC,CAAC;YACtB,CAAC;QACH,CAAC;QACD,MAAM,MAAM,CAAC;IACf,CAAC;AACH,CAAC;AAED,QAAe,CAAC,CAAC,qBAAqB,CAAI,KAAU,EAAE,CAAS;IAC7D,KAAK,CAAC,CAAC,oBAAoB,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;AACxC,CAAC"}

package/dist/reasoning/combinatorics/inclusion-exclusion.d.ts

@@ -0,0 +1,8 @@
+/**
+ * Calcula |A_1 ∪ A_2 ∪ ... ∪ A_n| usando el principio de inclusión-exclusión
+ * a fuerza bruta sobre el reticulado de subconjuntos no vacíos de índices.
+ *
+ * |⋃ A_i| = Σ_{S≠∅} (-1)^(|S|+1) |⋂_{i∈S} A_i|
+ */
+export declare function inclusionExclusion(sets: Array<Set<number>>): number;
+//# sourceMappingURL=inclusion-exclusion.d.ts.map

package/dist/reasoning/combinatorics/inclusion-exclusion.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"inclusion-exclusion.d.ts","sourceRoot":"","sources":["../../../src/reasoning/combinatorics/inclusion-exclusion.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,wBAAgB,kBAAkB,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,MAAM,CA6BnE"}