@stevenvo780/st-lang 4.0.1 → 4.2.0

package/dist/belief-revision/agm.d.ts

@@ -0,0 +1,76 @@
+import type { BeliefSet, PartialOrder } from './types';
+/**
+ * Construye un belief set a partir de un arreglo de fórmulas iniciales.
+ * Duplicados sintácticos se colapsan automáticamente.
+ */
+export declare function newBeliefSet(initial: string[]): BeliefSet;
+/**
+ * ¿Es K consistente? (la conjunción de todas sus fórmulas es satisfactible)
+ */
+export declare function isConsistent(K: BeliefSet): boolean;
+/**
+ * ¿K implica lógicamente φ?
+ * φ se pasa como cadena (se parsea con la misma sintaxis que las creencias).
+ */
+export declare function entails(K: BeliefSet, phi: string): boolean;
+/**
+ * Expansion: K + φ.
+ * Definición AGM: K + φ = Cn(K ∪ {φ}).
+ * Sobre belief bases: añadimos φ al conjunto sintáctico (sin clausurar).
+ * NO garantiza consistencia (el caller suele preferir `revise` en su lugar).
+ */
+export declare function expand(K: BeliefSet, phi: string): BeliefSet;
+/**
+ * Contraction: K - φ.
+ * Definición AGM: K - φ es el mayor subconjunto de K que NO implica φ.
+ *
+ * Casos especiales:
+ * - Si φ es tautología (vacuidad K-5): K - φ = K (no se puede remover).
+ * - Si K no implica φ: K - φ = K.
+ * - En cualquier otro caso: se aplica partial-meet con `ordering`.
+ *
+ * El parámetro opcional `ordering` define el "epistemic entrenchment":
+ * fórmulas con mayor número son más arraigadas y se preservan primero.
+ */
+export declare function contract(K: BeliefSet, phi: string, ordering?: PartialOrder): BeliefSet;
+/**
+ * Revision: K * φ.
+ * Identidad de Levi: K * φ = (K - ¬φ) + φ.
+ *
+ * Garantiza:
+ * - K2 (éxito): φ ∈ K * φ.
+ * - K5 (consistencia): si φ es consistente, K * φ es consistente.
+ *
+ * El parámetro `ordering` se usa para la contracción interna por ¬φ.
+ */
+export declare function revise(K: BeliefSet, phi: string, ordering?: PartialOrder): BeliefSet;
+/**
+ * Verifica una versión finitizada del postulado K1 (cierre lógico):
+ * para cada φ ∈ K, K entails φ (autocontención lógica).
+ * En belief bases puras esto es trivial; aquí adicionalmente exigimos
+ * que K sea consistente o que cada fórmula sea bien-formada.
+ */
+export declare function verifyClosure(K: BeliefSet): boolean;
+/**
+ * K2 (éxito): φ ∈ Cn(K * φ).
+ * Tras revisar por φ, el belief set debe implicar φ.
+ */
+export declare function verifySuccess(K_revised: BeliefSet, phi: string): boolean;
+/**
+ * K3 (inclusión): K * φ ⊆ K + φ.
+ * Toda fórmula derivable de K * φ debe ser derivable de K + φ.
+ * Para belief bases finitas, basta verificar que cada formula sintáctica
+ * de K_revised sea derivable desde K ∪ {φ}.
+ */
+export declare function verifyInclusion(K_revised: BeliefSet, K: BeliefSet, phi: string): boolean;
+/**
+ * Helper utilitario: devuelve K como arreglo ordenado de fórmulas
+ * (útil para tests, debugging, hashing estable).
+ */
+export declare function beliefSetToArray(K: BeliefSet): string[];
+/**
+ * Serialización canónica de un belief set: ordena alfabéticamente y
+ * normaliza cada fórmula vía `formulaToString` sobre su AST parseado.
+ */
+export declare function canonicalize(K: BeliefSet): string;
+//# sourceMappingURL=agm.d.ts.map

package/dist/belief-revision/agm.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"agm.d.ts","sourceRoot":"","sources":["../../src/belief-revision/agm.ts"],"names":[],"mappings":"AAqBA,OAAO,KAAK,EAAE,SAAS,EAAE,YAAY,EAAe,MAAM,SAAS,CAAC;AAqCpE;;;GAGG;AACH,wBAAgB,YAAY,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,SAAS,CAQzD;AAED;;GAEG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,SAAS,GAAG,OAAO,CAElD;AAED;;;GAGG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,SAAS,EAAE,GAAG,EAAE,MAAM,GAAG,OAAO,CAG1D;AAMD;;;;;GAKG;AACH,wBAAgB,MAAM,CAAC,CAAC,EAAE,SAAS,EAAE,GAAG,EAAE,MAAM,GAAG,SAAS,CAM3D;AA8CD;;;;;;;;;;;GAWG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,SAAS,EAAE,GAAG,EAAE,MAAM,EAAE,QAAQ,CAAC,EAAE,YAAY,GAAG,SAAS,CAgBtF;AAED;;;;;;;;;GASG;AACH,wBAAgB,MAAM,CAAC,CAAC,EAAE,SAAS,EAAE,GAAG,EAAE,MAAM,EAAE,QAAQ,CAAC,EAAE,YAAY,GAAG,SAAS,CAWpF;AAMD;;;;;GAKG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,SAAS,GAAG,OAAO,CAMnD;AAED;;;GAGG;AACH,wBAAgB,aAAa,CAAC,SAAS,EAAE,SAAS,EAAE,GAAG,EAAE,MAAM,GAAG,OAAO,CAExE;AAED;;;;;GAKG;AACH,wBAAgB,eAAe,CAAC,SAAS,EAAE,SAAS,EAAE,CAAC,EAAE,SAAS,EAAE,GAAG,EAAE,MAAM,GAAG,OAAO,CAQxF;AAED;;;GAGG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,SAAS,GAAG,MAAM,EAAE,CAEvD;AAED;;;GAGG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,SAAS,GAAG,MAAM,CAIjD"}

package/dist/belief-revision/agm.js

@@ -0,0 +1,249 @@
+"use strict";
+// ============================================================
+// ST Belief Revision — Operadores AGM
+// ============================================================
+//
+// Implementa los tres operadores básicos AGM sobre belief sets:
+//   - expand     (K + φ): unión sintáctica.
+//   - contract   (K - φ): partial-meet contraction guiada por entrenchment.
+//   - revise     (K * φ): identidad de Levi → (K - ¬φ) + φ.
+//
+// Verificación de postulados básicos:
+//   - K1 (cierre lógico): aquí trabajamos sobre belief BASES (no cierres
+//     deductivos completos). `verifyClosure` chequea que toda fórmula que
+//     `entails(K, φ)` produzca el mismo veredicto que K (idempotencia
+//     semántica). Es una versión finitizada del postulado original.
+//   - K2 (éxito): φ ∈ Cn(K * φ).
+//   - K3 (inclusión): K * φ ⊆ K + φ.
+//
+// Las fórmulas se almacenan como CADENAS para preservar la representación
+// sintáctica que el usuario provee; las operaciones lógicas (entailment,
+// consistencia) parsean a AST cuando hace falta.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.newBeliefSet = newBeliefSet;
+exports.isConsistent = isConsistent;
+exports.entails = entails;
+exports.expand = expand;
+exports.contract = contract;
+exports.revise = revise;
+exports.verifyClosure = verifyClosure;
+exports.verifySuccess = verifySuccess;
+exports.verifyInclusion = verifyInclusion;
+exports.beliefSetToArray = beliefSetToArray;
+exports.canonicalize = canonicalize;
+const parser_1 = require("./parser");
+const sat_1 = require("./sat");
+// ---------------------------------------------------------------------------
+// Helpers internos
+// ---------------------------------------------------------------------------
+/** Cache de parsing para evitar reparsear fórmulas repetidas. */
+const parseCache = new Map();
+function parseCached(formula) {
+    let cached = parseCache.get(formula);
+    if (cached === undefined) {
+        cached = (0, parser_1.parsePropFormula)(formula);
+        parseCache.set(formula, cached);
+    }
+    return cached;
+}
+function toFormulaList(K) {
+    const out = [];
+    for (const s of K.formulas) {
+        out.push(parseCached(s));
+    }
+    return out;
+}
+function entrenchment(formula, ordering) {
+    if (ordering === undefined)
+        return 0;
+    return ordering.get(formula) ?? 0;
+}
+// ---------------------------------------------------------------------------
+// Constructores y predicados básicos
+// ---------------------------------------------------------------------------
+/**
+ * Construye un belief set a partir de un arreglo de fórmulas iniciales.
+ * Duplicados sintácticos se colapsan automáticamente.
+ */
+function newBeliefSet(initial) {
+    const formulas = new Set();
+    for (const f of initial) {
+        // Validar que parsea para fallar temprano si hay sintaxis inválida.
+        parseCached(f);
+        formulas.add(f);
+    }
+    return { formulas };
+}
+/**
+ * ¿Es K consistente? (la conjunción de todas sus fórmulas es satisfactible)
+ */
+function isConsistent(K) {
+    return (0, sat_1.isSatisfiable)(toFormulaList(K));
+}
+/**
+ * ¿K implica lógicamente φ?
+ * φ se pasa como cadena (se parsea con la misma sintaxis que las creencias).
+ */
+function entails(K, phi) {
+    const phiAst = parseCached(phi);
+    return (0, sat_1.entailsFormula)(toFormulaList(K), phiAst);
+}
+// ---------------------------------------------------------------------------
+// Operadores AGM
+// ---------------------------------------------------------------------------
+/**
+ * Expansion: K + φ.
+ * Definición AGM: K + φ = Cn(K ∪ {φ}).
+ * Sobre belief bases: añadimos φ al conjunto sintáctico (sin clausurar).
+ * NO garantiza consistencia (el caller suele preferir `revise` en su lugar).
+ */
+function expand(K, phi) {
+    // Validar sintaxis.
+    parseCached(phi);
+    const formulas = new Set(K.formulas);
+    formulas.add(phi);
+    return { formulas };
+}
+/**
+ * Selecciona los candidatos a remover: subconjunto mínimo de K cuya
+ * eliminación rompe la implicación de φ, preferentemente los menos
+ * arraigados según `ordering`.
+ *
+ * Estrategia (greedy partial-meet):
+ * 1. Ordenar las fórmulas de K ASCENDENTEMENTE por entrenchment
+ *    (menos arraigada primero, candidata principal a remover).
+ * 2. Eliminar fórmulas en ese orden hasta que K \ removed deje de
+ *    implicar φ. Detener al primer subconjunto que rompe φ.
+ * 3. Si K no implica φ, no se remueve nada.
+ */
+function selectContractionVictims(K, phi, ordering) {
+    const formulasList = Array.from(K.formulas);
+    // Si K ya no implica φ, no hay nada que remover.
+    if (!(0, sat_1.entailsFormula)(formulasList.map(parseCached), phi)) {
+        return new Set();
+    }
+    // Ordenar ascendentemente por entrenchment; desempate lexicográfico.
+    const sorted = [...formulasList].sort((a, b) => {
+        const ea = entrenchment(a, ordering);
+        const eb = entrenchment(b, ordering);
+        if (ea !== eb)
+            return ea - eb;
+        return a < b ? -1 : a > b ? 1 : 0;
+    });
+    const removed = new Set();
+    for (const candidate of sorted) {
+        removed.add(candidate);
+        const remaining = formulasList.filter((f) => !removed.has(f));
+        if (!(0, sat_1.entailsFormula)(remaining.map(parseCached), phi)) {
+            return removed;
+        }
+    }
+    // Fallback: si removiendo todo aún implica φ (ej. φ es tautología),
+    // devolvemos el set completo (el caller tratará el caso).
+    return removed;
+}
+/**
+ * Contraction: K - φ.
+ * Definición AGM: K - φ es el mayor subconjunto de K que NO implica φ.
+ *
+ * Casos especiales:
+ * - Si φ es tautología (vacuidad K-5): K - φ = K (no se puede remover).
+ * - Si K no implica φ: K - φ = K.
+ * - En cualquier otro caso: se aplica partial-meet con `ordering`.
+ *
+ * El parámetro opcional `ordering` define el "epistemic entrenchment":
+ * fórmulas con mayor número son más arraigadas y se preservan primero.
+ */
+function contract(K, phi, ordering) {
+    const phiAst = parseCached(phi);
+    // Vacuidad: si φ es tautología, no se puede contraer.
+    // (¬φ es insatisfactible ⇔ φ es tautología.)
+    const negPhi = { kind: 'not', arg: phiAst };
+    if (!(0, sat_1.isSatisfiable)([negPhi])) {
+        return { formulas: new Set(K.formulas) };
+    }
+    const victims = selectContractionVictims(K, phiAst, ordering);
+    const formulas = new Set();
+    for (const f of K.formulas) {
+        if (!victims.has(f))
+            formulas.add(f);
+    }
+    return { formulas };
+}
+/**
+ * Revision: K * φ.
+ * Identidad de Levi: K * φ = (K - ¬φ) + φ.
+ *
+ * Garantiza:
+ * - K2 (éxito): φ ∈ K * φ.
+ * - K5 (consistencia): si φ es consistente, K * φ es consistente.
+ *
+ * El parámetro `ordering` se usa para la contracción interna por ¬φ.
+ */
+function revise(K, phi, ordering) {
+    // Validar sintaxis.
+    const phiAst = parseCached(phi);
+    // Construir ¬φ y normalizarlo a una cadena que el parser pueda releer.
+    const negPhiStr = `!(${phi})`;
+    // Pre-cachear su AST.
+    parseCache.set(negPhiStr, { kind: 'not', arg: phiAst });
+    const contracted = contract(K, negPhiStr, ordering);
+    return expand(contracted, phi);
+}
+// ---------------------------------------------------------------------------
+// Verificación de postulados AGM
+// ---------------------------------------------------------------------------
+/**
+ * Verifica una versión finitizada del postulado K1 (cierre lógico):
+ * para cada φ ∈ K, K entails φ (autocontención lógica).
+ * En belief bases puras esto es trivial; aquí adicionalmente exigimos
+ * que K sea consistente o que cada fórmula sea bien-formada.
+ */
+function verifyClosure(K) {
+    const list = toFormulaList(K);
+    for (const f of list) {
+        if (!(0, sat_1.entailsFormula)(list, f))
+            return false;
+    }
+    return true;
+}
+/**
+ * K2 (éxito): φ ∈ Cn(K * φ).
+ * Tras revisar por φ, el belief set debe implicar φ.
+ */
+function verifySuccess(K_revised, phi) {
+    return entails(K_revised, phi);
+}
+/**
+ * K3 (inclusión): K * φ ⊆ K + φ.
+ * Toda fórmula derivable de K * φ debe ser derivable de K + φ.
+ * Para belief bases finitas, basta verificar que cada formula sintáctica
+ * de K_revised sea derivable desde K ∪ {φ}.
+ */
+function verifyInclusion(K_revised, K, phi) {
+    const expanded = expand(K, phi);
+    const expandedList = toFormulaList(expanded);
+    for (const f of K_revised.formulas) {
+        const ast = parseCached(f);
+        if (!(0, sat_1.entailsFormula)(expandedList, ast))
+            return false;
+    }
+    return true;
+}
+/**
+ * Helper utilitario: devuelve K como arreglo ordenado de fórmulas
+ * (útil para tests, debugging, hashing estable).
+ */
+function beliefSetToArray(K) {
+    return Array.from(K.formulas).sort();
+}
+/**
+ * Serialización canónica de un belief set: ordena alfabéticamente y
+ * normaliza cada fórmula vía `formulaToString` sobre su AST parseado.
+ */
+function canonicalize(K) {
+    const normalized = Array.from(K.formulas).map((f) => (0, parser_1.formulaToString)(parseCached(f)));
+    normalized.sort();
+    return `{${normalized.join(', ')}}`;
+}
+//# sourceMappingURL=agm.js.map

package/dist/belief-revision/agm.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"agm.js","sourceRoot":"","sources":["../../src/belief-revision/agm.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,sCAAsC;AACtC,+DAA+D;AAC/D,EAAE;AACF,gEAAgE;AAChE,4CAA4C;AAC5C,4EAA4E;AAC5E,4DAA4D;AAC5D,EAAE;AACF,sCAAsC;AACtC,yEAAyE;AACzE,0EAA0E;AAC1E,sEAAsE;AACtE,oEAAoE;AACpE,iCAAiC;AACjC,qCAAqC;AACrC,EAAE;AACF,0EAA0E;AAC1E,yEAAyE;AACzE,iDAAiD;;AA2CjD,oCAQC;AAKD,oCAEC;AAMD,0BAGC;AAYD,wBAMC;AA0DD,4BAgBC;AAYD,wBAWC;AAYD,sCAMC;AAMD,sCAEC;AAQD,0CAQC;AAMD,4CAEC;AAMD,oCAIC;AA/OD,qCAA6D;AAC7D,+BAAsD;AAEtD,8EAA8E;AAC9E,mBAAmB;AACnB,8EAA8E;AAE9E,iEAAiE;AACjE,MAAM,UAAU,GAAG,IAAI,GAAG,EAAuB,CAAC;AAElD,SAAS,WAAW,CAAC,OAAe;IAClC,IAAI,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IACrC,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;QACzB,MAAM,GAAG,IAAA,yBAAgB,EAAC,OAAO,CAAC,CAAC;QACnC,UAAU,CAAC,GAAG,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;IAClC,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAS,aAAa,CAAC,CAAY;IACjC,MAAM,GAAG,GAAkB,EAAE,CAAC;IAC9B,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;QAC3B,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3B,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,YAAY,CAAC,OAAe,EAAE,QAAuB;IAC5D,IAAI,QAAQ,KAAK,SAAS;QAAE,OAAO,CAAC,CAAC;IACrC,OAAO,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;AACpC,CAAC;AAED,8EAA8E;AAC9E,qCAAqC;AACrC,8EAA8E;AAE9E;;;GAGG;AACH,SAAgB,YAAY,CAAC,OAAiB;IAC5C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IACnC,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,oEAAoE;QACpE,WAAW,CAAC,CAAC,CAAC,CAAC;QACf,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAClB,CAAC;IACD,OAAO,EAAE,QAAQ,EAAE,CAAC;AACtB,CAAC;AAED;;GAEG;AACH,SAAgB,YAAY,CAAC,CAAY;IACvC,OAAO,IAAA,mBAAa,EAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;AACzC,CAAC;AAED;;;GAGG;AACH,SAAgB,OAAO,CAAC,CAAY,EAAE,GAAW;IAC/C,MAAM,MAAM,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC;IAChC,OAAO,IAAA,oBAAc,EAAC,aAAa,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;AAClD,CAAC;AAED,8EAA8E;AAC9E,iBAAiB;AACjB,8EAA8E;AAE9E;;;;;GAKG;AACH,SAAgB,MAAM,CAAC,CAAY,EAAE,GAAW;IAC9C,oBAAoB;IACpB,WAAW,CAAC,GAAG,CAAC,CAAC;IACjB,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;IACrC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAClB,OAAO,EAAE,QAAQ,EAAE,CAAC;AACtB,CAAC;AAED;;;;;;;;;;;GAWG;AACH,SAAS,wBAAwB,CAC/B,CAAY,EACZ,GAAgB,EAChB,QAAuB;IAEvB,MAAM,YAAY,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;IAC5C,iDAAiD;IACjD,IAAI,CAAC,IAAA,oBAAc,EAAC,YAAY,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC;QACxD,OAAO,IAAI,GAAG,EAAE,CAAC;IACnB,CAAC;IAED,qEAAqE;IACrE,MAAM,MAAM,GAAG,CAAC,GAAG,YAAY,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QAC7C,MAAM,EAAE,GAAG,YAAY,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;QACrC,MAAM,EAAE,GAAG,YAAY,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;QACrC,IAAI,EAAE,KAAK,EAAE;YAAE,OAAO,EAAE,GAAG,EAAE,CAAC;QAC9B,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,KAAK,MAAM,SAAS,IAAI,MAAM,EAAE,CAAC;QAC/B,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QACvB,MAAM,SAAS,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9D,IAAI,CAAC,IAAA,oBAAc,EAAC,SAAS,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC;YACrD,OAAO,OAAO,CAAC;QACjB,CAAC;IACH,CAAC;IACD,oEAAoE;IACpE,0DAA0D;IAC1D,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;;;;;;;;;GAWG;AACH,SAAgB,QAAQ,CAAC,CAAY,EAAE,GAAW,EAAE,QAAuB;IACzE,MAAM,MAAM,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC;IAEhC,sDAAsD;IACtD,6CAA6C;IAC7C,MAAM,MAAM,GAAgB,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC;IACzD,IAAI,CAAC,IAAA,mBAAa,EAAC,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC;QAC7B,OAAO,EAAE,QAAQ,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC;IAC3C,CAAC;IAED,MAAM,OAAO,GAAG,wBAAwB,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;IAC9D,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IACnC,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;QAC3B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACvC,CAAC;IACD,OAAO,EAAE,QAAQ,EAAE,CAAC;AACtB,CAAC;AAED;;;;;;;;;GASG;AACH,SAAgB,MAAM,CAAC,CAAY,EAAE,GAAW,EAAE,QAAuB;IACvE,oBAAoB;IACpB,MAAM,MAAM,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC;IAEhC,uEAAuE;IACvE,MAAM,SAAS,GAAG,KAAK,GAAG,GAAG,CAAC;IAC9B,sBAAsB;IACtB,UAAU,CAAC,GAAG,CAAC,SAAS,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC,CAAC;IAExD,MAAM,UAAU,GAAG,QAAQ,CAAC,CAAC,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC;IACpD,OAAO,MAAM,CAAC,UAAU,EAAE,GAAG,CAAC,CAAC;AACjC,CAAC;AAED,8EAA8E;AAC9E,iCAAiC;AACjC,8EAA8E;AAE9E;;;;;GAKG;AACH,SAAgB,aAAa,CAAC,CAAY;IACxC,MAAM,IAAI,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;IAC9B,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,IAAI,CAAC,IAAA,oBAAc,EAAC,IAAI,EAAE,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;IAC7C,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;GAGG;AACH,SAAgB,aAAa,CAAC,SAAoB,EAAE,GAAW;IAC7D,OAAO,OAAO,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;AACjC,CAAC;AAED;;;;;GAKG;AACH,SAAgB,eAAe,CAAC,SAAoB,EAAE,CAAY,EAAE,GAAW;IAC7E,MAAM,QAAQ,GAAG,MAAM,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IAChC,MAAM,YAAY,GAAG,aAAa,CAAC,QAAQ,CAAC,CAAC;IAC7C,KAAK,MAAM,CAAC,IAAI,SAAS,CAAC,QAAQ,EAAE,CAAC;QACnC,MAAM,GAAG,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;QAC3B,IAAI,CAAC,IAAA,oBAAc,EAAC,YAAY,EAAE,GAAG,CAAC;YAAE,OAAO,KAAK,CAAC;IACvD,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;GAGG;AACH,SAAgB,gBAAgB,CAAC,CAAY;IAC3C,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;AACvC,CAAC;AAED;;;GAGG;AACH,SAAgB,YAAY,CAAC,CAAY;IACvC,MAAM,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAA,wBAAe,EAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACtF,UAAU,CAAC,IAAI,EAAE,CAAC;IAClB,OAAO,IAAI,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC;AACtC,CAAC"}

package/dist/belief-revision/index.d.ts

@@ -0,0 +1,6 @@
+export type { BeliefSet, PartialOrder, PropFormula } from './types';
+export { newBeliefSet, isConsistent, entails, expand, contract, revise, verifyClosure, verifySuccess, verifyInclusion, beliefSetToArray, canonicalize, } from './agm';
+export { parsePropFormula, formulaToString, collectAtoms } from './parser';
+export { evalFormula, isSatisfiable, entailsFormula, areEquivalent } from './sat';
+export type { Valuation } from './sat';
+//# sourceMappingURL=index.d.ts.map

package/dist/belief-revision/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/belief-revision/index.ts"],"names":[],"mappings":"AASA,YAAY,EAAE,SAAS,EAAE,YAAY,EAAE,WAAW,EAAE,MAAM,SAAS,CAAC;AACpE,OAAO,EACL,YAAY,EACZ,YAAY,EACZ,OAAO,EACP,MAAM,EACN,QAAQ,EACR,MAAM,EACN,aAAa,EACb,aAAa,EACb,eAAe,EACf,gBAAgB,EAChB,YAAY,GACb,MAAM,OAAO,CAAC;AACf,OAAO,EAAE,gBAAgB,EAAE,eAAe,EAAE,YAAY,EAAE,MAAM,UAAU,CAAC;AAC3E,OAAO,EAAE,WAAW,EAAE,aAAa,EAAE,cAAc,EAAE,aAAa,EAAE,MAAM,OAAO,CAAC;AAClF,YAAY,EAAE,SAAS,EAAE,MAAM,OAAO,CAAC"}

package/dist/belief-revision/index.js

@@ -0,0 +1,33 @@
+"use strict";
+// ============================================================
+// ST Belief Revision — Barrel export
+// ============================================================
+//
+// Operadores AGM (Alchourrón-Gärdenfors-Makinson) sobre belief sets
+// proposicionales. Incluye expansion, contraction (partial-meet con
+// entrenchment opcional), revision (vía identidad de Levi) y
+// verificadores de los postulados K1-K3.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.areEquivalent = exports.entailsFormula = exports.isSatisfiable = exports.evalFormula = exports.collectAtoms = exports.formulaToString = exports.parsePropFormula = exports.canonicalize = exports.beliefSetToArray = exports.verifyInclusion = exports.verifySuccess = exports.verifyClosure = exports.revise = exports.contract = exports.expand = exports.entails = exports.isConsistent = exports.newBeliefSet = void 0;
+var agm_1 = require("./agm");
+Object.defineProperty(exports, "newBeliefSet", { enumerable: true, get: function () { return agm_1.newBeliefSet; } });
+Object.defineProperty(exports, "isConsistent", { enumerable: true, get: function () { return agm_1.isConsistent; } });
+Object.defineProperty(exports, "entails", { enumerable: true, get: function () { return agm_1.entails; } });
+Object.defineProperty(exports, "expand", { enumerable: true, get: function () { return agm_1.expand; } });
+Object.defineProperty(exports, "contract", { enumerable: true, get: function () { return agm_1.contract; } });
+Object.defineProperty(exports, "revise", { enumerable: true, get: function () { return agm_1.revise; } });
+Object.defineProperty(exports, "verifyClosure", { enumerable: true, get: function () { return agm_1.verifyClosure; } });
+Object.defineProperty(exports, "verifySuccess", { enumerable: true, get: function () { return agm_1.verifySuccess; } });
+Object.defineProperty(exports, "verifyInclusion", { enumerable: true, get: function () { return agm_1.verifyInclusion; } });
+Object.defineProperty(exports, "beliefSetToArray", { enumerable: true, get: function () { return agm_1.beliefSetToArray; } });
+Object.defineProperty(exports, "canonicalize", { enumerable: true, get: function () { return agm_1.canonicalize; } });
+var parser_1 = require("./parser");
+Object.defineProperty(exports, "parsePropFormula", { enumerable: true, get: function () { return parser_1.parsePropFormula; } });
+Object.defineProperty(exports, "formulaToString", { enumerable: true, get: function () { return parser_1.formulaToString; } });
+Object.defineProperty(exports, "collectAtoms", { enumerable: true, get: function () { return parser_1.collectAtoms; } });
+var sat_1 = require("./sat");
+Object.defineProperty(exports, "evalFormula", { enumerable: true, get: function () { return sat_1.evalFormula; } });
+Object.defineProperty(exports, "isSatisfiable", { enumerable: true, get: function () { return sat_1.isSatisfiable; } });
+Object.defineProperty(exports, "entailsFormula", { enumerable: true, get: function () { return sat_1.entailsFormula; } });
+Object.defineProperty(exports, "areEquivalent", { enumerable: true, get: function () { return sat_1.areEquivalent; } });
+//# sourceMappingURL=index.js.map

package/dist/belief-revision/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/belief-revision/index.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,qCAAqC;AACrC,+DAA+D;AAC/D,EAAE;AACF,oEAAoE;AACpE,oEAAoE;AACpE,6DAA6D;AAC7D,yCAAyC;;;AAGzC,6BAYe;AAXb,mGAAA,YAAY,OAAA;AACZ,mGAAA,YAAY,OAAA;AACZ,8FAAA,OAAO,OAAA;AACP,6FAAA,MAAM,OAAA;AACN,+FAAA,QAAQ,OAAA;AACR,6FAAA,MAAM,OAAA;AACN,oGAAA,aAAa,OAAA;AACb,oGAAA,aAAa,OAAA;AACb,sGAAA,eAAe,OAAA;AACf,uGAAA,gBAAgB,OAAA;AAChB,mGAAA,YAAY,OAAA;AAEd,mCAA2E;AAAlE,0GAAA,gBAAgB,OAAA;AAAE,yGAAA,eAAe,OAAA;AAAE,sGAAA,YAAY,OAAA;AACxD,6BAAkF;AAAzE,kGAAA,WAAW,OAAA;AAAE,oGAAA,aAAa,OAAA;AAAE,qGAAA,cAAc,OAAA;AAAE,oGAAA,aAAa,OAAA"}

package/dist/belief-revision/parser.d.ts

@@ -0,0 +1,16 @@
+import type { PropFormula } from './types';
+/**
+ * Parsea una fórmula propositional a su AST interno.
+ * Lanza Error con mensaje legible si el input no es válido.
+ */
+export declare function parsePropFormula(input: string): PropFormula;
+/**
+ * Recolecta los nombres de átomos que aparecen en una fórmula.
+ */
+export declare function collectAtoms(f: PropFormula, into?: Set<string>): Set<string>;
+/**
+ * Serializa una fórmula a su forma canónica (con paréntesis explícitos).
+ * Útil para hashing y comparaciones estructurales.
+ */
+export declare function formulaToString(f: PropFormula): string;
+//# sourceMappingURL=parser.d.ts.map

package/dist/belief-revision/parser.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"parser.d.ts","sourceRoot":"","sources":["../../src/belief-revision/parser.ts"],"names":[],"mappings":"AAqBA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,SAAS,CAAC;AAkI3C;;;GAGG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,MAAM,GAAG,WAAW,CAQ3D;AAED;;GAEG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,WAAW,EAAE,IAAI,GAAE,GAAG,CAAC,MAAM,CAAa,GAAG,GAAG,CAAC,MAAM,CAAC,CAmBvF;AAED;;;GAGG;AACH,wBAAgB,eAAe,CAAC,CAAC,EAAE,WAAW,GAAG,MAAM,CAmBtD"}

package/dist/belief-revision/parser.js

@@ -0,0 +1,199 @@
+"use strict";
+// ============================================================
+// ST Belief Revision — Parser propositional minimalista
+// ============================================================
+//
+// Gramática (precedencia menor a mayor):
+//   biconditional : implication ('<->' implication)*
+//   implication   : disjunction ('->' implication)?       (asoc. derecha)
+//   disjunction   : conjunction ('|' conjunction)*
+//   conjunction   : negation    ('&' negation)*
+//   negation      : '!' negation | primary
+//   primary       : atom | 'true' | 'false' | '(' biconditional ')'
+//
+// Aliases tolerados:
+//   ¬ ~ !            → not
+//   ∧ /\ &           → and
+//   ∨ \/ |           → or
+//   → => ->          → implies
+//   ↔ <-> <=>        → iff
+//   ⊤ T              → true (cuando aparece como token único o palabra)
+//   ⊥ F              → false
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.parsePropFormula = parsePropFormula;
+exports.collectAtoms = collectAtoms;
+exports.formulaToString = formulaToString;
+class ParseError extends Error {
+}
+function isAtomStart(ch) {
+    return /[A-Za-z_]/.test(ch);
+}
+function isAtomCont(ch) {
+    return /[A-Za-z0-9_]/.test(ch);
+}
+function skipWs(ctx) {
+    while (ctx.pos < ctx.src.length && /\s/.test(ctx.src.charAt(ctx.pos))) {
+        ctx.pos += 1;
+    }
+}
+function peek(ctx, offset = 0) {
+    return ctx.src.charAt(ctx.pos + offset);
+}
+function consumeIf(ctx, token) {
+    skipWs(ctx);
+    if (ctx.src.startsWith(token, ctx.pos)) {
+        ctx.pos += token.length;
+        return true;
+    }
+    return false;
+}
+function consumeAny(ctx, tokens) {
+    skipWs(ctx);
+    for (const t of tokens) {
+        if (ctx.src.startsWith(t, ctx.pos)) {
+            ctx.pos += t.length;
+            return t;
+        }
+    }
+    return null;
+}
+function parsePrimary(ctx) {
+    skipWs(ctx);
+    if (ctx.pos >= ctx.src.length) {
+        throw new ParseError('inesperado fin de expresión');
+    }
+    const ch = peek(ctx);
+    if (ch === '(') {
+        ctx.pos += 1;
+        const inner = parseBiconditional(ctx);
+        skipWs(ctx);
+        if (!consumeIf(ctx, ')')) {
+            throw new ParseError(`esperaba ')' en posición ${ctx.pos}`);
+        }
+        return inner;
+    }
+    // Símbolos unicode true/false
+    if (ch === '⊤') {
+        ctx.pos += 1;
+        return { kind: 'true' };
+    }
+    if (ch === '⊥') {
+        ctx.pos += 1;
+        return { kind: 'false' };
+    }
+    if (isAtomStart(ch)) {
+        const start = ctx.pos;
+        ctx.pos += 1;
+        while (ctx.pos < ctx.src.length && isAtomCont(peek(ctx))) {
+            ctx.pos += 1;
+        }
+        const name = ctx.src.slice(start, ctx.pos);
+        if (name === 'true' || name === 'T')
+            return { kind: 'true' };
+        if (name === 'false' || name === 'F')
+            return { kind: 'false' };
+        return { kind: 'atom', name };
+    }
+    throw new ParseError(`token inesperado "${ch}" en posición ${ctx.pos}`);
+}
+function parseNegation(ctx) {
+    skipWs(ctx);
+    if (consumeAny(ctx, ['¬', '~', '!']) !== null) {
+        const inner = parseNegation(ctx);
+        return { kind: 'not', arg: inner };
+    }
+    return parsePrimary(ctx);
+}
+function parseConjunction(ctx) {
+    let left = parseNegation(ctx);
+    while (consumeAny(ctx, ['∧', '/\\', '&']) !== null) {
+        const right = parseNegation(ctx);
+        left = { kind: 'and', left, right };
+    }
+    return left;
+}
+function parseDisjunction(ctx) {
+    let left = parseConjunction(ctx);
+    while (consumeAny(ctx, ['∨', '\\/', '|']) !== null) {
+        const right = parseConjunction(ctx);
+        left = { kind: 'or', left, right };
+    }
+    return left;
+}
+function parseImplication(ctx) {
+    const left = parseDisjunction(ctx);
+    if (consumeAny(ctx, ['→', '=>', '->']) !== null) {
+        const right = parseImplication(ctx); // asociatividad a la derecha
+        return { kind: 'implies', left, right };
+    }
+    return left;
+}
+function parseBiconditional(ctx) {
+    let left = parseImplication(ctx);
+    while (consumeAny(ctx, ['↔', '<->', '<=>']) !== null) {
+        const right = parseImplication(ctx);
+        left = { kind: 'iff', left, right };
+    }
+    return left;
+}
+/**
+ * Parsea una fórmula propositional a su AST interno.
+ * Lanza Error con mensaje legible si el input no es válido.
+ */
+function parsePropFormula(input) {
+    const ctx = { src: input, pos: 0 };
+    const formula = parseBiconditional(ctx);
+    skipWs(ctx);
+    if (ctx.pos < ctx.src.length) {
+        throw new ParseError(`tokens sobrantes en posición ${ctx.pos}: "${ctx.src.slice(ctx.pos)}"`);
+    }
+    return formula;
+}
+/**
+ * Recolecta los nombres de átomos que aparecen en una fórmula.
+ */
+function collectAtoms(f, into = new Set()) {
+    switch (f.kind) {
+        case 'true':
+        case 'false':
+            return into;
+        case 'atom':
+            into.add(f.name);
+            return into;
+        case 'not':
+            collectAtoms(f.arg, into);
+            return into;
+        case 'and':
+        case 'or':
+        case 'implies':
+        case 'iff':
+            collectAtoms(f.left, into);
+            collectAtoms(f.right, into);
+            return into;
+    }
+}
+/**
+ * Serializa una fórmula a su forma canónica (con paréntesis explícitos).
+ * Útil para hashing y comparaciones estructurales.
+ */
+function formulaToString(f) {
+    switch (f.kind) {
+        case 'true':
+            return 'true';
+        case 'false':
+            return 'false';
+        case 'atom':
+            return f.name;
+        case 'not':
+            return `!${formulaToString(f.arg)}`;
+        case 'and':
+            return `(${formulaToString(f.left)} & ${formulaToString(f.right)})`;
+        case 'or':
+            return `(${formulaToString(f.left)} | ${formulaToString(f.right)})`;
+        case 'implies':
+            return `(${formulaToString(f.left)} -> ${formulaToString(f.right)})`;
+        case 'iff':
+            return `(${formulaToString(f.left)} <-> ${formulaToString(f.right)})`;
+    }
+}
+//# sourceMappingURL=parser.js.map

package/dist/belief-revision/parser.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"parser.js","sourceRoot":"","sources":["../../src/belief-revision/parser.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,wDAAwD;AACxD,+DAA+D;AAC/D,EAAE;AACF,yCAAyC;AACzC,qDAAqD;AACrD,0EAA0E;AAC1E,mDAAmD;AACnD,gDAAgD;AAChD,2CAA2C;AAC3C,oEAAoE;AACpE,EAAE;AACF,qBAAqB;AACrB,2BAA2B;AAC3B,2BAA2B;AAC3B,0BAA0B;AAC1B,+BAA+B;AAC/B,2BAA2B;AAC3B,wEAAwE;AACxE,6BAA6B;;AAwI7B,4CAQC;AAKD,oCAmBC;AAMD,0CAmBC;AA7LD,MAAM,UAAW,SAAQ,KAAK;CAAG;AAOjC,SAAS,WAAW,CAAC,EAAU;IAC7B,OAAO,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AAC9B,CAAC;AAED,SAAS,UAAU,CAAC,EAAU;IAC5B,OAAO,cAAc,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AACjC,CAAC;AAED,SAAS,MAAM,CAAC,GAAc;IAC5B,OAAO,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;QACtE,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC;IACf,CAAC;AACH,CAAC;AAED,SAAS,IAAI,CAAC,GAAc,EAAE,MAAM,GAAG,CAAC;IACtC,OAAO,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,GAAG,MAAM,CAAC,CAAC;AAC1C,CAAC;AAED,SAAS,SAAS,CAAC,GAAc,EAAE,KAAa;IAC9C,MAAM,CAAC,GAAG,CAAC,CAAC;IACZ,IAAI,GAAG,CAAC,GAAG,CAAC,UAAU,CAAC,KAAK,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;QACvC,GAAG,CAAC,GAAG,IAAI,KAAK,CAAC,MAAM,CAAC;QACxB,OAAO,IAAI,CAAC;IACd,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,UAAU,CAAC,GAAc,EAAE,MAAgB;IAClD,MAAM,CAAC,GAAG,CAAC,CAAC;IACZ,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,IAAI,GAAG,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACnC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,MAAM,CAAC;YACpB,OAAO,CAAC,CAAC;QACX,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,YAAY,CAAC,GAAc;IAClC,MAAM,CAAC,GAAG,CAAC,CAAC;IACZ,IAAI,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC;QAC9B,MAAM,IAAI,UAAU,CAAC,6BAA6B,CAAC,CAAC;IACtD,CAAC;IACD,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;IACrB,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;QACf,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC;QACb,MAAM,KAAK,GAAG,kBAAkB,CAAC,GAAG,CAAC,CAAC;QACtC,MAAM,CAAC,GAAG,CAAC,CAAC;QACZ,IAAI,CAAC,SAAS,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;YACzB,MAAM,IAAI,UAAU,CAAC,4BAA4B,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC;QAC9D,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,8BAA8B;IAC9B,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;QACf,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC;QACb,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;IAC1B,CAAC;IACD,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;QACf,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC;QACb,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;IAC3B,CAAC;IACD,IAAI,WAAW,CAAC,EAAE,CAAC,EAAE,CAAC;QACpB,MAAM,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC;QACtB,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC;QACb,OAAO,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,IAAI,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;YACzD,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC;QACf,CAAC;QACD,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;QAC3C,IAAI,IAAI,KAAK,MAAM,IAAI,IAAI,KAAK,GAAG;YAAE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;QAC7D,IAAI,IAAI,KAAK,OAAO,IAAI,IAAI,KAAK,GAAG;YAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;QAC/D,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;IAChC,CAAC;IACD,MAAM,IAAI,UAAU,CAAC,qBAAqB,EAAE,iBAAiB,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC;AAC1E,CAAC;AAED,SAAS,aAAa,CAAC,GAAc;IACnC,MAAM,CAAC,GAAG,CAAC,CAAC;IACZ,IAAI,UAAU,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;QAC9C,MAAM,KAAK,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC;QACjC,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC;IACrC,CAAC;IACD,OAAO,YAAY,CAAC,GAAG,CAAC,CAAC;AAC3B,CAAC;AAED,SAAS,gBAAgB,CAAC,GAAc;IACtC,IAAI,IAAI,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC;IAC9B,OAAO,UAAU,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;QACnD,MAAM,KAAK,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC;QACjC,IAAI,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;IACtC,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,gBAAgB,CAAC,GAAc;IACtC,IAAI,IAAI,GAAG,gBAAgB,CAAC,GAAG,CAAC,CAAC;IACjC,OAAO,UAAU,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;QACnD,MAAM,KAAK,GAAG,gBAAgB,CAAC,GAAG,CAAC,CAAC;QACpC,IAAI,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;IACrC,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,gBAAgB,CAAC,GAAc;IACtC,MAAM,IAAI,GAAG,gBAAgB,CAAC,GAAG,CAAC,CAAC;IACnC,IAAI,UAAU,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;QAChD,MAAM,KAAK,GAAG,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,6BAA6B;QAClE,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;IAC1C,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,kBAAkB,CAAC,GAAc;IACxC,IAAI,IAAI,GAAG,gBAAgB,CAAC,GAAG,CAAC,CAAC;IACjC,OAAO,UAAU,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;QACrD,MAAM,KAAK,GAAG,gBAAgB,CAAC,GAAG,CAAC,CAAC;QACpC,IAAI,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;IACtC,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;GAGG;AACH,SAAgB,gBAAgB,CAAC,KAAa;IAC5C,MAAM,GAAG,GAAc,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;IAC9C,MAAM,OAAO,GAAG,kBAAkB,CAAC,GAAG,CAAC,CAAC;IACxC,MAAM,CAAC,GAAG,CAAC,CAAC;IACZ,IAAI,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC;QAC7B,MAAM,IAAI,UAAU,CAAC,gCAAgC,GAAG,CAAC,GAAG,MAAM,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC/F,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;GAEG;AACH,SAAgB,YAAY,CAAC,CAAc,EAAE,OAAoB,IAAI,GAAG,EAAE;IACxE,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,MAAM,CAAC;QACZ,KAAK,OAAO;YACV,OAAO,IAAI,CAAC;QACd,KAAK,MAAM;YACT,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACjB,OAAO,IAAI,CAAC;QACd,KAAK,KAAK;YACR,YAAY,CAAC,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YAC1B,OAAO,IAAI,CAAC;QACd,KAAK,KAAK,CAAC;QACX,KAAK,IAAI,CAAC;QACV,KAAK,SAAS,CAAC;QACf,KAAK,KAAK;YACR,YAAY,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YAC3B,YAAY,CAAC,CAAC,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;YAC5B,OAAO,IAAI,CAAC;IAChB,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,SAAgB,eAAe,CAAC,CAAc;IAC5C,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,MAAM;YACT,OAAO,MAAM,CAAC;QAChB,KAAK,OAAO;YACV,OAAO,OAAO,CAAC;QACjB,KAAK,MAAM;YACT,OAAO,CAAC,CAAC,IAAI,CAAC;QAChB,KAAK,KAAK;YACR,OAAO,IAAI,eAAe,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;QACtC,KAAK,KAAK;YACR,OAAO,IAAI,eAAe,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,eAAe,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC;QACtE,KAAK,IAAI;YACP,OAAO,IAAI,eAAe,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,eAAe,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC;QACtE,KAAK,SAAS;YACZ,OAAO,IAAI,eAAe,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,eAAe,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC;QACvE,KAAK,KAAK;YACR,OAAO,IAAI,eAAe,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,eAAe,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC;IAC1E,CAAC;AACH,CAAC"}

package/dist/belief-revision/sat.d.ts

@@ -0,0 +1,19 @@
+import type { PropFormula } from './types';
+export type Valuation = Record<string, boolean>;
+/** Evalúa una fórmula bajo una valuación clásica. */
+export declare function evalFormula(f: PropFormula, v: Valuation): boolean;
+/**
+ * ¿Es satisfactible la conjunción de `formulas`?
+ * Conjunto vacío → trivialmente satisfactible.
+ */
+export declare function isSatisfiable(formulas: PropFormula[]): boolean;
+/**
+ * ¿K (conjunción de fórmulas) implica φ?
+ * Equivalente a: K ∧ ¬φ es insatisfactible.
+ */
+export declare function entailsFormula(K: PropFormula[], phi: PropFormula): boolean;
+/**
+ * ¿Son φ y ψ lógicamente equivalentes? (φ ↔ ψ es tautología)
+ */
+export declare function areEquivalent(a: PropFormula, b: PropFormula): boolean;
+//# sourceMappingURL=sat.d.ts.map

package/dist/belief-revision/sat.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sat.d.ts","sourceRoot":"","sources":["../../src/belief-revision/sat.ts"],"names":[],"mappings":"AASA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,SAAS,CAAC;AAG3C,MAAM,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;AAEhD,qDAAqD;AACrD,wBAAgB,WAAW,CAAC,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE,SAAS,GAAG,OAAO,CAmBjE;AAsBD;;;GAGG;AACH,wBAAgB,aAAa,CAAC,QAAQ,EAAE,WAAW,EAAE,GAAG,OAAO,CAU9D;AAED;;;GAGG;AACH,wBAAgB,cAAc,CAAC,CAAC,EAAE,WAAW,EAAE,EAAE,GAAG,EAAE,WAAW,GAAG,OAAO,CAG1E;AAED;;GAEG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE,WAAW,GAAG,OAAO,CAIrE"}