@stevenvo780/st-lang 4.1.0 → 4.3.0

package/dist/profiles/ctl/witness.js

@@ -0,0 +1,149 @@
+"use strict";
+// ============================================================
+// Witness paths para fórmulas CTL existenciales.
+// ============================================================
+// Solo los operadores existenciales (EX, EF, EG, EU) admiten witness:
+// para AX/AF/AG/AU el "testigo" sería el modelo entero (no hay un
+// único camino que justifique la propiedad). Si el caller pide
+// witness para una fórmula universal devolvemos `null`.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.generateWitness = generateWitness;
+const check_1 = require("./check");
+function compile(M) {
+    const states = new Set();
+    const succ = new Map();
+    const labels = new Map();
+    for (const s of M.states) {
+        states.add(s.id);
+        succ.set(s.id, new Set());
+        labels.set(s.id, new Set(s.labels));
+    }
+    for (const [from, to] of M.transitions) {
+        succ.get(from)?.add(to);
+    }
+    return { states, succ, labels };
+}
+function bfsTo(model, start, isGoal, isStep = () => true, allowStartAsGoal = true) {
+    if (allowStartAsGoal && isGoal(start))
+        return [start];
+    const visited = new Set([start]);
+    const parent = new Map();
+    const queue = [start];
+    while (queue.length > 0) {
+        const cur = queue.shift();
+        for (const s of model.succ.get(cur) ?? []) {
+            if (visited.has(s))
+                continue;
+            visited.add(s);
+            parent.set(s, cur);
+            if (isGoal(s)) {
+                const path = [s];
+                let p = cur;
+                while (p !== undefined) {
+                    path.push(p);
+                    p = parent.get(p);
+                }
+                return path.reverse();
+            }
+            if (isStep(s))
+                queue.push(s);
+        }
+    }
+    return null;
+}
+/**
+ * Encuentra un camino testigo finito (`stateId[]`) que justifique
+ * que `phi` se cumple en `state`. Devuelve `null` si:
+ *  - `phi` no se cumple en `state`, o
+ *  - `phi` es universal (AX/AF/AG/AU) — no admite un único witness path, o
+ *  - `state` no existe en el modelo.
+ *
+ * Convenciones del path devuelto:
+ *  - EX φ        → `[state, next]` con `next ⊨ φ`.
+ *  - EF φ        → camino más corto desde `state` hasta un estado con `φ`.
+ *  - EG φ        → camino que entra en un ciclo de estados con `φ`;
+ *                  el último elemento del camino aparece dos veces para
+ *                  marcar el lazo (lasso witness).
+ *  - E[A U B]    → camino donde todos los intermedios cumplen A y el
+ *                  último cumple B.
+ *  - cualquier otro operador no existencial → `null`.
+ */
+function generateWitness(M, phi, state) {
+    const model = compile(M);
+    if (!model.states.has(state))
+        return null;
+    // Solo damos witness cuando φ se cumple efectivamente.
+    const sat = (0, check_1.modelCheckCTL)(M, phi);
+    if (!sat.get(state))
+        return null;
+    switch (phi.kind) {
+        case 'EX': {
+            const subSat = (0, check_1.modelCheckCTL)(M, phi.arg);
+            for (const s of model.succ.get(state) ?? []) {
+                if (subSat.get(s))
+                    return [state, s];
+            }
+            return null;
+        }
+        case 'EF': {
+            const subSat = (0, check_1.modelCheckCTL)(M, phi.arg);
+            return bfsTo(model, state, (id) => subSat.get(id) === true);
+        }
+        case 'EU': {
+            const aSat = (0, check_1.modelCheckCTL)(M, phi.left);
+            const bSat = (0, check_1.modelCheckCTL)(M, phi.right);
+            // Si state ya cumple B, devolvemos camino trivial.
+            if (bSat.get(state))
+                return [state];
+            // Caminos donde los intermedios cumplen A; el goal cumple B.
+            if (!aSat.get(state))
+                return null;
+            return bfsTo(model, state, (id) => bSat.get(id) === true, (id) => aSat.get(id) === true, false);
+        }
+        case 'EG': {
+            const subSat = (0, check_1.modelCheckCTL)(M, phi.arg);
+            // EG φ ⇔ existe camino infinito desde state con φ siempre.
+            // En modelos finitos esto equivale a alcanzar un ciclo donde todos los
+            // estados del ciclo cumplen φ, pasando por estados que también cumplen φ.
+            const egSat = sat; // sat[state] true → existe tal camino
+            // Encontrar el camino lazo: BFS desde state por estados que cumplen
+            // EG φ, hasta llegar a un estado desde el cual se cierre un ciclo.
+            if (!subSat.get(state) || !egSat.get(state))
+                return null;
+            // DFS para encontrar un ciclo dentro del sub-grafo {s : EG φ holds}.
+            const inSubgraph = (id) => egSat.get(id) === true && subSat.get(id) === true;
+            const stack = [state];
+            const onStack = new Set([state]);
+            const visited = new Set([state]);
+            const result = dfsLasso(model, state, inSubgraph, stack, onStack, visited);
+            return result;
+        }
+        default:
+            return null;
+    }
+}
+function dfsLasso(model, current, inSubgraph, stack, onStack, visited) {
+    for (const s of model.succ.get(current) ?? []) {
+        if (!inSubgraph(s))
+            continue;
+        if (onStack.has(s)) {
+            // Encontramos un back-edge: stack contiene path hasta `current`,
+            // y `s` está en stack → ciclo desde s.
+            const path = [...stack, s];
+            return path;
+        }
+        if (visited.has(s))
+            continue;
+        visited.add(s);
+        stack.push(s);
+        onStack.add(s);
+        const r = dfsLasso(model, s, inSubgraph, stack, onStack, visited);
+        if (r)
+            return r;
+        stack.pop();
+        onStack.delete(s);
+    }
+    return null;
+}
+//# sourceMappingURL=witness.js.map

package/dist/profiles/ctl/witness.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"witness.js","sourceRoot":"","sources":["../../../src/profiles/ctl/witness.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,iDAAiD;AACjD,+DAA+D;AAC/D,sEAAsE;AACtE,kEAAkE;AAClE,+DAA+D;AAC/D,wDAAwD;AACxD,+DAA+D;;AA2E/D,0CA2DC;AApID,mCAAwC;AASxC,SAAS,OAAO,CAAC,CAAkB;IACjC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;IACjC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAuB,CAAC;IAC5C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAuB,CAAC;IAC9C,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC;QACzB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACjB,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QAC1B,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;IACtC,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC;QACvC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;IAC1B,CAAC;IACD,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;AAClC,CAAC;AAED,SAAS,KAAK,CACZ,KAAoB,EACpB,KAAa,EACb,MAA+B,EAC/B,SAAkC,GAAG,EAAE,CAAC,IAAI,EAC5C,gBAAgB,GAAG,IAAI;IAEvB,IAAI,gBAAgB,IAAI,MAAM,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,KAAK,CAAC,CAAC;IACtD,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,CAAC,KAAK,CAAC,CAAC,CAAC;IACzC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,MAAM,KAAK,GAAa,CAAC,KAAK,CAAC,CAAC;IAChC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAC3B,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC;YAC1C,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,SAAS;YAC7B,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACf,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;YACnB,IAAI,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;gBACd,MAAM,IAAI,GAAa,CAAC,CAAC,CAAC,CAAC;gBAC3B,IAAI,CAAC,GAAuB,GAAG,CAAC;gBAChC,OAAO,CAAC,KAAK,SAAS,EAAE,CAAC;oBACvB,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;oBACb,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACpB,CAAC;gBACD,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC;YACxB,CAAC;YACD,IAAI,MAAM,CAAC,CAAC,CAAC;gBAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC/B,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,SAAgB,eAAe,CAC7B,CAAkB,EAClB,GAAe,EACf,KAAa;IAEb,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;IACzB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAE1C,uDAAuD;IACvD,MAAM,GAAG,GAAG,IAAA,qBAAa,EAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IAClC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAEjC,QAAQ,GAAG,CAAC,IAAI,EAAE,CAAC;QACjB,KAAK,IAAI,CAAC,CAAC,CAAC;YACV,MAAM,MAAM,GAAG,IAAA,qBAAa,EAAC,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;YACzC,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;gBAC5C,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;oBAAE,OAAO,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YACvC,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC;QACD,KAAK,IAAI,CAAC,CAAC,CAAC;YACV,MAAM,MAAM,GAAG,IAAA,qBAAa,EAAC,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;YACzC,OAAO,KAAK,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,IAAI,CAAC,CAAC;QAC9D,CAAC;QACD,KAAK,IAAI,CAAC,CAAC,CAAC;YACV,MAAM,IAAI,GAAG,IAAA,qBAAa,EAAC,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC;YACxC,MAAM,IAAI,GAAG,IAAA,qBAAa,EAAC,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC;YACzC,mDAAmD;YACnD,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC;gBAAE,OAAO,CAAC,KAAK,CAAC,CAAC;YACpC,6DAA6D;YAC7D,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC;gBAAE,OAAO,IAAI,CAAC;YAClC,OAAO,KAAK,CACV,KAAK,EACL,KAAK,EACL,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,IAAI,EAC7B,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,IAAI,EAC7B,KAAK,CACN,CAAC;QACJ,CAAC;QACD,KAAK,IAAI,CAAC,CAAC,CAAC;YACV,MAAM,MAAM,GAAG,IAAA,qBAAa,EAAC,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;YACzC,2DAA2D;YAC3D,uEAAuE;YACvE,0EAA0E;YAC1E,MAAM,KAAK,GAAG,GAAG,CAAC,CAAC,sCAAsC;YACzD,oEAAoE;YACpE,mEAAmE;YACnE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC;gBAAE,OAAO,IAAI,CAAC;YACzD,qEAAqE;YACrE,MAAM,UAAU,GAAG,CAAC,EAAU,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,IAAI,IAAI,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,IAAI,CAAC;YACrF,MAAM,KAAK,GAAa,CAAC,KAAK,CAAC,CAAC;YAChC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,CAAC,KAAK,CAAC,CAAC,CAAC;YACzC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,CAAC,KAAK,CAAC,CAAC,CAAC;YACzC,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,EAAE,KAAK,EAAE,UAAU,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;YAC3E,OAAO,MAAM,CAAC;QAChB,CAAC;QACD;YACE,OAAO,IAAI,CAAC;IAChB,CAAC;AACH,CAAC;AAED,SAAS,QAAQ,CACf,KAAoB,EACpB,OAAe,EACf,UAAmC,EACnC,KAAe,EACf,OAAoB,EACpB,OAAoB;IAEpB,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC;QAC9C,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;YAAE,SAAS;QAC7B,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YACnB,iEAAiE;YACjE,uCAAuC;YACvC,MAAM,IAAI,GAAG,CAAC,GAAG,KAAK,EAAE,CAAC,CAAC,CAAC;YAC3B,OAAO,IAAI,CAAC;QACd,CAAC;QACD,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,SAAS;QAC7B,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACf,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACf,MAAM,CAAC,GAAG,QAAQ,CAAC,KAAK,EAAE,CAAC,EAAE,UAAU,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;QAClE,IAAI,CAAC;YAAE,OAAO,CAAC,CAAC;QAChB,KAAK,CAAC,GAAG,EAAE,CAAC;QACZ,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACpB,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC"}

package/dist/profiles/default-logic/entailment.d.ts

@@ -0,0 +1,14 @@
+import { DefaultTheory, Extension, ComputeOptions } from './types';
+/** Comprueba si el literal está en la extensión dada. */
+export declare function isInExtension(formula: string, ext: Extension): boolean;
+/**
+ * Entailment escéptico: el literal está en TODAS las extensiones.
+ * Si la teoría no tiene extensiones, devuelve false (entailment vacuo
+ * tampoco — la convención usual es no afirmar nada sin testigos).
+ */
+export declare function isSkepticallyEntailed(formula: string, T: DefaultTheory, options?: ComputeOptions): boolean;
+/**
+ * Entailment crédulo: el literal está en AL MENOS una extensión.
+ */
+export declare function isCredulouslyEntailed(formula: string, T: DefaultTheory, options?: ComputeOptions): boolean;
+//# sourceMappingURL=entailment.d.ts.map

package/dist/profiles/default-logic/entailment.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"entailment.d.ts","sourceRoot":"","sources":["../../../src/profiles/default-logic/entailment.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,aAAa,EAAE,SAAS,EAAE,cAAc,EAAE,MAAM,SAAS,CAAC;AAGnE,yDAAyD;AACzD,wBAAgB,aAAa,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,EAAE,SAAS,GAAG,OAAO,CAEtE;AAED;;;;GAIG;AACH,wBAAgB,qBAAqB,CACnC,OAAO,EAAE,MAAM,EACf,CAAC,EAAE,aAAa,EAChB,OAAO,GAAE,cAAmB,GAC3B,OAAO,CAKT;AAED;;GAEG;AACH,wBAAgB,qBAAqB,CACnC,OAAO,EAAE,MAAM,EACf,CAAC,EAAE,aAAa,EAChB,OAAO,GAAE,cAAmB,GAC3B,OAAO,CAKT"}

package/dist/profiles/default-logic/entailment.js

@@ -0,0 +1,36 @@
+"use strict";
+// ============================================================
+// ST Default Logic (Reiter) — Entailment credulous/skeptical
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.isInExtension = isInExtension;
+exports.isSkepticallyEntailed = isSkepticallyEntailed;
+exports.isCredulouslyEntailed = isCredulouslyEntailed;
+const extensions_1 = require("./extensions");
+/** Comprueba si el literal está en la extensión dada. */
+function isInExtension(formula, ext) {
+    return ext.formulas.has((0, extensions_1.normalizeLiteral)(formula));
+}
+/**
+ * Entailment escéptico: el literal está en TODAS las extensiones.
+ * Si la teoría no tiene extensiones, devuelve false (entailment vacuo
+ * tampoco — la convención usual es no afirmar nada sin testigos).
+ */
+function isSkepticallyEntailed(formula, T, options = {}) {
+    const exts = (0, extensions_1.computeExtensions)(T, options);
+    if (exts.length === 0)
+        return false;
+    const target = (0, extensions_1.normalizeLiteral)(formula);
+    return exts.every((e) => e.formulas.has(target));
+}
+/**
+ * Entailment crédulo: el literal está en AL MENOS una extensión.
+ */
+function isCredulouslyEntailed(formula, T, options = {}) {
+    const exts = (0, extensions_1.computeExtensions)(T, options);
+    if (exts.length === 0)
+        return false;
+    const target = (0, extensions_1.normalizeLiteral)(formula);
+    return exts.some((e) => e.formulas.has(target));
+}
+//# sourceMappingURL=entailment.js.map

package/dist/profiles/default-logic/entailment.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"entailment.js","sourceRoot":"","sources":["../../../src/profiles/default-logic/entailment.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,6DAA6D;AAC7D,+DAA+D;;AAM/D,sCAEC;AAOD,sDASC;AAKD,sDASC;AAnCD,6CAAmE;AAEnE,yDAAyD;AACzD,SAAgB,aAAa,CAAC,OAAe,EAAE,GAAc;IAC3D,OAAO,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAA,6BAAgB,EAAC,OAAO,CAAC,CAAC,CAAC;AACrD,CAAC;AAED;;;;GAIG;AACH,SAAgB,qBAAqB,CACnC,OAAe,EACf,CAAgB,EAChB,UAA0B,EAAE;IAE5B,MAAM,IAAI,GAAG,IAAA,8BAAiB,EAAC,CAAC,EAAE,OAAO,CAAC,CAAC;IAC3C,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IACpC,MAAM,MAAM,GAAG,IAAA,6BAAgB,EAAC,OAAO,CAAC,CAAC;IACzC,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;AACnD,CAAC;AAED;;GAEG;AACH,SAAgB,qBAAqB,CACnC,OAAe,EACf,CAAgB,EAChB,UAA0B,EAAE;IAE5B,MAAM,IAAI,GAAG,IAAA,8BAAiB,EAAC,CAAC,EAAE,OAAO,CAAC,CAAC;IAC3C,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IACpC,MAAM,MAAM,GAAG,IAAA,6BAAgB,EAAC,OAAO,CAAC,CAAC;IACzC,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;AAClD,CAAC"}

package/dist/profiles/default-logic/extensions.d.ts

@@ -0,0 +1,35 @@
+import { DefaultTheory, Extension, ComputeOptions } from './types';
+/**
+ * Normaliza un literal a forma canónica:
+ *   "P", "p"           → "P"
+ *   "¬P", "!P", "~P",
+ *   "not P", " ¬  P "  → "¬P"
+ * Quita espacios extra; preserva mayúsculas/minúsculas internas
+ * tras el primer carácter (case-sensitive para predicados FOL como
+ * "flies(tweety)" vs "Flies(tweety)").
+ */
+export declare function normalizeLiteral(lit: string): string;
+/** Devuelve la negación canónica de un literal normalizado. */
+export declare function negate(lit: string): string;
+/** Verifica si un conjunto de literales es consistente (no contiene L y ¬L). */
+export declare function isConsistent(beliefs: ReadonlySet<string>): boolean;
+/**
+ * Comprueba si una justificación β es consistente con las creencias:
+ * basta con que ¬β no esté en el conjunto.
+ */
+export declare function isJustificationConsistent(justification: string, beliefs: ReadonlySet<string>): boolean;
+/**
+ * Calcula todas las extensiones de la teoría enumerando órdenes de
+ * aplicación de defaults y verificando que el resultado sea un punto
+ * fijo del operador Γ_T.
+ *
+ * Estrategia: para cada subconjunto de defaults, intentamos aplicarlos
+ * en algún orden. Como en v1 trabajamos con literales y la aplicación
+ * de un default no se desbloquea por reordering una vez fijado el
+ * subconjunto consistente, basta enumerar subconjuntos maximales
+ * generables por forward-close empezando desde cada permutación
+ * heurística. Para acotar costo: probamos todas las permutaciones
+ * cuando |defaults| ≤ 6, y un sampling determinista si excede.
+ */
+export declare function computeExtensions(T: DefaultTheory, options?: ComputeOptions): Extension[];
+//# sourceMappingURL=extensions.d.ts.map

package/dist/profiles/default-logic/extensions.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"extensions.d.ts","sourceRoot":"","sources":["../../../src/profiles/default-logic/extensions.ts"],"names":[],"mappings":"AAIA,OAAO,EAEL,aAAa,EACb,SAAS,EACT,cAAc,EAGf,MAAM,SAAS,CAAC;AAEjB;;;;;;;;GAQG;AACH,wBAAgB,gBAAgB,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CA0CpD;AAED,+DAA+D;AAC/D,wBAAgB,MAAM,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAG1C;AAED,gFAAgF;AAChF,wBAAgB,YAAY,CAAC,OAAO,EAAE,WAAW,CAAC,MAAM,CAAC,GAAG,OAAO,CAKlE;AAED;;;GAGG;AACH,wBAAgB,yBAAyB,CACvC,aAAa,EAAE,MAAM,EACrB,OAAO,EAAE,WAAW,CAAC,MAAM,CAAC,GAC3B,OAAO,CAET;AA0ID;;;;;;;;;;;;GAYG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,aAAa,EAAE,OAAO,GAAE,cAAmB,GAAG,SAAS,EAAE,CAqD7F"}

package/dist/profiles/default-logic/extensions.js

@@ -0,0 +1,276 @@
+"use strict";
+// ============================================================
+// ST Default Logic (Reiter) — Cálculo de extensiones
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.normalizeLiteral = normalizeLiteral;
+exports.negate = negate;
+exports.isConsistent = isConsistent;
+exports.isJustificationConsistent = isJustificationConsistent;
+exports.computeExtensions = computeExtensions;
+const types_1 = require("./types");
+/**
+ * Normaliza un literal a forma canónica:
+ *   "P", "p"           → "P"
+ *   "¬P", "!P", "~P",
+ *   "not P", " ¬  P "  → "¬P"
+ * Quita espacios extra; preserva mayúsculas/minúsculas internas
+ * tras el primer carácter (case-sensitive para predicados FOL como
+ * "flies(tweety)" vs "Flies(tweety)").
+ */
+function normalizeLiteral(lit) {
+    const trimmed = lit.trim();
+    if (trimmed === '') {
+        throw new Error('Literal vacío');
+    }
+    // Detectar prefijos de negación
+    const negPrefixes = ['¬', '!', '~'];
+    const notWordRe = /^not\s+/i;
+    let isNeg = false;
+    let body = trimmed;
+    // Pelar múltiples negaciones (doble negación cancela)
+    while (true) {
+        let stripped = false;
+        for (const p of negPrefixes) {
+            if (body.startsWith(p)) {
+                body = body.slice(p.length).trim();
+                isNeg = !isNeg;
+                stripped = true;
+                break;
+            }
+        }
+        if (!stripped) {
+            const m = body.match(notWordRe);
+            if (m) {
+                body = body.slice(m[0].length).trim();
+                isNeg = !isNeg;
+                stripped = true;
+            }
+        }
+        if (!stripped)
+            break;
+    }
+    // Normalizar espacios internos en el cuerpo
+    body = body.replace(/\s+/g, '');
+    if (body === '') {
+        throw new Error(`Literal sin átomo: "${lit}"`);
+    }
+    return isNeg ? `¬${body}` : body;
+}
+/** Devuelve la negación canónica de un literal normalizado. */
+function negate(lit) {
+    const norm = normalizeLiteral(lit);
+    return norm.startsWith('¬') ? norm.slice(1) : `¬${norm}`;
+}
+/** Verifica si un conjunto de literales es consistente (no contiene L y ¬L). */
+function isConsistent(beliefs) {
+    for (const lit of beliefs) {
+        if (beliefs.has(negate(lit)))
+            return false;
+    }
+    return true;
+}
+/**
+ * Comprueba si una justificación β es consistente con las creencias:
+ * basta con que ¬β no esté en el conjunto.
+ */
+function isJustificationConsistent(justification, beliefs) {
+    return !beliefs.has(negate(justification));
+}
+function normalizeDefault(d) {
+    return {
+        id: d.id,
+        prerequisite: normalizeLiteral(d.prerequisite),
+        justifications: d.justifications.map(normalizeLiteral),
+        consequent: normalizeLiteral(d.consequent),
+    };
+}
+function normalizeTheory(T, opts) {
+    const maxDefaults = opts.maxDefaults ?? types_1.DEFAULT_MAX_DEFAULTS;
+    if (T.defaults.length > maxDefaults) {
+        throw new Error(`Teoría con ${T.defaults.length} defaults excede el límite (${maxDefaults}). ` +
+            `Pase maxDefaults explícitamente si la teoría es legítima.`);
+    }
+    // Detectar IDs duplicados (rompería el seguimiento de extensiones)
+    const seen = new Set();
+    for (const d of T.defaults) {
+        if (seen.has(d.id)) {
+            throw new Error(`ID de default duplicado: "${d.id}"`);
+        }
+        seen.add(d.id);
+    }
+    const facts = new Set(T.facts.map(normalizeLiteral));
+    if (!isConsistent(facts)) {
+        throw new Error('Facts inconsistentes (contienen un literal y su negación)');
+    }
+    return {
+        facts,
+        defaults: T.defaults.map(normalizeDefault),
+    };
+}
+/**
+ * Aplica todos los defaults posibles a partir de un conjunto de creencias,
+ * en orden de prioridad por índice. Devuelve el cierre forward y los
+ * defaults aplicados. Esta función es determinista para una secuencia fija
+ * de defaults, no enumera ramas.
+ */
+function forwardClose(initial, defaults, order) {
+    const beliefs = new Set(initial);
+    const applied = [];
+    const usedIdx = new Set();
+    let changed = true;
+    while (changed) {
+        changed = false;
+        for (const idx of order) {
+            if (usedIdx.has(idx))
+                continue;
+            const d = defaults[idx];
+            if (!beliefs.has(d.prerequisite))
+                continue;
+            // Todas las justificaciones consistentes con las creencias actuales
+            if (!d.justifications.every((j) => isJustificationConsistent(j, beliefs)))
+                continue;
+            // Aplicar
+            const next = new Set(beliefs);
+            next.add(d.consequent);
+            if (!isConsistent(next))
+                continue; // el consequent no debe romper consistencia
+            beliefs.add(d.consequent);
+            applied.push(d.id);
+            usedIdx.add(idx);
+            changed = true;
+        }
+    }
+    return { beliefs, applied };
+}
+/**
+ * Verifica que un conjunto candidato E sea efectivamente una extensión
+ * de la teoría: usando E como contexto de consistencia, los defaults que
+ * disparan generan exactamente las creencias de E.
+ *
+ * Esta es la definición de punto fijo de Reiter (operador Γ): E es
+ * extensión si Γ_T(E) = E.
+ */
+function isExtension(candidate, appliedIds, facts, defaults) {
+    // Construir Γ_T(E): facts + consequents de los defaults cuyas
+    // justificaciones son consistentes con E.
+    const gamma = new Set(facts);
+    // Punto fijo monótono: reaplicar hasta estabilizar (necesario porque
+    // el prerequisite de un default puede ser el consequent de otro).
+    let changed = true;
+    const usedForGamma = new Set();
+    while (changed) {
+        changed = false;
+        for (const d of defaults) {
+            if (usedForGamma.has(d.id))
+                continue;
+            if (!gamma.has(d.prerequisite))
+                continue;
+            // Justificaciones se chequean contra el candidato E (definición Reiter)
+            if (!d.justifications.every((j) => isJustificationConsistent(j, candidate)))
+                continue;
+            gamma.add(d.consequent);
+            usedForGamma.add(d.id);
+            changed = true;
+        }
+    }
+    // E es extensión sii Γ_T(E) = E
+    if (gamma.size !== candidate.size)
+        return false;
+    for (const lit of gamma) {
+        if (!candidate.has(lit))
+            return false;
+    }
+    // Coherencia: los defaults aplicados deben coincidir con los que Γ usó
+    if (usedForGamma.size !== appliedIds.size)
+        return false;
+    for (const id of usedForGamma) {
+        if (!appliedIds.has(id))
+            return false;
+    }
+    return true;
+}
+/**
+ * Calcula todas las extensiones de la teoría enumerando órdenes de
+ * aplicación de defaults y verificando que el resultado sea un punto
+ * fijo del operador Γ_T.
+ *
+ * Estrategia: para cada subconjunto de defaults, intentamos aplicarlos
+ * en algún orden. Como en v1 trabajamos con literales y la aplicación
+ * de un default no se desbloquea por reordering una vez fijado el
+ * subconjunto consistente, basta enumerar subconjuntos maximales
+ * generables por forward-close empezando desde cada permutación
+ * heurística. Para acotar costo: probamos todas las permutaciones
+ * cuando |defaults| ≤ 6, y un sampling determinista si excede.
+ */
+function computeExtensions(T, options = {}) {
+    const opts = { ...options };
+    const { facts, defaults } = normalizeTheory(T, opts);
+    const maxExt = opts.maxExtensions ?? types_1.DEFAULT_MAX_EXTENSIONS;
+    if (defaults.length === 0) {
+        return [{ formulas: new Set(facts), appliedDefaults: [] }];
+    }
+    // Conjunto candidato → extension
+    const candidates = new Map();
+    const tryOrder = (order) => {
+        const { beliefs, applied } = forwardClose(facts, defaults, order);
+        const appliedSet = new Set(applied);
+        if (!isExtension(beliefs, appliedSet, facts, defaults))
+            return;
+        const key = signatureOf(beliefs);
+        if (candidates.has(key))
+            return;
+        candidates.set(key, {
+            formulas: beliefs,
+            appliedDefaults: applied,
+        });
+    };
+    const n = defaults.length;
+    if (n <= 6) {
+        // Enumerar todas las permutaciones
+        const idx = Array.from({ length: n }, (_, i) => i);
+        for (const perm of permutations(idx)) {
+            if (candidates.size >= maxExt)
+                break;
+            tryOrder(perm);
+        }
+    }
+    else {
+        // Heurística: para cada default, intentarlo primero. Esto cubre la
+        // típica explosión "Nixon diamond" donde el orden inicial decide qué
+        // default queda bloqueado por inconsistencia.
+        const base = Array.from({ length: n }, (_, i) => i);
+        tryOrder(base);
+        for (let i = 0; i < n && candidates.size < maxExt; i++) {
+            const order = [i, ...base.filter((j) => j !== i)];
+            tryOrder(order);
+        }
+        // Y todos los pares (i,j) como prefijo
+        for (let i = 0; i < n && candidates.size < maxExt; i++) {
+            for (let j = 0; j < n && candidates.size < maxExt; j++) {
+                if (i === j)
+                    continue;
+                const order = [i, j, ...base.filter((k) => k !== i && k !== j)];
+                tryOrder(order);
+            }
+        }
+    }
+    return Array.from(candidates.values());
+}
+function signatureOf(set) {
+    return Array.from(set).sort().join('|');
+}
+function* permutations(arr) {
+    if (arr.length <= 1) {
+        yield arr.slice();
+        return;
+    }
+    for (let i = 0; i < arr.length; i++) {
+        const head = arr[i];
+        const rest = [...arr.slice(0, i), ...arr.slice(i + 1)];
+        for (const sub of permutations(rest)) {
+            yield [head, ...sub];
+        }
+    }
+}
+//# sourceMappingURL=extensions.js.map

package/dist/profiles/default-logic/extensions.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"extensions.js","sourceRoot":"","sources":["../../../src/profiles/default-logic/extensions.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,qDAAqD;AACrD,+DAA+D;;AAoB/D,4CA0CC;AAGD,wBAGC;AAGD,oCAKC;AAMD,8DAKC;AAuJD,8CAqDC;AAjSD,mCAOiB;AAEjB;;;;;;;;GAQG;AACH,SAAgB,gBAAgB,CAAC,GAAW;IAC1C,MAAM,OAAO,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC;IAC3B,IAAI,OAAO,KAAK,EAAE,EAAE,CAAC;QACnB,MAAM,IAAI,KAAK,CAAC,eAAe,CAAC,CAAC;IACnC,CAAC;IAED,gCAAgC;IAChC,MAAM,WAAW,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;IACpC,MAAM,SAAS,GAAG,UAAU,CAAC;IAE7B,IAAI,KAAK,GAAG,KAAK,CAAC;IAClB,IAAI,IAAI,GAAG,OAAO,CAAC;IAEnB,sDAAsD;IACtD,OAAO,IAAI,EAAE,CAAC;QACZ,IAAI,QAAQ,GAAG,KAAK,CAAC;QACrB,KAAK,MAAM,CAAC,IAAI,WAAW,EAAE,CAAC;YAC5B,IAAI,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC;gBACvB,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC;gBACnC,KAAK,GAAG,CAAC,KAAK,CAAC;gBACf,QAAQ,GAAG,IAAI,CAAC;gBAChB,MAAM;YACR,CAAC;QACH,CAAC;QACD,IAAI,CAAC,QAAQ,EAAE,CAAC;YACd,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;YAChC,IAAI,CAAC,EAAE,CAAC;gBACN,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC;gBACtC,KAAK,GAAG,CAAC,KAAK,CAAC;gBACf,QAAQ,GAAG,IAAI,CAAC;YAClB,CAAC;QACH,CAAC;QACD,IAAI,CAAC,QAAQ;YAAE,MAAM;IACvB,CAAC;IAED,4CAA4C;IAC5C,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;IAChC,IAAI,IAAI,KAAK,EAAE,EAAE,CAAC;QAChB,MAAM,IAAI,KAAK,CAAC,uBAAuB,GAAG,GAAG,CAAC,CAAC;IACjD,CAAC;IAED,OAAO,KAAK,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;AACnC,CAAC;AAED,+DAA+D;AAC/D,SAAgB,MAAM,CAAC,GAAW;IAChC,MAAM,IAAI,GAAG,gBAAgB,CAAC,GAAG,CAAC,CAAC;IACnC,OAAO,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC;AAC3D,CAAC;AAED,gFAAgF;AAChF,SAAgB,YAAY,CAAC,OAA4B;IACvD,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;QAC1B,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;IAC7C,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;GAGG;AACH,SAAgB,yBAAyB,CACvC,aAAqB,EACrB,OAA4B;IAE5B,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC;AAC7C,CAAC;AASD,SAAS,gBAAgB,CAAC,CAAc;IACtC,OAAO;QACL,EAAE,EAAE,CAAC,CAAC,EAAE;QACR,YAAY,EAAE,gBAAgB,CAAC,CAAC,CAAC,YAAY,CAAC;QAC9C,cAAc,EAAE,CAAC,CAAC,cAAc,CAAC,GAAG,CAAC,gBAAgB,CAAC;QACtD,UAAU,EAAE,gBAAgB,CAAC,CAAC,CAAC,UAAU,CAAC;KAC3C,CAAC;AACJ,CAAC;AAED,SAAS,eAAe,CACtB,CAAgB,EAChB,IAAoB;IAKpB,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,IAAI,4BAAoB,CAAC;IAC7D,IAAI,CAAC,CAAC,QAAQ,CAAC,MAAM,GAAG,WAAW,EAAE,CAAC;QACpC,MAAM,IAAI,KAAK,CACb,cAAc,CAAC,CAAC,QAAQ,CAAC,MAAM,+BAA+B,WAAW,KAAK;YAC5E,2DAA2D,CAC9D,CAAC;IACJ,CAAC;IAED,mEAAmE;IACnE,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;QAC3B,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;YACnB,MAAM,IAAI,KAAK,CAAC,6BAA6B,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QACxD,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACjB,CAAC;IAED,MAAM,KAAK,GAAG,IAAI,GAAG,CAAS,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,gBAAgB,CAAC,CAAC,CAAC;IAC7D,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC;QACzB,MAAM,IAAI,KAAK,CAAC,2DAA2D,CAAC,CAAC;IAC/E,CAAC;IAED,OAAO;QACL,KAAK;QACL,QAAQ,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,gBAAgB,CAAC;KAC3C,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,SAAS,YAAY,CACnB,OAA4B,EAC5B,QAA6B,EAC7B,KAAe;IAEf,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,OAAO,CAAC,CAAC;IACzC,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAElC,IAAI,OAAO,GAAG,IAAI,CAAC;IACnB,OAAO,OAAO,EAAE,CAAC;QACf,OAAO,GAAG,KAAK,CAAC;QAChB,KAAK,MAAM,GAAG,IAAI,KAAK,EAAE,CAAC;YACxB,IAAI,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,SAAS;YAC/B,MAAM,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC;YACxB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,YAAY,CAAC;gBAAE,SAAS;YAC3C,oEAAoE;YACpE,IAAI,CAAC,CAAC,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,yBAAyB,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;gBAAE,SAAS;YACpF,UAAU;YACV,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC;YAC9B,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;YACvB,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC;gBAAE,SAAS,CAAC,4CAA4C;YAC/E,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;YAC1B,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACnB,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACjB,OAAO,GAAG,IAAI,CAAC;QACjB,CAAC;IACH,CAAC;IAED,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC;AAC9B,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,WAAW,CAClB,SAA8B,EAC9B,UAA+B,EAC/B,KAA0B,EAC1B,QAA6B;IAE7B,8DAA8D;IAC9D,0CAA0C;IAC1C,MAAM,KAAK,GAAG,IAAI,GAAG,CAAS,KAAK,CAAC,CAAC;IACrC,qEAAqE;IACrE,kEAAkE;IAClE,IAAI,OAAO,GAAG,IAAI,CAAC;IACnB,MAAM,YAAY,GAAG,IAAI,GAAG,EAAU,CAAC;IACvC,OAAO,OAAO,EAAE,CAAC;QACf,OAAO,GAAG,KAAK,CAAC;QAChB,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YACzB,IAAI,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBAAE,SAAS;YACrC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,YAAY,CAAC;gBAAE,SAAS;YACzC,wEAAwE;YACxE,IAAI,CAAC,CAAC,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,yBAAyB,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;gBAAE,SAAS;YACtF,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;YACxB,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACvB,OAAO,GAAG,IAAI,CAAC;QACjB,CAAC;IACH,CAAC;IAED,gCAAgC;IAChC,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS,CAAC,IAAI;QAAE,OAAO,KAAK,CAAC;IAChD,KAAK,MAAM,GAAG,IAAI,KAAK,EAAE,CAAC;QACxB,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,OAAO,KAAK,CAAC;IACxC,CAAC;IACD,uEAAuE;IACvE,IAAI,YAAY,CAAC,IAAI,KAAK,UAAU,CAAC,IAAI;QAAE,OAAO,KAAK,CAAC;IACxD,KAAK,MAAM,EAAE,IAAI,YAAY,EAAE,CAAC;QAC9B,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,OAAO,KAAK,CAAC;IACxC,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,SAAgB,iBAAiB,CAAC,CAAgB,EAAE,UAA0B,EAAE;IAC9E,MAAM,IAAI,GAAmB,EAAE,GAAG,OAAO,EAAE,CAAC;IAC5C,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,GAAG,eAAe,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IACrD,MAAM,MAAM,GAAG,IAAI,CAAC,aAAa,IAAI,8BAAsB,CAAC;IAE5D,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC1B,OAAO,CAAC,EAAE,QAAQ,EAAE,IAAI,GAAG,CAAC,KAAK,CAAC,EAAE,eAAe,EAAE,EAAE,EAAE,CAAC,CAAC;IAC7D,CAAC;IAED,iCAAiC;IACjC,MAAM,UAAU,GAAG,IAAI,GAAG,EAAqB,CAAC;IAEhD,MAAM,QAAQ,GAAG,CAAC,KAAe,EAAQ,EAAE;QACzC,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,GAAG,YAAY,CAAC,KAAK,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;QAClE,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC;QACpC,IAAI,CAAC,WAAW,CAAC,OAAO,EAAE,UAAU,EAAE,KAAK,EAAE,QAAQ,CAAC;YAAE,OAAO;QAC/D,MAAM,GAAG,GAAG,WAAW,CAAC,OAAO,CAAC,CAAC;QACjC,IAAI,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,OAAO;QAChC,UAAU,CAAC,GAAG,CAAC,GAAG,EAAE;YAClB,QAAQ,EAAE,OAAO;YACjB,eAAe,EAAE,OAAO;SACzB,CAAC,CAAC;IACL,CAAC,CAAC;IAEF,MAAM,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC;IAC1B,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;QACX,mCAAmC;QACnC,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;QACnD,KAAK,MAAM,IAAI,IAAI,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC;YACrC,IAAI,UAAU,CAAC,IAAI,IAAI,MAAM;gBAAE,MAAM;YACrC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACjB,CAAC;IACH,CAAC;SAAM,CAAC;QACN,mEAAmE;QACnE,qEAAqE;QACrE,8CAA8C;QAC9C,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;QACpD,QAAQ,CAAC,IAAI,CAAC,CAAC;QACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,UAAU,CAAC,IAAI,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACvD,MAAM,KAAK,GAAG,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAClD,QAAQ,CAAC,KAAK,CAAC,CAAC;QAClB,CAAC;QACD,uCAAuC;QACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,UAAU,CAAC,IAAI,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACvD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,UAAU,CAAC,IAAI,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACvD,IAAI,CAAC,KAAK,CAAC;oBAAE,SAAS;gBACtB,MAAM,KAAK,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBAChE,QAAQ,CAAC,KAAK,CAAC,CAAC;YAClB,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC,CAAC;AACzC,CAAC;AAED,SAAS,WAAW,CAAC,GAAwB;IAC3C,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AAC1C,CAAC;AAED,QAAQ,CAAC,CAAC,YAAY,CAAI,GAAiB;IACzC,IAAI,GAAG,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;QACpB,MAAM,GAAG,CAAC,KAAK,EAAE,CAAC;QAClB,OAAO;IACT,CAAC;IACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACpC,MAAM,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QACpB,MAAM,IAAI,GAAG,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACvD,KAAK,MAAM,GAAG,IAAI,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC;YACrC,MAAM,CAAC,IAAI,EAAE,GAAG,GAAG,CAAC,CAAC;QACvB,CAAC;IACH,CAAC;AACH,CAAC"}

package/dist/profiles/default-logic/index.d.ts

@@ -0,0 +1,5 @@
+export type { DefaultRule, DefaultTheory, Extension, ComputeOptions } from './types';
+export { DEFAULT_MAX_EXTENSIONS, DEFAULT_MAX_DEFAULTS } from './types';
+export { computeExtensions, normalizeLiteral, negate, isConsistent, isJustificationConsistent, } from './extensions';
+export { isInExtension, isSkepticallyEntailed, isCredulouslyEntailed } from './entailment';
+//# sourceMappingURL=index.d.ts.map

package/dist/profiles/default-logic/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/profiles/default-logic/index.ts"],"names":[],"mappings":"AAiBA,YAAY,EAAE,WAAW,EAAE,aAAa,EAAE,SAAS,EAAE,cAAc,EAAE,MAAM,SAAS,CAAC;AACrF,OAAO,EAAE,sBAAsB,EAAE,oBAAoB,EAAE,MAAM,SAAS,CAAC;AACvE,OAAO,EACL,iBAAiB,EACjB,gBAAgB,EAChB,MAAM,EACN,YAAY,EACZ,yBAAyB,GAC1B,MAAM,cAAc,CAAC;AACtB,OAAO,EAAE,aAAa,EAAE,qBAAqB,EAAE,qBAAqB,EAAE,MAAM,cAAc,CAAC"}

package/dist/profiles/default-logic/index.js

@@ -0,0 +1,33 @@
+"use strict";
+// ============================================================
+// ST Default Logic (Reiter) — Barrel export
+// ============================================================
+//
+// Lógica default de Reiter (1980): razonamiento no-monotónico
+// basado en reglas `α : β / γ` donde α es el prerequisite, β las
+// justificaciones (consistentes con creencias) y γ el consequent.
+//
+// API pública:
+//   - computeExtensions(T): punto fijo del operador Γ_T.
+//   - isInExtension(φ, E): pertenencia a una extensión dada.
+//   - isSkepticallyEntailed(φ, T): φ en TODAS las extensiones.
+//   - isCredulouslyEntailed(φ, T): φ en AL MENOS una extensión.
+//
+// Casos canónicos cubiertos por tests: Tweety, pingüino, Nixon diamond.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.isCredulouslyEntailed = exports.isSkepticallyEntailed = exports.isInExtension = exports.isJustificationConsistent = exports.isConsistent = exports.negate = exports.normalizeLiteral = exports.computeExtensions = exports.DEFAULT_MAX_DEFAULTS = exports.DEFAULT_MAX_EXTENSIONS = void 0;
+var types_1 = require("./types");
+Object.defineProperty(exports, "DEFAULT_MAX_EXTENSIONS", { enumerable: true, get: function () { return types_1.DEFAULT_MAX_EXTENSIONS; } });
+Object.defineProperty(exports, "DEFAULT_MAX_DEFAULTS", { enumerable: true, get: function () { return types_1.DEFAULT_MAX_DEFAULTS; } });
+var extensions_1 = require("./extensions");
+Object.defineProperty(exports, "computeExtensions", { enumerable: true, get: function () { return extensions_1.computeExtensions; } });
+Object.defineProperty(exports, "normalizeLiteral", { enumerable: true, get: function () { return extensions_1.normalizeLiteral; } });
+Object.defineProperty(exports, "negate", { enumerable: true, get: function () { return extensions_1.negate; } });
+Object.defineProperty(exports, "isConsistent", { enumerable: true, get: function () { return extensions_1.isConsistent; } });
+Object.defineProperty(exports, "isJustificationConsistent", { enumerable: true, get: function () { return extensions_1.isJustificationConsistent; } });
+var entailment_1 = require("./entailment");
+Object.defineProperty(exports, "isInExtension", { enumerable: true, get: function () { return entailment_1.isInExtension; } });
+Object.defineProperty(exports, "isSkepticallyEntailed", { enumerable: true, get: function () { return entailment_1.isSkepticallyEntailed; } });
+Object.defineProperty(exports, "isCredulouslyEntailed", { enumerable: true, get: function () { return entailment_1.isCredulouslyEntailed; } });
+//# sourceMappingURL=index.js.map

package/dist/profiles/default-logic/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/profiles/default-logic/index.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,4CAA4C;AAC5C,+DAA+D;AAC/D,EAAE;AACF,8DAA8D;AAC9D,iEAAiE;AACjE,kEAAkE;AAClE,EAAE;AACF,eAAe;AACf,yDAAyD;AACzD,6DAA6D;AAC7D,+DAA+D;AAC/D,gEAAgE;AAChE,EAAE;AACF,wEAAwE;AACxE,+DAA+D;;;AAG/D,iCAAuE;AAA9D,+GAAA,sBAAsB,OAAA;AAAE,6GAAA,oBAAoB,OAAA;AACrD,2CAMsB;AALpB,+GAAA,iBAAiB,OAAA;AACjB,8GAAA,gBAAgB,OAAA;AAChB,oGAAA,MAAM,OAAA;AACN,0GAAA,YAAY,OAAA;AACZ,uHAAA,yBAAyB,OAAA;AAE3B,2CAA2F;AAAlF,2GAAA,aAAa,OAAA;AAAE,mHAAA,qBAAqB,OAAA;AAAE,mHAAA,qBAAqB,OAAA"}

package/dist/profiles/default-logic/types.d.ts

@@ -0,0 +1,29 @@
+export interface DefaultRule {
+    id: string;
+    /** Literal que debe estar en las creencias para que el default sea aplicable. */
+    prerequisite: string;
+    /** Cada literal debe ser consistente con las creencias (¬β no debe estar). */
+    justifications: string[];
+    /** Literal que se añade a las creencias cuando el default se aplica. */
+    consequent: string;
+}
+export interface DefaultTheory {
+    /** Hard facts: siempre creídos, base de toda extensión. */
+    facts: string[];
+    defaults: DefaultRule[];
+}
+export interface Extension {
+    /** Cierre de creencias (facts + consequents aplicados). */
+    formulas: Set<string>;
+    /** IDs de los defaults aplicados en orden de aplicación. */
+    appliedDefaults: string[];
+}
+export interface ComputeOptions {
+    /** Tope de extensiones a enumerar (evita explosión combinatoria). */
+    maxExtensions?: number;
+    /** Tope de defaults considerados (evita teorías malformadas). */
+    maxDefaults?: number;
+}
+export declare const DEFAULT_MAX_EXTENSIONS = 64;
+export declare const DEFAULT_MAX_DEFAULTS = 64;
+//# sourceMappingURL=types.d.ts.map

package/dist/profiles/default-logic/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../src/profiles/default-logic/types.ts"],"names":[],"mappings":"AAoBA,MAAM,WAAW,WAAW;IAC1B,EAAE,EAAE,MAAM,CAAC;IACX,iFAAiF;IACjF,YAAY,EAAE,MAAM,CAAC;IACrB,8EAA8E;IAC9E,cAAc,EAAE,MAAM,EAAE,CAAC;IACzB,wEAAwE;IACxE,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,aAAa;IAC5B,2DAA2D;IAC3D,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,QAAQ,EAAE,WAAW,EAAE,CAAC;CACzB;AAED,MAAM,WAAW,SAAS;IACxB,2DAA2D;IAC3D,QAAQ,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IACtB,4DAA4D;IAC5D,eAAe,EAAE,MAAM,EAAE,CAAC;CAC3B;AAED,MAAM,WAAW,cAAc;IAC7B,qEAAqE;IACrE,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,iEAAiE;IACjE,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AAED,eAAO,MAAM,sBAAsB,KAAK,CAAC;AACzC,eAAO,MAAM,oBAAoB,KAAK,CAAC"}