@stevenvo780/st-lang 4.0.1 → 4.2.0

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

@@ -0,0 +1,34 @@
+"use strict";
+// ============================================================
+// ST Hybrid Logic — API pública del fragmento H(@, ↓, ∃)
+// ============================================================
+// Hybrid logic = modal logic + nominales (i, j, k) + @-operator +
+// ↓-binder + ∃-world quantifier. Permite hablar internamente de
+// mundos identificables — útil para razonar sobre identidad de
+// estados en sistemas Kripke (procesos, módulos epistémicos).
+//
+// Este módulo es independiente del ProfileRegistry textual (igual
+// que description-logic): provee la semántica relacional y un
+// decisor de satisfacibilidad por búsqueda finita acotada.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.isSatisfiable = exports.isSatisfiableInFrame = exports.satisfies = exports.formulaToString = exports.existsWorld = exports.down = exports.at = exports.diamond = exports.box = exports.implies = exports.or = exports.and = exports.not = exports.nominal = exports.atom = void 0;
+var types_1 = require("./types");
+Object.defineProperty(exports, "atom", { enumerable: true, get: function () { return types_1.atom; } });
+Object.defineProperty(exports, "nominal", { enumerable: true, get: function () { return types_1.nominal; } });
+Object.defineProperty(exports, "not", { enumerable: true, get: function () { return types_1.not; } });
+Object.defineProperty(exports, "and", { enumerable: true, get: function () { return types_1.and; } });
+Object.defineProperty(exports, "or", { enumerable: true, get: function () { return types_1.or; } });
+Object.defineProperty(exports, "implies", { enumerable: true, get: function () { return types_1.implies; } });
+Object.defineProperty(exports, "box", { enumerable: true, get: function () { return types_1.box; } });
+Object.defineProperty(exports, "diamond", { enumerable: true, get: function () { return types_1.diamond; } });
+Object.defineProperty(exports, "at", { enumerable: true, get: function () { return types_1.at; } });
+Object.defineProperty(exports, "down", { enumerable: true, get: function () { return types_1.down; } });
+Object.defineProperty(exports, "existsWorld", { enumerable: true, get: function () { return types_1.existsWorld; } });
+Object.defineProperty(exports, "formulaToString", { enumerable: true, get: function () { return types_1.formulaToString; } });
+var semantics_1 = require("./semantics");
+Object.defineProperty(exports, "satisfies", { enumerable: true, get: function () { return semantics_1.satisfies; } });
+Object.defineProperty(exports, "isSatisfiableInFrame", { enumerable: true, get: function () { return semantics_1.isSatisfiableInFrame; } });
+var sat_1 = require("./sat");
+Object.defineProperty(exports, "isSatisfiable", { enumerable: true, get: function () { return sat_1.isSatisfiable; } });
+//# sourceMappingURL=index.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/profiles/hybrid-logic/index.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,yDAAyD;AACzD,+DAA+D;AAC/D,kEAAkE;AAClE,gEAAgE;AAChE,+DAA+D;AAC/D,8DAA8D;AAC9D,EAAE;AACF,kEAAkE;AAClE,8DAA8D;AAC9D,2DAA2D;AAC3D,+DAA+D;;;AAI/D,iCAaiB;AAZf,6FAAA,IAAI,OAAA;AACJ,gGAAA,OAAO,OAAA;AACP,4FAAA,GAAG,OAAA;AACH,4FAAA,GAAG,OAAA;AACH,2FAAA,EAAE,OAAA;AACF,gGAAA,OAAO,OAAA;AACP,4FAAA,GAAG,OAAA;AACH,gGAAA,OAAO,OAAA;AACP,2FAAA,EAAE,OAAA;AACF,6FAAA,IAAI,OAAA;AACJ,oGAAA,WAAW,OAAA;AACX,wGAAA,eAAe,OAAA;AAGjB,yCAA8D;AAArD,sGAAA,SAAS,OAAA;AAAE,iHAAA,oBAAoB,OAAA;AAExC,6BAAsC;AAA7B,oGAAA,aAAa,OAAA"}

package/dist/profiles/hybrid-logic/sat.d.ts

@@ -0,0 +1,15 @@
+import type { HybridFormula, HybridFrame } from './types';
+/**
+ * Búsqueda exhaustiva de modelo en frames de tamaño ≤ `maxWorlds`.
+ *
+ * Para una explosión combinatoria controlada, sólo intentamos
+ * tamaños desde 1 hasta `maxWorlds`. Es completo dentro de ese rango.
+ */
+export declare function isSatisfiable(phi: HybridFormula, options?: {
+    maxWorlds?: number;
+}): {
+    sat: boolean;
+    frame?: HybridFrame;
+    world?: string;
+};
+//# sourceMappingURL=sat.d.ts.map

package/dist/profiles/hybrid-logic/sat.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sat.d.ts","sourceRoot":"","sources":["../../../src/profiles/hybrid-logic/sat.ts"],"names":[],"mappings":"AAgBA,OAAO,KAAK,EAAE,aAAa,EAAE,WAAW,EAAE,MAAM,SAAS,CAAC;AAwG1D;;;;;GAKG;AACH,wBAAgB,aAAa,CAC3B,GAAG,EAAE,aAAa,EAClB,OAAO,GAAE;IAAE,SAAS,CAAC,EAAE,MAAM,CAAA;CAAO,GACnC;IAAE,GAAG,EAAE,OAAO,CAAC;IAAC,KAAK,CAAC,EAAE,WAAW,CAAC;IAAC,KAAK,CAAC,EAAE,MAAM,CAAA;CAAE,CAsBvD"}

package/dist/profiles/hybrid-logic/sat.js

@@ -0,0 +1,142 @@
+"use strict";
+// ============================================================
+// ST Hybrid Logic — Decisor de satisfacibilidad (búsqueda acotada)
+// ============================================================
+// La satisfacibilidad del fragmento H(@, ↓, ∃) es indecidible en
+// general (Areces, Blackburn & Marx 1999). Aquí implementamos un
+// búsqueda finita acotada: enumeramos frames con ≤ N mundos y
+// probamos cada uno. Es completo para fórmulas con modelo finito
+// pequeño y robusto para los tests del perfil.
+//
+// La cota se elige en función del tamaño sintáctico de φ:
+//   bound = max(2, atoms + nominals + 2)
+// suficiente para todas las patologías clásicas (loops, modelos
+// con varios mundos para ∃, etc.).
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.isSatisfiable = isSatisfiable;
+const semantics_1 = require("./semantics");
+/** Recolecta átomos y nominales libres (los ligados por ↓/∃ no cuentan). */
+function collectSyntax(phi) {
+    const atoms = new Set();
+    const free = new Set();
+    const visit = (node, bound) => {
+        switch (node.kind) {
+            case 'atom':
+                atoms.add(node.name);
+                return;
+            case 'nominal':
+                if (!bound.has(node.name))
+                    free.add(node.name);
+                return;
+            case 'not':
+                visit(node.arg, bound);
+                return;
+            case 'and':
+            case 'or':
+                for (const sub of node.args)
+                    visit(sub, bound);
+                return;
+            case 'implies':
+                visit(node.left, bound);
+                visit(node.right, bound);
+                return;
+            case 'box':
+            case 'diamond':
+                visit(node.arg, bound);
+                return;
+            case 'at':
+                if (!bound.has(node.nominal))
+                    free.add(node.nominal);
+                visit(node.arg, bound);
+                return;
+            case 'down':
+            case 'exists-world': {
+                const inner = new Set(bound);
+                inner.add(node.bind);
+                visit(node.arg, inner);
+                return;
+            }
+        }
+    };
+    visit(phi, new Set());
+    return { atoms: [...atoms], freeNominals: [...free] };
+}
+/** Genera todos los subconjuntos de `items` como Set<string>. */
+function* powerset(items) {
+    const n = items.length;
+    for (let mask = 0; mask < 1 << n; mask++) {
+        const out = [];
+        for (let i = 0; i < n; i++) {
+            if (mask & (1 << i))
+                out.push(items[i]);
+        }
+        yield out;
+    }
+}
+/** Genera todas las asignaciones de los nominales libres a worlds. */
+function* nominalAssignments(noms, worlds) {
+    if (noms.length === 0) {
+        yield {};
+        return;
+    }
+    const [head, ...rest] = noms;
+    for (const w of worlds) {
+        for (const sub of nominalAssignments(rest, worlds)) {
+            yield { ...sub, [head]: w };
+        }
+    }
+}
+/** Genera todas las valuaciones posibles sobre `atoms` y `worlds`. */
+function* valuations(atoms, worlds) {
+    if (atoms.length === 0) {
+        yield {};
+        return;
+    }
+    const [head, ...rest] = atoms;
+    for (const subset of powerset(worlds)) {
+        for (const sub of valuations(rest, worlds)) {
+            yield { ...sub, [head]: new Set(subset) };
+        }
+    }
+}
+/** Genera todas las relaciones binarias sobre `worlds`. */
+function* accessibilities(worlds) {
+    const pairs = [];
+    for (const u of worlds) {
+        for (const v of worlds)
+            pairs.push([u, v]);
+    }
+    for (const subset of powerset(pairs)) {
+        yield subset;
+    }
+}
+/**
+ * Búsqueda exhaustiva de modelo en frames de tamaño ≤ `maxWorlds`.
+ *
+ * Para una explosión combinatoria controlada, sólo intentamos
+ * tamaños desde 1 hasta `maxWorlds`. Es completo dentro de ese rango.
+ */
+function isSatisfiable(phi, options = {}) {
+    const { atoms, freeNominals } = collectSyntax(phi);
+    const defaultBound = Math.max(2, atoms.length + freeNominals.length + 2);
+    const maxWorlds = options.maxWorlds ?? defaultBound;
+    for (let size = 1; size <= maxWorlds; size++) {
+        const worlds = [];
+        for (let i = 0; i < size; i++)
+            worlds.push(`w${i}`);
+        for (const accessibility of accessibilities(worlds)) {
+            for (const nominals of nominalAssignments(freeNominals, worlds)) {
+                for (const valuation of valuations(atoms, worlds)) {
+                    const frame = { worlds, accessibility, nominals, valuation };
+                    const w = (0, semantics_1.isSatisfiableInFrame)(frame, phi);
+                    if (w !== undefined) {
+                        return { sat: true, frame, world: w };
+                    }
+                }
+            }
+        }
+    }
+    return { sat: false };
+}
+//# sourceMappingURL=sat.js.map

package/dist/profiles/hybrid-logic/sat.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sat.js","sourceRoot":"","sources":["../../../src/profiles/hybrid-logic/sat.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,mEAAmE;AACnE,+DAA+D;AAC/D,iEAAiE;AACjE,iEAAiE;AACjE,8DAA8D;AAC9D,iEAAiE;AACjE,+CAA+C;AAC/C,EAAE;AACF,0DAA0D;AAC1D,yCAAyC;AACzC,gEAAgE;AAChE,mCAAmC;AACnC,+DAA+D;;AAiH/D,sCAyBC;AAxID,2CAAmD;AAQnD,4EAA4E;AAC5E,SAAS,aAAa,CAAC,GAAkB;IACvC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;IAChC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAE/B,MAAM,KAAK,GAAG,CAAC,IAAmB,EAAE,KAAkB,EAAQ,EAAE;QAC9D,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;YAClB,KAAK,MAAM;gBACT,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACrB,OAAO;YACT,KAAK,SAAS;gBACZ,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;oBAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAC/C,OAAO;YACT,KAAK,KAAK;gBACR,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;gBACvB,OAAO;YACT,KAAK,KAAK,CAAC;YACX,KAAK,IAAI;gBACP,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,IAAI;oBAAE,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;gBAC/C,OAAO;YACT,KAAK,SAAS;gBACZ,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;gBACxB,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;gBACzB,OAAO;YACT,KAAK,KAAK,CAAC;YACX,KAAK,SAAS;gBACZ,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;gBACvB,OAAO;YACT,KAAK,IAAI;gBACP,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC;oBAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBACrD,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;gBACvB,OAAO;YACT,KAAK,MAAM,CAAC;YACZ,KAAK,cAAc,CAAC,CAAC,CAAC;gBACpB,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC;gBAC7B,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACrB,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;gBACvB,OAAO;YACT,CAAC;QACH,CAAC;IACH,CAAC,CAAC;IAEF,KAAK,CAAC,GAAG,EAAE,IAAI,GAAG,EAAU,CAAC,CAAC;IAC9B,OAAO,EAAE,KAAK,EAAE,CAAC,GAAG,KAAK,CAAC,EAAE,YAAY,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC;AACxD,CAAC;AAED,iEAAiE;AACjE,QAAQ,CAAC,CAAC,QAAQ,CAAI,KAAU;IAC9B,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;IACvB,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC;QACzC,MAAM,GAAG,GAAQ,EAAE,CAAC;QACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,IAAI,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;gBAAE,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1C,CAAC;QACD,MAAM,GAAG,CAAC;IACZ,CAAC;AACH,CAAC;AAED,sEAAsE;AACtE,QAAQ,CAAC,CAAC,kBAAkB,CAAC,IAAc,EAAE,MAAgB;IAC3D,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACtB,MAAM,EAAE,CAAC;QACT,OAAO;IACT,CAAC;IACD,MAAM,CAAC,IAAI,EAAE,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC;IAC7B,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,KAAK,MAAM,GAAG,IAAI,kBAAkB,CAAC,IAAI,EAAE,MAAM,CAAC,EAAE,CAAC;YACnD,MAAM,EAAE,GAAG,GAAG,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;QAC9B,CAAC;IACH,CAAC;AACH,CAAC;AAED,sEAAsE;AACtE,QAAQ,CAAC,CAAC,UAAU,CAAC,KAAe,EAAE,MAAgB;IACpD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvB,MAAM,EAAE,CAAC;QACT,OAAO;IACT,CAAC;IACD,MAAM,CAAC,IAAI,EAAE,GAAG,IAAI,CAAC,GAAG,KAAK,CAAC;IAC9B,KAAK,MAAM,MAAM,IAAI,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;QACtC,KAAK,MAAM,GAAG,IAAI,UAAU,CAAC,IAAI,EAAE,MAAM,CAAC,EAAE,CAAC;YAC3C,MAAM,EAAE,GAAG,GAAG,EAAE,CAAC,IAAI,CAAC,EAAE,IAAI,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;QAC5C,CAAC;IACH,CAAC;AACH,CAAC;AAED,2DAA2D;AAC3D,QAAQ,CAAC,CAAC,eAAe,CAAC,MAAgB;IACxC,MAAM,KAAK,GAA4B,EAAE,CAAC;IAC1C,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,KAAK,MAAM,CAAC,IAAI,MAAM;YAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC7C,CAAC;IACD,KAAK,MAAM,MAAM,IAAI,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;QACrC,MAAM,MAAM,CAAC;IACf,CAAC;AACH,CAAC;AAED;;;;;GAKG;AACH,SAAgB,aAAa,CAC3B,GAAkB,EAClB,UAAkC,EAAE;IAEpC,MAAM,EAAE,KAAK,EAAE,YAAY,EAAE,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC;IACnD,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,MAAM,GAAG,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACzE,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,IAAI,YAAY,CAAC;IAEpD,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,IAAI,SAAS,EAAE,IAAI,EAAE,EAAE,CAAC;QAC7C,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE;YAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAEpD,KAAK,MAAM,aAAa,IAAI,eAAe,CAAC,MAAM,CAAC,EAAE,CAAC;YACpD,KAAK,MAAM,QAAQ,IAAI,kBAAkB,CAAC,YAAY,EAAE,MAAM,CAAC,EAAE,CAAC;gBAChE,KAAK,MAAM,SAAS,IAAI,UAAU,CAAC,KAAK,EAAE,MAAM,CAAC,EAAE,CAAC;oBAClD,MAAM,KAAK,GAAgB,EAAE,MAAM,EAAE,aAAa,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC;oBAC1E,MAAM,CAAC,GAAG,IAAA,gCAAoB,EAAC,KAAK,EAAE,GAAG,CAAC,CAAC;oBAC3C,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;wBACpB,OAAO,EAAE,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;oBACxC,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC;AACxB,CAAC"}

package/dist/profiles/hybrid-logic/semantics.d.ts

@@ -0,0 +1,20 @@
+import type { HybridFormula, HybridFrame } from './types';
+/**
+ * Verdad relativa a un mundo.
+ *
+ * - `atom` consulta la valuación.
+ * - `nominal` es verdadero en w sii la asignación combinada lo manda a w.
+ * - `box`/`diamond` cuantifican sobre R-sucesores.
+ * - `@i φ` saltamos al mundo nombrado por i (ignora el mundo actual).
+ * - `↓i. φ` extiende env con i := w y evalúa φ en w.
+ * - `∃i. φ` busca algún mundo w' tal que con i := w' la fórmula
+ *   se satisfaga en el mundo actual (¡el "punto de evaluación" no
+ *   cambia con ∃; sólo se introduce un nombre nuevo).
+ */
+export declare function satisfies(frame: HybridFrame, world: string, phi: HybridFormula, env?: Record<string, string>): boolean;
+/**
+ * Verdad global: ∃w ∈ W. M, w ⊨ φ.
+ * Útil para chequear satisfacibilidad sobre un frame concreto.
+ */
+export declare function isSatisfiableInFrame(frame: HybridFrame, phi: HybridFormula): string | undefined;
+//# sourceMappingURL=semantics.d.ts.map

package/dist/profiles/hybrid-logic/semantics.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"semantics.d.ts","sourceRoot":"","sources":["../../../src/profiles/hybrid-logic/semantics.ts"],"names":[],"mappings":"AAaA,OAAO,KAAK,EAAE,aAAa,EAAE,WAAW,EAAE,MAAM,SAAS,CAAC;AAS1D;;;;;;;;;;;GAWG;AACH,wBAAgB,SAAS,CACvB,KAAK,EAAE,WAAW,EAClB,KAAK,EAAE,MAAM,EACb,GAAG,EAAE,aAAa,EAClB,GAAG,GAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAM,GAC/B,OAAO,CAiET;AAED;;;GAGG;AACH,wBAAgB,oBAAoB,CAAC,KAAK,EAAE,WAAW,EAAE,GAAG,EAAE,aAAa,GAAG,MAAM,GAAG,SAAS,CAK/F"}

package/dist/profiles/hybrid-logic/semantics.js

@@ -0,0 +1,107 @@
+"use strict";
+// ============================================================
+// ST Hybrid Logic — Semántica relacional con asignación de nominales
+// ============================================================
+// `satisfies(F, w, φ, env)` decide si M, w ⊨ φ donde
+//   M = (W, R, V, g)   — frame Kripke + asignación g de nominales,
+//   env extiende g con los binds introducidos por ↓ y ∃.
+//
+// La distinción entre `nominals` (en el frame) y `env` (de evaluación)
+// es estándar en la presentación de Blackburn et al.: los nominales
+// libres se resuelven con la asignación global; los ligados por ↓/∃
+// extienden el entorno localmente.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.satisfies = satisfies;
+exports.isSatisfiableInFrame = isSatisfiableInFrame;
+/** Resuelve un nombre de nominal/variable de mundo. env tiene prioridad. */
+function lookup(name, frame, env) {
+    if (Object.prototype.hasOwnProperty.call(env, name))
+        return env[name];
+    if (Object.prototype.hasOwnProperty.call(frame.nominals, name))
+        return frame.nominals[name];
+    return undefined;
+}
+/**
+ * Verdad relativa a un mundo.
+ *
+ * - `atom` consulta la valuación.
+ * - `nominal` es verdadero en w sii la asignación combinada lo manda a w.
+ * - `box`/`diamond` cuantifican sobre R-sucesores.
+ * - `@i φ` saltamos al mundo nombrado por i (ignora el mundo actual).
+ * - `↓i. φ` extiende env con i := w y evalúa φ en w.
+ * - `∃i. φ` busca algún mundo w' tal que con i := w' la fórmula
+ *   se satisfaga en el mundo actual (¡el "punto de evaluación" no
+ *   cambia con ∃; sólo se introduce un nombre nuevo).
+ */
+function satisfies(frame, world, phi, env = {}) {
+    switch (phi.kind) {
+        case 'atom': {
+            const set = frame.valuation[phi.name];
+            return set !== undefined && set.has(world);
+        }
+        case 'nominal': {
+            const target = lookup(phi.name, frame, env);
+            if (target === undefined) {
+                throw new Error(`Nominal no asignado: ${phi.name}`);
+            }
+            return target === world;
+        }
+        case 'not':
+            return !satisfies(frame, world, phi.arg, env);
+        case 'and':
+            return phi.args.every((sub) => satisfies(frame, world, sub, env));
+        case 'or':
+            return phi.args.some((sub) => satisfies(frame, world, sub, env));
+        case 'implies':
+            return !satisfies(frame, world, phi.left, env) || satisfies(frame, world, phi.right, env);
+        case 'box': {
+            for (const [u, v] of frame.accessibility) {
+                if (u === world && !satisfies(frame, v, phi.arg, env))
+                    return false;
+            }
+            return true;
+        }
+        case 'diamond': {
+            for (const [u, v] of frame.accessibility) {
+                if (u === world && satisfies(frame, v, phi.arg, env))
+                    return true;
+            }
+            return false;
+        }
+        case 'at': {
+            const target = lookup(phi.nominal, frame, env);
+            if (target === undefined) {
+                throw new Error(`@-operator sobre nominal no asignado: ${phi.nominal}`);
+            }
+            return satisfies(frame, target, phi.arg, env);
+        }
+        case 'down': {
+            // ↓i. φ evaluado en w: extiende env con i := w y evalúa φ en w.
+            const next = { ...env, [phi.bind]: world };
+            return satisfies(frame, world, phi.arg, next);
+        }
+        case 'exists-world': {
+            // ∃i. φ: existe un mundo w' tal que con i := w' la fórmula se
+            // satisface en el punto de evaluación actual.
+            for (const w2 of frame.worlds) {
+                const next = { ...env, [phi.bind]: w2 };
+                if (satisfies(frame, world, phi.arg, next))
+                    return true;
+            }
+            return false;
+        }
+    }
+}
+/**
+ * Verdad global: ∃w ∈ W. M, w ⊨ φ.
+ * Útil para chequear satisfacibilidad sobre un frame concreto.
+ */
+function isSatisfiableInFrame(frame, phi) {
+    for (const w of frame.worlds) {
+        if (satisfies(frame, w, phi, {}))
+            return w;
+    }
+    return undefined;
+}
+//# sourceMappingURL=semantics.js.map

package/dist/profiles/hybrid-logic/semantics.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"semantics.js","sourceRoot":"","sources":["../../../src/profiles/hybrid-logic/semantics.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,qEAAqE;AACrE,+DAA+D;AAC/D,qDAAqD;AACrD,mEAAmE;AACnE,yDAAyD;AACzD,EAAE;AACF,uEAAuE;AACvE,oEAAoE;AACpE,oEAAoE;AACpE,mCAAmC;AACnC,+DAA+D;;AAuB/D,8BAsEC;AAMD,oDAKC;AApGD,4EAA4E;AAC5E,SAAS,MAAM,CAAC,IAAY,EAAE,KAAkB,EAAE,GAA2B;IAC3E,IAAI,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC;QAAE,OAAO,GAAG,CAAC,IAAI,CAAC,CAAC;IACtE,IAAI,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,IAAI,CAAC;QAAE,OAAO,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;IAC5F,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;;;;;;;;;GAWG;AACH,SAAgB,SAAS,CACvB,KAAkB,EAClB,KAAa,EACb,GAAkB,EAClB,MAA8B,EAAE;IAEhC,QAAQ,GAAG,CAAC,IAAI,EAAE,CAAC;QACjB,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,MAAM,GAAG,GAAG,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACtC,OAAO,GAAG,KAAK,SAAS,IAAI,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAC7C,CAAC;QAED,KAAK,SAAS,CAAC,CAAC,CAAC;YACf,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;YAC5C,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;gBACzB,MAAM,IAAI,KAAK,CAAC,wBAAwB,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC;YACtD,CAAC;YACD,OAAO,MAAM,KAAK,KAAK,CAAC;QAC1B,CAAC;QAED,KAAK,KAAK;YACR,OAAO,CAAC,SAAS,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAEhD,KAAK,KAAK;YACR,OAAO,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,SAAS,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QAEpE,KAAK,IAAI;YACP,OAAO,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,SAAS,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QAEnE,KAAK,SAAS;YACZ,OAAO,CAAC,SAAS,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,SAAS,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QAE5F,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,KAAK,CAAC,aAAa,EAAE,CAAC;gBACzC,IAAI,CAAC,KAAK,KAAK,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC;oBAAE,OAAO,KAAK,CAAC;YACtE,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC;QAED,KAAK,SAAS,CAAC,CAAC,CAAC;YACf,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,KAAK,CAAC,aAAa,EAAE,CAAC;gBACzC,IAAI,CAAC,KAAK,KAAK,IAAI,SAAS,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC;oBAAE,OAAO,IAAI,CAAC;YACpE,CAAC;YACD,OAAO,KAAK,CAAC;QACf,CAAC;QAED,KAAK,IAAI,CAAC,CAAC,CAAC;YACV,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,OAAO,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;YAC/C,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;gBACzB,MAAM,IAAI,KAAK,CAAC,yCAAyC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC;YAC1E,CAAC;YACD,OAAO,SAAS,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAChD,CAAC;QAED,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,gEAAgE;YAChE,MAAM,IAAI,GAAG,EAAE,GAAG,GAAG,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC;YAC3C,OAAO,SAAS,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QAChD,CAAC;QAED,KAAK,cAAc,CAAC,CAAC,CAAC;YACpB,8DAA8D;YAC9D,8CAA8C;YAC9C,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;gBAC9B,MAAM,IAAI,GAAG,EAAE,GAAG,GAAG,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC;gBACxC,IAAI,SAAS,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC;oBAAE,OAAO,IAAI,CAAC;YAC1D,CAAC;YACD,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,SAAgB,oBAAoB,CAAC,KAAkB,EAAE,GAAkB;IACzE,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;QAC7B,IAAI,SAAS,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC;YAAE,OAAO,CAAC,CAAC;IAC7C,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC"}

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

@@ -0,0 +1,78 @@
+/** Constructores sintácticos del fragmento. */
+export type HybridFormulaKind = 'atom' | 'nominal' | 'not' | 'and' | 'or' | 'implies' | 'box' | 'diamond' | 'at' | 'down' | 'exists-world';
+/**
+ * AST de fórmulas híbridas.
+ *
+ * Las "variables de mundo" producidas por ↓ y ∃ comparten espacio de
+ * nombres con los nominales libres; ambas se resuelven al mismo
+ * mundo del frame en tiempo de evaluación (vía `env`).
+ */
+export type HybridFormula = {
+    kind: 'atom';
+    name: string;
+} | {
+    kind: 'nominal';
+    name: string;
+} | {
+    kind: 'not';
+    arg: HybridFormula;
+} | {
+    kind: 'and';
+    args: HybridFormula[];
+} | {
+    kind: 'or';
+    args: HybridFormula[];
+} | {
+    kind: 'implies';
+    left: HybridFormula;
+    right: HybridFormula;
+} | {
+    kind: 'box';
+    arg: HybridFormula;
+} | {
+    kind: 'diamond';
+    arg: HybridFormula;
+} | {
+    kind: 'at';
+    nominal: string;
+    arg: HybridFormula;
+} | {
+    kind: 'down';
+    bind: string;
+    arg: HybridFormula;
+} | {
+    kind: 'exists-world';
+    bind: string;
+    arg: HybridFormula;
+};
+/**
+ * Modelo de Kripke enriquecido con asignación de nominales.
+ *
+ * - `worlds`        : identificadores de los mundos.
+ * - `accessibility` : relación R ⊆ W × W (pares ordenados).
+ * - `nominals`      : nominal-name → world-id (función parcial total
+ *                     sobre los nominales libres usados por la
+ *                     fórmula que se evalúa).
+ * - `valuation`     : atom-name → set de mundos donde el átomo es
+ *                     verdadero.
+ */
+export interface HybridFrame {
+    worlds: string[];
+    accessibility: Array<[string, string]>;
+    nominals: Record<string, string>;
+    valuation: Record<string, Set<string>>;
+}
+export declare function atom(name: string): HybridFormula;
+export declare function nominal(name: string): HybridFormula;
+export declare function not(arg: HybridFormula): HybridFormula;
+export declare function and(...args: HybridFormula[]): HybridFormula;
+export declare function or(...args: HybridFormula[]): HybridFormula;
+export declare function implies(left: HybridFormula, right: HybridFormula): HybridFormula;
+export declare function box(arg: HybridFormula): HybridFormula;
+export declare function diamond(arg: HybridFormula): HybridFormula;
+export declare function at(nominalName: string, arg: HybridFormula): HybridFormula;
+export declare function down(bind: string, arg: HybridFormula): HybridFormula;
+export declare function existsWorld(bind: string, arg: HybridFormula): HybridFormula;
+/** Renderiza una fórmula híbrida en notación textual estándar. */
+export declare function formulaToString(phi: HybridFormula): string;
+//# sourceMappingURL=types.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../src/profiles/hybrid-logic/types.ts"],"names":[],"mappings":"AAaA,+CAA+C;AAC/C,MAAM,MAAM,iBAAiB,GACzB,MAAM,GACN,SAAS,GACT,KAAK,GACL,KAAK,GACL,IAAI,GACJ,SAAS,GACT,KAAK,GACL,SAAS,GACT,IAAI,GACJ,MAAM,GACN,cAAc,CAAC;AAEnB;;;;;;GAMG;AACH,MAAM,MAAM,aAAa,GACrB;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,GAC9B;IAAE,IAAI,EAAE,SAAS,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,GACjC;IAAE,IAAI,EAAE,KAAK,CAAC;IAAC,GAAG,EAAE,aAAa,CAAA;CAAE,GACnC;IAAE,IAAI,EAAE,KAAK,CAAC;IAAC,IAAI,EAAE,aAAa,EAAE,CAAA;CAAE,GACtC;IAAE,IAAI,EAAE,IAAI,CAAC;IAAC,IAAI,EAAE,aAAa,EAAE,CAAA;CAAE,GACrC;IAAE,IAAI,EAAE,SAAS,CAAC;IAAC,IAAI,EAAE,aAAa,CAAC;IAAC,KAAK,EAAE,aAAa,CAAA;CAAE,GAC9D;IAAE,IAAI,EAAE,KAAK,CAAC;IAAC,GAAG,EAAE,aAAa,CAAA;CAAE,GACnC;IAAE,IAAI,EAAE,SAAS,CAAC;IAAC,GAAG,EAAE,aAAa,CAAA;CAAE,GACvC;IAAE,IAAI,EAAE,IAAI,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,aAAa,CAAA;CAAE,GACnD;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,aAAa,CAAA;CAAE,GAClD;IAAE,IAAI,EAAE,cAAc,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,aAAa,CAAA;CAAE,CAAC;AAE/D;;;;;;;;;;GAUG;AACH,MAAM,WAAW,WAAW;IAC1B,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,aAAa,EAAE,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IACvC,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACjC,SAAS,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;CACxC;AAID,wBAAgB,IAAI,CAAC,IAAI,EAAE,MAAM,GAAG,aAAa,CAEhD;AAED,wBAAgB,OAAO,CAAC,IAAI,EAAE,MAAM,GAAG,aAAa,CAEnD;AAED,wBAAgB,GAAG,CAAC,GAAG,EAAE,aAAa,GAAG,aAAa,CAErD;AAED,wBAAgB,GAAG,CAAC,GAAG,IAAI,EAAE,aAAa,EAAE,GAAG,aAAa,CAI3D;AAED,wBAAgB,EAAE,CAAC,GAAG,IAAI,EAAE,aAAa,EAAE,GAAG,aAAa,CAI1D;AAED,wBAAgB,OAAO,CAAC,IAAI,EAAE,aAAa,EAAE,KAAK,EAAE,aAAa,GAAG,aAAa,CAEhF;AAED,wBAAgB,GAAG,CAAC,GAAG,EAAE,aAAa,GAAG,aAAa,CAErD;AAED,wBAAgB,OAAO,CAAC,GAAG,EAAE,aAAa,GAAG,aAAa,CAEzD;AAED,wBAAgB,EAAE,CAAC,WAAW,EAAE,MAAM,EAAE,GAAG,EAAE,aAAa,GAAG,aAAa,CAEzE;AAED,wBAAgB,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,aAAa,GAAG,aAAa,CAEpE;AAED,wBAAgB,WAAW,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,aAAa,GAAG,aAAa,CAE3E;AAED,kEAAkE;AAClE,wBAAgB,eAAe,CAAC,GAAG,EAAE,aAAa,GAAG,MAAM,CAyB1D"}

package/dist/profiles/hybrid-logic/types.js

@@ -0,0 +1,107 @@
+"use strict";
+// ============================================================
+// ST Hybrid Logic — Tipos del fragmento H(@, ↓, ∃)
+// ============================================================
+// Hybrid logic extiende la modal estándar con:
+//   - nominales i, j, k ... — proposiciones que denotan UN único
+//     mundo del frame.
+//   - @i φ — "φ se satisface en el mundo nombrado por i".
+//   - ↓i. φ — bind el mundo actual como nominal i en φ.
+//   - ∃i. φ — existe un mundo i tal que φ se satisface allí.
+//
+// Referencias: Blackburn, Areces & ten Cate (2007), "Hybrid Logic".
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.atom = atom;
+exports.nominal = nominal;
+exports.not = not;
+exports.and = and;
+exports.or = or;
+exports.implies = implies;
+exports.box = box;
+exports.diamond = diamond;
+exports.at = at;
+exports.down = down;
+exports.existsWorld = existsWorld;
+exports.formulaToString = formulaToString;
+// ── Constructores de conveniencia ──────────────────────────
+function atom(name) {
+    return { kind: 'atom', name };
+}
+function nominal(name) {
+    return { kind: 'nominal', name };
+}
+function not(arg) {
+    return { kind: 'not', arg };
+}
+function and(...args) {
+    if (args.length === 0)
+        throw new Error('and: aridad >= 1 requerida');
+    if (args.length === 1)
+        return args[0];
+    return { kind: 'and', args };
+}
+function or(...args) {
+    if (args.length === 0)
+        throw new Error('or: aridad >= 1 requerida');
+    if (args.length === 1)
+        return args[0];
+    return { kind: 'or', args };
+}
+function implies(left, right) {
+    return { kind: 'implies', left, right };
+}
+function box(arg) {
+    return { kind: 'box', arg };
+}
+function diamond(arg) {
+    return { kind: 'diamond', arg };
+}
+function at(nominalName, arg) {
+    return { kind: 'at', nominal: nominalName, arg };
+}
+function down(bind, arg) {
+    return { kind: 'down', bind, arg };
+}
+function existsWorld(bind, arg) {
+    return { kind: 'exists-world', bind, arg };
+}
+/** Renderiza una fórmula híbrida en notación textual estándar. */
+function formulaToString(phi) {
+    switch (phi.kind) {
+        case 'atom':
+            return phi.name;
+        case 'nominal':
+            return phi.name;
+        case 'not':
+            return `¬${wrap(phi.arg)}`;
+        case 'and':
+            return `(${phi.args.map(formulaToString).join(' ∧ ')})`;
+        case 'or':
+            return `(${phi.args.map(formulaToString).join(' ∨ ')})`;
+        case 'implies':
+            return `(${formulaToString(phi.left)} → ${formulaToString(phi.right)})`;
+        case 'box':
+            return `□${wrap(phi.arg)}`;
+        case 'diamond':
+            return `◇${wrap(phi.arg)}`;
+        case 'at':
+            return `@${phi.nominal} ${wrap(phi.arg)}`;
+        case 'down':
+            return `↓${phi.bind}. ${wrap(phi.arg)}`;
+        case 'exists-world':
+            return `∃${phi.bind}. ${wrap(phi.arg)}`;
+    }
+}
+function wrap(phi) {
+    if (phi.kind === 'atom' ||
+        phi.kind === 'nominal' ||
+        phi.kind === 'not' ||
+        phi.kind === 'box' ||
+        phi.kind === 'diamond' ||
+        phi.kind === 'at') {
+        return formulaToString(phi);
+    }
+    return `(${formulaToString(phi)})`;
+}
+//# sourceMappingURL=types.js.map

package/dist/profiles/hybrid-logic/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../src/profiles/hybrid-logic/types.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,mDAAmD;AACnD,+DAA+D;AAC/D,+CAA+C;AAC/C,iEAAiE;AACjE,uBAAuB;AACvB,0DAA0D;AAC1D,wDAAwD;AACxD,6DAA6D;AAC7D,EAAE;AACF,oEAAoE;AACpE,+DAA+D;;AAwD/D,oBAEC;AAED,0BAEC;AAED,kBAEC;AAED,kBAIC;AAED,gBAIC;AAED,0BAEC;AAED,kBAEC;AAED,0BAEC;AAED,gBAEC;AAED,oBAEC;AAED,kCAEC;AAGD,0CAyBC;AA5ED,8DAA8D;AAE9D,SAAgB,IAAI,CAAC,IAAY;IAC/B,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;AAChC,CAAC;AAED,SAAgB,OAAO,CAAC,IAAY;IAClC,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC;AACnC,CAAC;AAED,SAAgB,GAAG,CAAC,GAAkB;IACpC,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC;AAC9B,CAAC;AAED,SAAgB,GAAG,CAAC,GAAG,IAAqB;IAC1C,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,4BAA4B,CAAC,CAAC;IACrE,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC;IACtC,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;AAC/B,CAAC;AAED,SAAgB,EAAE,CAAC,GAAG,IAAqB;IACzC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,2BAA2B,CAAC,CAAC;IACpE,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC;IACtC,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;AAC9B,CAAC;AAED,SAAgB,OAAO,CAAC,IAAmB,EAAE,KAAoB;IAC/D,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;AAC1C,CAAC;AAED,SAAgB,GAAG,CAAC,GAAkB;IACpC,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC;AAC9B,CAAC;AAED,SAAgB,OAAO,CAAC,GAAkB;IACxC,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,GAAG,EAAE,CAAC;AAClC,CAAC;AAED,SAAgB,EAAE,CAAC,WAAmB,EAAE,GAAkB;IACxD,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,WAAW,EAAE,GAAG,EAAE,CAAC;AACnD,CAAC;AAED,SAAgB,IAAI,CAAC,IAAY,EAAE,GAAkB;IACnD,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC;AACrC,CAAC;AAED,SAAgB,WAAW,CAAC,IAAY,EAAE,GAAkB;IAC1D,OAAO,EAAE,IAAI,EAAE,cAAc,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC;AAC7C,CAAC;AAED,kEAAkE;AAClE,SAAgB,eAAe,CAAC,GAAkB;IAChD,QAAQ,GAAG,CAAC,IAAI,EAAE,CAAC;QACjB,KAAK,MAAM;YACT,OAAO,GAAG,CAAC,IAAI,CAAC;QAClB,KAAK,SAAS;YACZ,OAAO,GAAG,CAAC,IAAI,CAAC;QAClB,KAAK,KAAK;YACR,OAAO,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;QAC7B,KAAK,KAAK;YACR,OAAO,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC;QAC1D,KAAK,IAAI;YACP,OAAO,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC;QAC1D,KAAK,SAAS;YACZ,OAAO,IAAI,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,eAAe,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC;QAC1E,KAAK,KAAK;YACR,OAAO,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;QAC7B,KAAK,SAAS;YACZ,OAAO,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;QAC7B,KAAK,IAAI;YACP,OAAO,IAAI,GAAG,CAAC,OAAO,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;QAC5C,KAAK,MAAM;YACT,OAAO,IAAI,GAAG,CAAC,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;QAC1C,KAAK,cAAc;YACjB,OAAO,IAAI,GAAG,CAAC,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;IAC5C,CAAC;AACH,CAAC;AAED,SAAS,IAAI,CAAC,GAAkB;IAC9B,IACE,GAAG,CAAC,IAAI,KAAK,MAAM;QACnB,GAAG,CAAC,IAAI,KAAK,SAAS;QACtB,GAAG,CAAC,IAAI,KAAK,KAAK;QAClB,GAAG,CAAC,IAAI,KAAK,KAAK;QAClB,GAAG,CAAC,IAAI,KAAK,SAAS;QACtB,GAAG,CAAC,IAAI,KAAK,IAAI,EACjB,CAAC;QACD,OAAO,eAAe,CAAC,GAAG,CAAC,CAAC;IAC9B,CAAC;IACD,OAAO,IAAI,eAAe,CAAC,GAAG,CAAC,GAAG,CAAC;AACrC,CAAC"}

package/dist/profiles/ltl-sat/index.d.ts

@@ -0,0 +1,4 @@
+export * from './types';
+export { isSatisfiable, isValid, toBuchi } from './sat';
+export { toNNF, closure, enumerateAtoms, transitions } from './tableau';
+//# sourceMappingURL=index.d.ts.map

package/dist/profiles/ltl-sat/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/profiles/ltl-sat/index.ts"],"names":[],"mappings":"AAaA,cAAc,SAAS,CAAC;AACxB,OAAO,EAAE,aAAa,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,OAAO,CAAC;AACxD,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,cAAc,EAAE,WAAW,EAAE,MAAM,WAAW,CAAC"}

package/dist/profiles/ltl-sat/index.js

@@ -0,0 +1,40 @@
+"use strict";
+// ============================================================
+// ST LTL-SAT — Procedimiento de decisión LTL vía tableau
+// ============================================================
+// API pública:
+//   isSatisfiable(φ): { sat, witness? }   — SAT explícito con lazo
+//   isValid(φ): boolean                   — ¬sat(¬φ)
+//   toBuchi(φ): { states, accepting }     — estimación de tamaño
+//
+// Operadores soportados: atom, ¬, ∧, ∨, X, F, G, U, R. El operador
+// derivado W (weak until) está disponible vía `weakUntil(φ,ψ)` y se
+// expande a `(φ U ψ) ∨ G φ` en la entrada.
+// ============================================================
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __exportStar = (this && this.__exportStar) || function(m, exports) {
+    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.transitions = exports.enumerateAtoms = exports.closure = exports.toNNF = exports.toBuchi = exports.isValid = exports.isSatisfiable = void 0;
+__exportStar(require("./types"), exports);
+var sat_1 = require("./sat");
+Object.defineProperty(exports, "isSatisfiable", { enumerable: true, get: function () { return sat_1.isSatisfiable; } });
+Object.defineProperty(exports, "isValid", { enumerable: true, get: function () { return sat_1.isValid; } });
+Object.defineProperty(exports, "toBuchi", { enumerable: true, get: function () { return sat_1.toBuchi; } });
+var tableau_1 = require("./tableau");
+Object.defineProperty(exports, "toNNF", { enumerable: true, get: function () { return tableau_1.toNNF; } });
+Object.defineProperty(exports, "closure", { enumerable: true, get: function () { return tableau_1.closure; } });
+Object.defineProperty(exports, "enumerateAtoms", { enumerable: true, get: function () { return tableau_1.enumerateAtoms; } });
+Object.defineProperty(exports, "transitions", { enumerable: true, get: function () { return tableau_1.transitions; } });
+//# sourceMappingURL=index.js.map

package/dist/profiles/ltl-sat/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/profiles/ltl-sat/index.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,yDAAyD;AACzD,+DAA+D;AAC/D,eAAe;AACf,mEAAmE;AACnE,qDAAqD;AACrD,iEAAiE;AACjE,EAAE;AACF,mEAAmE;AACnE,oEAAoE;AACpE,2CAA2C;AAC3C,+DAA+D;;;;;;;;;;;;;;;;;AAE/D,0CAAwB;AACxB,6BAAwD;AAA/C,oGAAA,aAAa,OAAA;AAAE,8FAAA,OAAO,OAAA;AAAE,8FAAA,OAAO,OAAA;AACxC,qCAAwE;AAA/D,gGAAA,KAAK,OAAA;AAAE,kGAAA,OAAO,OAAA;AAAE,yGAAA,cAAc,OAAA;AAAE,sGAAA,WAAW,OAAA"}

package/dist/profiles/ltl-sat/sat.d.ts

@@ -0,0 +1,8 @@
+import { LTLFormula, SatResult } from './types';
+export declare function isSatisfiable(phi: LTLFormula): SatResult;
+export declare function isValid(phi: LTLFormula): boolean;
+export declare function toBuchi(phi: LTLFormula): {
+    states: number;
+    accepting: number;
+};
+//# sourceMappingURL=sat.d.ts.map

package/dist/profiles/ltl-sat/sat.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sat.d.ts","sourceRoot":"","sources":["../../../src/profiles/ltl-sat/sat.ts"],"names":[],"mappings":"AA2BA,OAAO,EAAc,UAAU,EAAE,SAAS,EAAgB,MAAM,SAAS,CAAC;AAsG1E,wBAAgB,aAAa,CAAC,GAAG,EAAE,UAAU,GAAG,SAAS,CASxD;AAED,wBAAgB,OAAO,CAAC,GAAG,EAAE,UAAU,GAAG,OAAO,CAGhD;AAKD,wBAAgB,OAAO,CAAC,GAAG,EAAE,UAAU,GAAG;IAAE,MAAM,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,MAAM,CAAA;CAAE,CAO9E"}