@polintpro/proposit-core 0.1.7 → 0.1.8

package/README.md

@@ -178,8 +178,13 @@ eng.setConclusionPremise(conclusion.getId())
 
 ### Evaluating an argument
 
+Assignments use `TCoreExpressionAssignment`, which carries both variable truth values (three-valued: `true`, `false`, or `null` for unknown) and a list of rejected expression IDs:
+
 ```typescript
-const result = eng.evaluate({ "var-p": true, "var-q": true })
+const result = eng.evaluate({
+    variables: { "var-p": true, "var-q": true },
+    rejectedExpressionIds: [],
+})
 if (result.ok) {
     console.log(result.conclusionTrue) // true
     console.log(result.allSupportingPremisesTrue) // true
@@ -354,7 +359,7 @@ Checks whether the argument is structurally ready to evaluate. Returns `{ ok, is
 
 #### `evaluate(assignment, options?)` → `TArgumentEvaluationResult`
 
-Evaluates all relevant premises under the given variable assignment (`Record<string, boolean>`). Returns per-premise truth values, counterexample status, and an admissibility flag.
+Evaluates all relevant premises under the given expression assignment (`TCoreExpressionAssignment`). The assignment contains `variables` (a `Record<string, boolean | null>`) and `rejectedExpressionIds` (expression IDs that evaluate to `false` with children skipped). Returns per-premise truth values, counterexample status, and an admissibility flag.
 
 Options:
 
@@ -495,6 +500,73 @@ Returns a serialisable snapshot of this premise (`{ id, title, type, rootExpress
 
 ---
 
+### Standalone Functions
+
+#### `diffArguments(engineA, engineB, options?)` → `TCoreArgumentDiff`
+
+Compares two `ArgumentEngine` instances and returns a structured diff covering argument metadata, variables, premises (with nested expression diffs), and role changes. Each entity category reports added, removed, and modified items with field-level change details.
+
+Options allow plugging custom comparators per entity type via `TCoreDiffOptions`:
+
+```typescript
+import { diffArguments, defaultCompareVariable } from "@polintpro/proposit-core"
+
+const diff = diffArguments(engineA, engineB, {
+    compareVariable: (before, after) => {
+        // Wrap the default comparator with custom logic
+        return defaultCompareVariable(before, after)
+    },
+})
+```
+
+Default comparators are also exported: `defaultCompareArgument`, `defaultCompareVariable`, `defaultComparePremise`, `defaultCompareExpression`.
+
+---
+
+#### `analyzePremiseRelationships(engine, focusedPremiseId)` → `TCorePremiseRelationshipAnalysis`
+
+Analyzes how every other premise in the argument relates to a focused premise, classifying each as:
+
+| Category        | Meaning                                                                  |
+| --------------- | ------------------------------------------------------------------------ |
+| `supporting`    | Consequent feeds into the focused premise's antecedent (helps it fire)   |
+| `contradicting` | Infers values that negate the focused premise's antecedent or consequent |
+| `restricting`   | Constrains shared variables without clear support or contradiction       |
+| `downstream`    | Takes the focused premise's consequent as input (inference flows away)   |
+| `unrelated`     | No variable overlap, even transitively                                   |
+
+Each result includes per-variable relationship details and a `transitive` flag.
+
+```typescript
+import { analyzePremiseRelationships } from "@polintpro/proposit-core"
+
+const analysis = analyzePremiseRelationships(engine, conclusionPremiseId)
+for (const r of analysis.premises) {
+    console.log(`${r.premiseId}: ${r.relationship}`)
+}
+```
+
+---
+
+#### `buildPremiseProfile(premise)` → `TCorePremiseProfile`
+
+Builds a profile of a premise's variable appearances, recording each variable's side (`antecedent` or `consequent`) and polarity (`positive` or `negative`, determined by negation depth). Used internally by `analyzePremiseRelationships` but also exported for direct use.
+
+---
+
+#### `parseFormula(input)` → `FormulaAST`
+
+Parses a logical formula string into an AST. Supports standard logical notation with operators `not`/`¬`, `and`/`∧`, `or`/`∨`, `implies`/`→`, `iff`/`↔`, and parentheses for grouping.
+
+```typescript
+import { parseFormula } from "@polintpro/proposit-core"
+import type { FormulaAST } from "@polintpro/proposit-core"
+
+const ast: FormulaAST = parseFormula("(P and Q) implies R")
+```
+
+---
+
 ## CLI
 
 The package ships a command-line interface for managing arguments stored on disk.
@@ -657,6 +729,8 @@ proposit-core <id> <ver> analysis list [--json]
 proposit-core <id> <ver> analysis show [--file <filename>] [--json]
 proposit-core <id> <ver> analysis set <symbol> <true|false> [--file <filename>]
 proposit-core <id> <ver> analysis reset [--file <filename>] [--value <true|false>]
+proposit-core <id> <ver> analysis reject <expression_id> [--file <filename>]
+proposit-core <id> <ver> analysis accept <expression_id> [--file <filename>]
 proposit-core <id> <ver> analysis validate-assignments [--file <filename>] [--json]
 proposit-core <id> <ver> analysis delete [--file <filename>] [--confirm]
 proposit-core <id> <ver> analysis evaluate [--file <filename>] [options]
@@ -668,6 +742,8 @@ proposit-core <id> <ver> analysis export [--json]
 
 `--file` defaults to `analysis.json` throughout. Key subcommands:
 
+- **`reject`** — marks an expression as rejected (it will evaluate to `false` and its children are skipped).
+- **`accept`** — removes an expression from the rejected list (restores normal computation).
 - **`evaluate`** — resolves symbol→ID, evaluates the argument, reports admissibility, counterexample status, and whether the conclusion is true.
 - **`check-validity`** — runs the full truth-table search (`--mode first-counterexample|exhaustive`).
 - **`validate-argument`** — checks structural readiness (conclusion set, inference premises, etc.).

package/dist/index.d.ts

@@ -10,6 +10,8 @@ export { ArgumentEngine, PremiseManager } from "./lib/index.js";
 export * from "./lib/schemata/index.js";
 export * from "./lib/types/diff.js";
 export { diffArguments, defaultCompareArgument, defaultCompareVariable, defaultComparePremise, defaultCompareExpression, } from "./lib/core/diff.js";
+export * from "./lib/types/relationships.js";
+export { analyzePremiseRelationships, buildPremiseProfile, } from "./lib/core/relationships.js";
 export { parseFormula } from "./lib/core/parser/formula.js";
 export type { FormulaAST } from "./lib/core/parser/formula.js";
 //# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,OAAO,EAAE,cAAc,EAAE,cAAc,EAAE,MAAM,gBAAgB,CAAA;AAC/D,cAAc,yBAAyB,CAAA;AACvC,cAAc,qBAAqB,CAAA;AACnC,OAAO,EACH,aAAa,EACb,sBAAsB,EACtB,sBAAsB,EACtB,qBAAqB,EACrB,wBAAwB,GAC3B,MAAM,oBAAoB,CAAA;AAC3B,OAAO,EAAE,YAAY,EAAE,MAAM,8BAA8B,CAAA;AAC3D,YAAY,EAAE,UAAU,EAAE,MAAM,8BAA8B,CAAA"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,OAAO,EAAE,cAAc,EAAE,cAAc,EAAE,MAAM,gBAAgB,CAAA;AAC/D,cAAc,yBAAyB,CAAA;AACvC,cAAc,qBAAqB,CAAA;AACnC,OAAO,EACH,aAAa,EACb,sBAAsB,EACtB,sBAAsB,EACtB,qBAAqB,EACrB,wBAAwB,GAC3B,MAAM,oBAAoB,CAAA;AAC3B,cAAc,8BAA8B,CAAA;AAC5C,OAAO,EACH,2BAA2B,EAC3B,mBAAmB,GACtB,MAAM,6BAA6B,CAAA;AACpC,OAAO,EAAE,YAAY,EAAE,MAAM,8BAA8B,CAAA;AAC3D,YAAY,EAAE,UAAU,EAAE,MAAM,8BAA8B,CAAA"}

package/dist/index.js

@@ -10,5 +10,7 @@ export { ArgumentEngine, PremiseManager } from "./lib/index.js";
 export * from "./lib/schemata/index.js";
 export * from "./lib/types/diff.js";
 export { diffArguments, defaultCompareArgument, defaultCompareVariable, defaultComparePremise, defaultCompareExpression, } from "./lib/core/diff.js";
+export * from "./lib/types/relationships.js";
+export { analyzePremiseRelationships, buildPremiseProfile, } from "./lib/core/relationships.js";
 export { parseFormula } from "./lib/core/parser/formula.js";
 //# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,OAAO,EAAE,cAAc,EAAE,cAAc,EAAE,MAAM,gBAAgB,CAAA;AAC/D,cAAc,yBAAyB,CAAA;AACvC,cAAc,qBAAqB,CAAA;AACnC,OAAO,EACH,aAAa,EACb,sBAAsB,EACtB,sBAAsB,EACtB,qBAAqB,EACrB,wBAAwB,GAC3B,MAAM,oBAAoB,CAAA;AAC3B,OAAO,EAAE,YAAY,EAAE,MAAM,8BAA8B,CAAA"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,OAAO,EAAE,cAAc,EAAE,cAAc,EAAE,MAAM,gBAAgB,CAAA;AAC/D,cAAc,yBAAyB,CAAA;AACvC,cAAc,qBAAqB,CAAA;AACnC,OAAO,EACH,aAAa,EACb,sBAAsB,EACtB,sBAAsB,EACtB,qBAAqB,EACrB,wBAAwB,GAC3B,MAAM,oBAAoB,CAAA;AAC3B,cAAc,8BAA8B,CAAA;AAC5C,OAAO,EACH,2BAA2B,EAC3B,mBAAmB,GACtB,MAAM,6BAA6B,CAAA;AACpC,OAAO,EAAE,YAAY,EAAE,MAAM,8BAA8B,CAAA"}

package/dist/lib/core/relationships.d.ts

@@ -0,0 +1,15 @@
+import type { ArgumentEngine } from "./ArgumentEngine.js";
+import type { PremiseManager } from "./PremiseManager.js";
+import type { TCorePremiseProfile, TCorePremiseRelationshipAnalysis } from "../types/relationships.js";
+/**
+ * Builds a profile of a premise's variable appearances, recording each
+ * variable's side (antecedent/consequent) and polarity (positive/negative).
+ */
+export declare function buildPremiseProfile(premise: PremiseManager): TCorePremiseProfile;
+/**
+ * Analyzes how every other premise in the argument relates to the focused
+ * premise, classifying each as supporting, contradicting, restricting,
+ * downstream, or unrelated.
+ */
+export declare function analyzePremiseRelationships(engine: ArgumentEngine, focusedPremiseId: string): TCorePremiseRelationshipAnalysis;
+//# sourceMappingURL=relationships.d.ts.map

package/dist/lib/core/relationships.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"relationships.d.ts","sourceRoot":"","sources":["../../../src/lib/core/relationships.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAA;AACzD,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAA;AACzD,OAAO,KAAK,EAER,mBAAmB,EAGnB,gCAAgC,EAEnC,MAAM,2BAA2B,CAAA;AAuClC;;;GAGG;AACH,wBAAgB,mBAAmB,CAC/B,OAAO,EAAE,cAAc,GACxB,mBAAmB,CAyBrB;AAwPD;;;;GAIG;AACH,wBAAgB,2BAA2B,CACvC,MAAM,EAAE,cAAc,EACtB,gBAAgB,EAAE,MAAM,GACzB,gCAAgC,CA2HlC"}

package/dist/lib/core/relationships.js

@@ -0,0 +1,319 @@
+// ── Variable profiling ──────────────────────────────────────────────────
+function collectVariableAppearances(premise, expressionId, side) {
+    const appearances = [];
+    const stack = [
+        { id: expressionId, negationDepth: 0 },
+    ];
+    while (stack.length > 0) {
+        const { id, negationDepth } = stack.pop();
+        const expr = premise.getExpression(id);
+        if (!expr)
+            continue;
+        if (expr.type === "variable") {
+            appearances.push({
+                variableId: expr.variableId,
+                side,
+                polarity: negationDepth % 2 === 0 ? "positive" : "negative",
+            });
+        }
+        else {
+            const nextDepth = expr.type === "operator" && expr.operator === "not"
+                ? negationDepth + 1
+                : negationDepth;
+            for (const child of premise.getChildExpressions(id)) {
+                stack.push({ id: child.id, negationDepth: nextDepth });
+            }
+        }
+    }
+    return appearances;
+}
+/**
+ * Builds a profile of a premise's variable appearances, recording each
+ * variable's side (antecedent/consequent) and polarity (positive/negative).
+ */
+export function buildPremiseProfile(premise) {
+    const premiseId = premise.getId();
+    if (!premise.isInference()) {
+        return { premiseId, isInference: false, appearances: [] };
+    }
+    const root = premise.getRootExpression();
+    const children = premise.getChildExpressions(root.id);
+    const leftChild = children.find((c) => c.position === 0);
+    const rightChild = children.find((c) => c.position === 1);
+    const appearances = [];
+    if (leftChild) {
+        appearances.push(...collectVariableAppearances(premise, leftChild.id, "antecedent"));
+    }
+    if (rightChild) {
+        appearances.push(...collectVariableAppearances(premise, rightChild.id, "consequent"));
+    }
+    return { premiseId, isInference: true, appearances };
+}
+// ── Graph construction ──────────────────────────────────────────────────
+function buildVariableFlowGraph(profiles) {
+    const graph = new Map();
+    for (const [sourceId, sourceProfile] of profiles) {
+        if (!sourceProfile.isInference)
+            continue;
+        const edges = [];
+        const conseqVars = sourceProfile.appearances.filter((a) => a.side === "consequent");
+        for (const [targetId, targetProfile] of profiles) {
+            if (targetId === sourceId || !targetProfile.isInference)
+                continue;
+            const anteVars = targetProfile.appearances.filter((a) => a.side === "antecedent");
+            const variables = [];
+            for (const cv of conseqVars) {
+                for (const av of anteVars) {
+                    if (cv.variableId === av.variableId) {
+                        variables.push({
+                            variableId: cv.variableId,
+                            polarityMatch: cv.polarity === av.polarity,
+                        });
+                    }
+                }
+            }
+            if (variables.length > 0) {
+                edges.push({ targetPremiseId: targetId, variables });
+            }
+        }
+        graph.set(sourceId, edges);
+    }
+    return graph;
+}
+function bfsToTarget(graph, sourceId, targetId) {
+    const visited = new Set();
+    visited.add(sourceId);
+    const queue = [];
+    // Seed with direct edges from source
+    const sourceEdges = graph.get(sourceId) ?? [];
+    for (const edge of sourceEdges) {
+        const allMatch = edge.variables.every((v) => v.polarityMatch);
+        if (edge.targetPremiseId === targetId) {
+            return {
+                reachable: true,
+                polarityMatch: allMatch,
+                variableDetails: edge.variables.map((v) => ({
+                    variableId: v.variableId,
+                    relationship: v.polarityMatch
+                        ? "supporting"
+                        : "contradicting",
+                })),
+                transitive: false,
+            };
+        }
+        if (!visited.has(edge.targetPremiseId)) {
+            visited.add(edge.targetPremiseId);
+            queue.push({
+                premiseId: edge.targetPremiseId,
+                polarityMatch: allMatch,
+                entryVariables: edge.variables,
+            });
+        }
+    }
+    while (queue.length > 0) {
+        const { premiseId, polarityMatch, entryVariables } = queue.shift();
+        const edges = graph.get(premiseId) ?? [];
+        for (const edge of edges) {
+            if (edge.targetPremiseId === targetId) {
+                const stepMatch = edge.variables.every((v) => v.polarityMatch);
+                // XOR logic: both match or both mismatch = overall match
+                const finalMatch = (polarityMatch && stepMatch) ||
+                    (!polarityMatch && !stepMatch);
+                return {
+                    reachable: true,
+                    polarityMatch: finalMatch,
+                    variableDetails: entryVariables.map((v) => ({
+                        variableId: v.variableId,
+                        relationship: finalMatch
+                            ? "supporting"
+                            : "contradicting",
+                    })),
+                    transitive: true,
+                };
+            }
+            if (!visited.has(edge.targetPremiseId)) {
+                visited.add(edge.targetPremiseId);
+                const stepMatch = edge.variables.every((v) => v.polarityMatch);
+                const nextMatch = (polarityMatch && stepMatch) ||
+                    (!polarityMatch && !stepMatch);
+                queue.push({
+                    premiseId: edge.targetPremiseId,
+                    polarityMatch: nextMatch,
+                    entryVariables,
+                });
+            }
+        }
+    }
+    return {
+        reachable: false,
+        polarityMatch: true,
+        variableDetails: [],
+        transitive: false,
+    };
+}
+// ── Restricting check ───────────────────────────────────────────────────
+function hasVariableOnBothSides(profile, focusedProfile) {
+    const antecedentVarIds = new Set(profile.appearances
+        .filter((a) => a.side === "antecedent")
+        .map((a) => a.variableId));
+    const consequentVarIds = new Set(profile.appearances
+        .filter((a) => a.side === "consequent")
+        .map((a) => a.variableId));
+    const bothSideVarIds = new Set([...antecedentVarIds].filter((id) => consequentVarIds.has(id)));
+    const focusedVarIds = new Set(focusedProfile.appearances.map((a) => a.variableId));
+    const restricting = [];
+    for (const varId of bothSideVarIds) {
+        if (focusedVarIds.has(varId)) {
+            restricting.push({
+                variableId: varId,
+                relationship: "restricting",
+            });
+        }
+    }
+    return restricting;
+}
+// ── Constraint premise classification ───────────────────────────────────
+function classifyConstraintPremise(premise, focusedProfile, connectedVarIds) {
+    const premiseVarIds = new Set(premise.getVariables().map((v) => v.id));
+    const focusedVarIds = new Set(focusedProfile.appearances.map((a) => a.variableId));
+    const directOverlap = [...premiseVarIds].some((id) => focusedVarIds.has(id));
+    const transitiveOverlap = [...premiseVarIds].some((id) => connectedVarIds.has(id));
+    if (directOverlap || transitiveOverlap) {
+        return {
+            premiseId: premise.getId(),
+            relationship: "restricting",
+            variableDetails: [],
+            transitive: !directOverlap && transitiveOverlap,
+        };
+    }
+    return {
+        premiseId: premise.getId(),
+        relationship: "unrelated",
+        variableDetails: [],
+        transitive: false,
+    };
+}
+// ── Precedence ──────────────────────────────────────────────────────────
+const PRECEDENCE = {
+    contradicting: 3,
+    restricting: 2,
+    supporting: 1,
+};
+function applyPrecedence(details) {
+    let highest = "supporting";
+    for (const d of details) {
+        if (PRECEDENCE[d.relationship] > PRECEDENCE[highest]) {
+            highest = d.relationship;
+        }
+    }
+    return highest;
+}
+// ── Main function ───────────────────────────────────────────────────────
+/**
+ * Analyzes how every other premise in the argument relates to the focused
+ * premise, classifying each as supporting, contradicting, restricting,
+ * downstream, or unrelated.
+ */
+export function analyzePremiseRelationships(engine, focusedPremiseId) {
+    const focusedPremise = engine.getPremise(focusedPremiseId);
+    if (!focusedPremise) {
+        throw new Error(`Premise "${focusedPremiseId}" does not exist in the argument.`);
+    }
+    const allPremises = engine.listPremises();
+    const otherPremises = allPremises.filter((pm) => pm.getId() !== focusedPremiseId);
+    if (otherPremises.length === 0) {
+        return { focusedPremiseId, premises: [] };
+    }
+    // Build profiles for all premises
+    const profiles = new Map();
+    for (const pm of allPremises) {
+        profiles.set(pm.getId(), buildPremiseProfile(pm));
+    }
+    const focusedProfile = profiles.get(focusedPremiseId);
+    // Build variable flow graph (inference premises only)
+    const graph = buildVariableFlowGraph(profiles);
+    // Collect all variable IDs connected to the focused premise
+    // (for constraint classification)
+    const connectedVarIds = new Set();
+    for (const pm of allPremises) {
+        const pmId = pm.getId();
+        if (pmId === focusedPremiseId)
+            continue;
+        const profile = profiles.get(pmId);
+        if (!profile.isInference)
+            continue;
+        const toFocused = bfsToTarget(graph, pmId, focusedPremiseId);
+        const fromFocused = bfsToTarget(graph, focusedPremiseId, pmId);
+        if (toFocused.reachable || fromFocused.reachable) {
+            for (const v of pm.getVariables()) {
+                connectedVarIds.add(v.id);
+            }
+        }
+    }
+    for (const a of focusedProfile.appearances) {
+        connectedVarIds.add(a.variableId);
+    }
+    // Classify each premise
+    const results = [];
+    for (const pm of otherPremises) {
+        const pmId = pm.getId();
+        const profile = profiles.get(pmId);
+        // Constraint premises get special handling
+        if (!profile.isInference) {
+            results.push(classifyConstraintPremise(pm, focusedProfile, connectedVarIds));
+            continue;
+        }
+        // If focused premise is a constraint, all sharing premises are
+        // restricting
+        if (!focusedProfile.isInference) {
+            const focusedVarIds = new Set(focusedPremise.getVariables().map((v) => v.id));
+            const pmVarIds = new Set(pm.getVariables().map((v) => v.id));
+            const shares = [...pmVarIds].some((id) => focusedVarIds.has(id));
+            results.push({
+                premiseId: pmId,
+                relationship: shares ? "restricting" : "unrelated",
+                variableDetails: [],
+                transitive: false,
+            });
+            continue;
+        }
+        // Check restricting (variable on both sides of source, appearing
+        // in focused)
+        const restrictingDetails = hasVariableOnBothSides(profile, focusedProfile);
+        // Check forward path (source → focused)
+        const toFocused = bfsToTarget(graph, pmId, focusedPremiseId);
+        // Check reverse path (focused → source) for downstream
+        const fromFocused = bfsToTarget(graph, focusedPremiseId, pmId);
+        if (restrictingDetails.length > 0 || toFocused.reachable) {
+            const allDetails = [
+                ...restrictingDetails,
+                ...toFocused.variableDetails,
+            ];
+            const relationship = applyPrecedence(allDetails);
+            results.push({
+                premiseId: pmId,
+                relationship,
+                variableDetails: allDetails,
+                transitive: toFocused.transitive,
+            });
+        }
+        else if (fromFocused.reachable) {
+            results.push({
+                premiseId: pmId,
+                relationship: "downstream",
+                variableDetails: [],
+                transitive: fromFocused.transitive,
+            });
+        }
+        else {
+            results.push({
+                premiseId: pmId,
+                relationship: "unrelated",
+                variableDetails: [],
+                transitive: false,
+            });
+        }
+    }
+    return { focusedPremiseId, premises: results };
+}
+//# sourceMappingURL=relationships.js.map

package/dist/lib/core/relationships.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"relationships.js","sourceRoot":"","sources":["../../../src/lib/core/relationships.ts"],"names":[],"mappings":"AAWA,2EAA2E;AAE3E,SAAS,0BAA0B,CAC/B,OAAuB,EACvB,YAAoB,EACpB,IAAsB;IAEtB,MAAM,WAAW,GAA8B,EAAE,CAAA;IACjD,MAAM,KAAK,GAA4C;QACnD,EAAE,EAAE,EAAE,YAAY,EAAE,aAAa,EAAE,CAAC,EAAE;KACzC,CAAA;IAED,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtB,MAAM,EAAE,EAAE,EAAE,aAAa,EAAE,GAAG,KAAK,CAAC,GAAG,EAAG,CAAA;QAC1C,MAAM,IAAI,GAAG,OAAO,CAAC,aAAa,CAAC,EAAE,CAAC,CAAA;QACtC,IAAI,CAAC,IAAI;YAAE,SAAQ;QAEnB,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;YAC3B,WAAW,CAAC,IAAI,CAAC;gBACb,UAAU,EAAE,IAAI,CAAC,UAAU;gBAC3B,IAAI;gBACJ,QAAQ,EAAE,aAAa,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,UAAU;aAC9D,CAAC,CAAA;QACN,CAAC;aAAM,CAAC;YACJ,MAAM,SAAS,GACX,IAAI,CAAC,IAAI,KAAK,UAAU,IAAI,IAAI,CAAC,QAAQ,KAAK,KAAK;gBAC/C,CAAC,CAAC,aAAa,GAAG,CAAC;gBACnB,CAAC,CAAC,aAAa,CAAA;YACvB,KAAK,MAAM,KAAK,IAAI,OAAO,CAAC,mBAAmB,CAAC,EAAE,CAAC,EAAE,CAAC;gBAClD,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,KAAK,CAAC,EAAE,EAAE,aAAa,EAAE,SAAS,EAAE,CAAC,CAAA;YAC1D,CAAC;QACL,CAAC;IACL,CAAC;IAED,OAAO,WAAW,CAAA;AACtB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,mBAAmB,CAC/B,OAAuB;IAEvB,MAAM,SAAS,GAAG,OAAO,CAAC,KAAK,EAAE,CAAA;IAEjC,IAAI,CAAC,OAAO,CAAC,WAAW,EAAE,EAAE,CAAC;QACzB,OAAO,EAAE,SAAS,EAAE,WAAW,EAAE,KAAK,EAAE,WAAW,EAAE,EAAE,EAAE,CAAA;IAC7D,CAAC;IAED,MAAM,IAAI,GAAG,OAAO,CAAC,iBAAiB,EAAG,CAAA;IACzC,MAAM,QAAQ,GAAG,OAAO,CAAC,mBAAmB,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;IACrD,MAAM,SAAS,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,CAAA;IACxD,MAAM,UAAU,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,CAAA;IAEzD,MAAM,WAAW,GAA8B,EAAE,CAAA;IACjD,IAAI,SAAS,EAAE,CAAC;QACZ,WAAW,CAAC,IAAI,CACZ,GAAG,0BAA0B,CAAC,OAAO,EAAE,SAAS,CAAC,EAAE,EAAE,YAAY,CAAC,CACrE,CAAA;IACL,CAAC;IACD,IAAI,UAAU,EAAE,CAAC;QACb,WAAW,CAAC,IAAI,CACZ,GAAG,0BAA0B,CAAC,OAAO,EAAE,UAAU,CAAC,EAAE,EAAE,YAAY,CAAC,CACtE,CAAA;IACL,CAAC;IAED,OAAO,EAAE,SAAS,EAAE,WAAW,EAAE,IAAI,EAAE,WAAW,EAAE,CAAA;AACxD,CAAC;AAcD,2EAA2E;AAE3E,SAAS,sBAAsB,CAC3B,QAA0C;IAE1C,MAAM,KAAK,GAAG,IAAI,GAAG,EAAyB,CAAA;IAE9C,KAAK,MAAM,CAAC,QAAQ,EAAE,aAAa,CAAC,IAAI,QAAQ,EAAE,CAAC;QAC/C,IAAI,CAAC,aAAa,CAAC,WAAW;YAAE,SAAQ;QACxC,MAAM,KAAK,GAAkB,EAAE,CAAA;QAE/B,MAAM,UAAU,GAAG,aAAa,CAAC,WAAW,CAAC,MAAM,CAC/C,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,YAAY,CACjC,CAAA;QAED,KAAK,MAAM,CAAC,QAAQ,EAAE,aAAa,CAAC,IAAI,QAAQ,EAAE,CAAC;YAC/C,IAAI,QAAQ,KAAK,QAAQ,IAAI,CAAC,aAAa,CAAC,WAAW;gBAAE,SAAQ;YAEjE,MAAM,QAAQ,GAAG,aAAa,CAAC,WAAW,CAAC,MAAM,CAC7C,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,YAAY,CACjC,CAAA;YAED,MAAM,SAAS,GAAmB,EAAE,CAAA;YACpC,KAAK,MAAM,EAAE,IAAI,UAAU,EAAE,CAAC;gBAC1B,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;oBACxB,IAAI,EAAE,CAAC,UAAU,KAAK,EAAE,CAAC,UAAU,EAAE,CAAC;wBAClC,SAAS,CAAC,IAAI,CAAC;4BACX,UAAU,EAAE,EAAE,CAAC,UAAU;4BACzB,aAAa,EAAE,EAAE,CAAC,QAAQ,KAAK,EAAE,CAAC,QAAQ;yBAC7C,CAAC,CAAA;oBACN,CAAC;gBACL,CAAC;YACL,CAAC;YAED,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACvB,KAAK,CAAC,IAAI,CAAC,EAAE,eAAe,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC,CAAA;YACxD,CAAC;QACL,CAAC;QAED,KAAK,CAAC,GAAG,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAA;IAC9B,CAAC;IAED,OAAO,KAAK,CAAA;AAChB,CAAC;AAWD,SAAS,WAAW,CAChB,KAAiC,EACjC,QAAgB,EAChB,QAAgB;IAEhB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAA;IACjC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;IAErB,MAAM,KAAK,GAIL,EAAE,CAAA;IAER,qCAAqC;IACrC,MAAM,WAAW,GAAG,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAA;IAC7C,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;QAC7B,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,CAAA;QAC7D,IAAI,IAAI,CAAC,eAAe,KAAK,QAAQ,EAAE,CAAC;YACpC,OAAO;gBACH,SAAS,EAAE,IAAI;gBACf,aAAa,EAAE,QAAQ;gBACvB,eAAe,EAAE,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;oBACxC,UAAU,EAAE,CAAC,CAAC,UAAU;oBACxB,YAAY,EAAE,CAAC,CAAC,aAAa;wBACzB,CAAC,CAAC,YAAY;wBACd,CAAC,CAAC,eAAe;iBACxB,CAAC,CAAC;gBACH,UAAU,EAAE,KAAK;aACpB,CAAA;QACL,CAAC;QACD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,eAAe,CAAC,EAAE,CAAC;YACrC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,eAAe,CAAC,CAAA;YACjC,KAAK,CAAC,IAAI,CAAC;gBACP,SAAS,EAAE,IAAI,CAAC,eAAe;gBAC/B,aAAa,EAAE,QAAQ;gBACvB,cAAc,EAAE,IAAI,CAAC,SAAS;aACjC,CAAC,CAAA;QACN,CAAC;IACL,CAAC;IAED,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtB,MAAM,EAAE,SAAS,EAAE,aAAa,EAAE,cAAc,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAA;QACnE,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,EAAE,CAAA;QAExC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACvB,IAAI,IAAI,CAAC,eAAe,KAAK,QAAQ,EAAE,CAAC;gBACpC,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,CAAA;gBAC9D,yDAAyD;gBACzD,MAAM,UAAU,GACZ,CAAC,aAAa,IAAI,SAAS,CAAC;oBAC5B,CAAC,CAAC,aAAa,IAAI,CAAC,SAAS,CAAC,CAAA;gBAClC,OAAO;oBACH,SAAS,EAAE,IAAI;oBACf,aAAa,EAAE,UAAU;oBACzB,eAAe,EAAE,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;wBACxC,UAAU,EAAE,CAAC,CAAC,UAAU;wBACxB,YAAY,EAAE,UAAU;4BACpB,CAAC,CAAC,YAAY;4BACd,CAAC,CAAC,eAAe;qBACxB,CAAC,CAAC;oBACH,UAAU,EAAE,IAAI;iBACnB,CAAA;YACL,CAAC;YACD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,eAAe,CAAC,EAAE,CAAC;gBACrC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,eAAe,CAAC,CAAA;gBACjC,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,CAAA;gBAC9D,MAAM,SAAS,GACX,CAAC,aAAa,IAAI,SAAS,CAAC;oBAC5B,CAAC,CAAC,aAAa,IAAI,CAAC,SAAS,CAAC,CAAA;gBAClC,KAAK,CAAC,IAAI,CAAC;oBACP,SAAS,EAAE,IAAI,CAAC,eAAe;oBAC/B,aAAa,EAAE,SAAS;oBACxB,cAAc;iBACjB,CAAC,CAAA;YACN,CAAC;QACL,CAAC;IACL,CAAC;IAED,OAAO;QACH,SAAS,EAAE,KAAK;QAChB,aAAa,EAAE,IAAI;QACnB,eAAe,EAAE,EAAE;QACnB,UAAU,EAAE,KAAK;KACpB,CAAA;AACL,CAAC;AAED,2EAA2E;AAE3E,SAAS,sBAAsB,CAC3B,OAA4B,EAC5B,cAAmC;IAEnC,MAAM,gBAAgB,GAAG,IAAI,GAAG,CAC5B,OAAO,CAAC,WAAW;SACd,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,YAAY,CAAC;SACtC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAChC,CAAA;IACD,MAAM,gBAAgB,GAAG,IAAI,GAAG,CAC5B,OAAO,CAAC,WAAW;SACd,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,YAAY,CAAC;SACtC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAChC,CAAA;IAED,MAAM,cAAc,GAAG,IAAI,GAAG,CAC1B,CAAC,GAAG,gBAAgB,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,gBAAgB,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CACjE,CAAA;IAED,MAAM,aAAa,GAAG,IAAI,GAAG,CACzB,cAAc,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CACtD,CAAA;IAED,MAAM,WAAW,GAAgC,EAAE,CAAA;IACnD,KAAK,MAAM,KAAK,IAAI,cAAc,EAAE,CAAC;QACjC,IAAI,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YAC3B,WAAW,CAAC,IAAI,CAAC;gBACb,UAAU,EAAE,KAAK;gBACjB,YAAY,EAAE,aAAa;aAC9B,CAAC,CAAA;QACN,CAAC;IACL,CAAC;IACD,OAAO,WAAW,CAAA;AACtB,CAAC;AAED,2EAA2E;AAE3E,SAAS,yBAAyB,CAC9B,OAAuB,EACvB,cAAmC,EACnC,eAA4B;IAE5B,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,YAAY,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IACtE,MAAM,aAAa,GAAG,IAAI,GAAG,CACzB,cAAc,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CACtD,CAAA;IAED,MAAM,aAAa,GAAG,CAAC,GAAG,aAAa,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAA;IAC5E,MAAM,iBAAiB,GAAG,CAAC,GAAG,aAAa,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CACrD,eAAe,CAAC,GAAG,CAAC,EAAE,CAAC,CAC1B,CAAA;IAED,IAAI,aAAa,IAAI,iBAAiB,EAAE,CAAC;QACrC,OAAO;YACH,SAAS,EAAE,OAAO,CAAC,KAAK,EAAE;YAC1B,YAAY,EAAE,aAAa;YAC3B,eAAe,EAAE,EAAE;YACnB,UAAU,EAAE,CAAC,aAAa,IAAI,iBAAiB;SAClD,CAAA;IACL,CAAC;IAED,OAAO;QACH,SAAS,EAAE,OAAO,CAAC,KAAK,EAAE;QAC1B,YAAY,EAAE,WAAW;QACzB,eAAe,EAAE,EAAE;QACnB,UAAU,EAAE,KAAK;KACpB,CAAA;AACL,CAAC;AAED,2EAA2E;AAE3E,MAAM,UAAU,GAA2B;IACvC,aAAa,EAAE,CAAC;IAChB,WAAW,EAAE,CAAC;IACd,UAAU,EAAE,CAAC;CAChB,CAAA;AAED,SAAS,eAAe,CACpB,OAAoC;IAEpC,IAAI,OAAO,GAAmD,YAAY,CAAA;IAC1E,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACtB,IAAI,UAAU,CAAC,CAAC,CAAC,YAAY,CAAC,GAAG,UAAU,CAAC,OAAO,CAAC,EAAE,CAAC;YACnD,OAAO,GAAG,CAAC,CAAC,YAAY,CAAA;QAC5B,CAAC;IACL,CAAC;IACD,OAAO,OAAO,CAAA;AAClB,CAAC;AAED,2EAA2E;AAE3E;;;;GAIG;AACH,MAAM,UAAU,2BAA2B,CACvC,MAAsB,EACtB,gBAAwB;IAExB,MAAM,cAAc,GAAG,MAAM,CAAC,UAAU,CAAC,gBAAgB,CAAC,CAAA;IAC1D,IAAI,CAAC,cAAc,EAAE,CAAC;QAClB,MAAM,IAAI,KAAK,CACX,YAAY,gBAAgB,mCAAmC,CAClE,CAAA;IACL,CAAC;IAED,MAAM,WAAW,GAAG,MAAM,CAAC,YAAY,EAAE,CAAA;IACzC,MAAM,aAAa,GAAG,WAAW,CAAC,MAAM,CACpC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,KAAK,EAAE,KAAK,gBAAgB,CAC1C,CAAA;IAED,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC7B,OAAO,EAAE,gBAAgB,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAA;IAC7C,CAAC;IAED,kCAAkC;IAClC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAA+B,CAAA;IACvD,KAAK,MAAM,EAAE,IAAI,WAAW,EAAE,CAAC;QAC3B,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,EAAE,EAAE,mBAAmB,CAAC,EAAE,CAAC,CAAC,CAAA;IACrD,CAAC;IAED,MAAM,cAAc,GAAG,QAAQ,CAAC,GAAG,CAAC,gBAAgB,CAAE,CAAA;IAEtD,sDAAsD;IACtD,MAAM,KAAK,GAAG,sBAAsB,CAAC,QAAQ,CAAC,CAAA;IAE9C,4DAA4D;IAC5D,kCAAkC;IAClC,MAAM,eAAe,GAAG,IAAI,GAAG,EAAU,CAAA;IACzC,KAAK,MAAM,EAAE,IAAI,WAAW,EAAE,CAAC;QAC3B,MAAM,IAAI,GAAG,EAAE,CAAC,KAAK,EAAE,CAAA;QACvB,IAAI,IAAI,KAAK,gBAAgB;YAAE,SAAQ;QACvC,MAAM,OAAO,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAE,CAAA;QACnC,IAAI,CAAC,OAAO,CAAC,WAAW;YAAE,SAAQ;QAClC,MAAM,SAAS,GAAG,WAAW,CAAC,KAAK,EAAE,IAAI,EAAE,gBAAgB,CAAC,CAAA;QAC5D,MAAM,WAAW,GAAG,WAAW,CAAC,KAAK,EAAE,gBAAgB,EAAE,IAAI,CAAC,CAAA;QAC9D,IAAI,SAAS,CAAC,SAAS,IAAI,WAAW,CAAC,SAAS,EAAE,CAAC;YAC/C,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC,YAAY,EAAE,EAAE,CAAC;gBAChC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAA;YAC7B,CAAC;QACL,CAAC;IACL,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,cAAc,CAAC,WAAW,EAAE,CAAC;QACzC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC,CAAA;IACrC,CAAC;IAED,wBAAwB;IACxB,MAAM,OAAO,GAAiC,EAAE,CAAA;IAEhD,KAAK,MAAM,EAAE,IAAI,aAAa,EAAE,CAAC;QAC7B,MAAM,IAAI,GAAG,EAAE,CAAC,KAAK,EAAE,CAAA;QACvB,MAAM,OAAO,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAE,CAAA;QAEnC,2CAA2C;QAC3C,IAAI,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC;YACvB,OAAO,CAAC,IAAI,CACR,yBAAyB,CAAC,EAAE,EAAE,cAAc,EAAE,eAAe,CAAC,CACjE,CAAA;YACD,SAAQ;QACZ,CAAC;QAED,+DAA+D;QAC/D,cAAc;QACd,IAAI,CAAC,cAAc,CAAC,WAAW,EAAE,CAAC;YAC9B,MAAM,aAAa,GAAG,IAAI,GAAG,CACzB,cAAc,CAAC,YAAY,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CACjD,CAAA;YACD,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC,YAAY,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;YAC5D,MAAM,MAAM,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAA;YAChE,OAAO,CAAC,IAAI,CAAC;gBACT,SAAS,EAAE,IAAI;gBACf,YAAY,EAAE,MAAM,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,WAAW;gBAClD,eAAe,EAAE,EAAE;gBACnB,UAAU,EAAE,KAAK;aACpB,CAAC,CAAA;YACF,SAAQ;QACZ,CAAC;QAED,iEAAiE;QACjE,cAAc;QACd,MAAM,kBAAkB,GAAG,sBAAsB,CAC7C,OAAO,EACP,cAAc,CACjB,CAAA;QAED,wCAAwC;QACxC,MAAM,SAAS,GAAG,WAAW,CAAC,KAAK,EAAE,IAAI,EAAE,gBAAgB,CAAC,CAAA;QAE5D,uDAAuD;QACvD,MAAM,WAAW,GAAG,WAAW,CAAC,KAAK,EAAE,gBAAgB,EAAE,IAAI,CAAC,CAAA;QAE9D,IAAI,kBAAkB,CAAC,MAAM,GAAG,CAAC,IAAI,SAAS,CAAC,SAAS,EAAE,CAAC;YACvD,MAAM,UAAU,GAAG;gBACf,GAAG,kBAAkB;gBACrB,GAAG,SAAS,CAAC,eAAe;aAC/B,CAAA;YACD,MAAM,YAAY,GAAG,eAAe,CAAC,UAAU,CAAC,CAAA;YAChD,OAAO,CAAC,IAAI,CAAC;gBACT,SAAS,EAAE,IAAI;gBACf,YAAY;gBACZ,eAAe,EAAE,UAAU;gBAC3B,UAAU,EAAE,SAAS,CAAC,UAAU;aACnC,CAAC,CAAA;QACN,CAAC;aAAM,IAAI,WAAW,CAAC,SAAS,EAAE,CAAC;YAC/B,OAAO,CAAC,IAAI,CAAC;gBACT,SAAS,EAAE,IAAI;gBACf,YAAY,EAAE,YAAY;gBAC1B,eAAe,EAAE,EAAE;gBACnB,UAAU,EAAE,WAAW,CAAC,UAAU;aACrC,CAAC,CAAA;QACN,CAAC;aAAM,CAAC;YACJ,OAAO,CAAC,IAAI,CAAC;gBACT,SAAS,EAAE,IAAI;gBACf,YAAY,EAAE,WAAW;gBACzB,eAAe,EAAE,EAAE;gBACnB,UAAU,EAAE,KAAK;aACpB,CAAC,CAAA;QACN,CAAC;IACL,CAAC;IAED,OAAO,EAAE,gBAAgB,EAAE,QAAQ,EAAE,OAAO,EAAE,CAAA;AAClD,CAAC"}

package/dist/lib/index.d.ts

@@ -7,6 +7,8 @@ export { PremiseManager } from "./core/PremiseManager.js";
 export * from "./types/evaluation.js";
 export * from "./types/diff.js";
 export { diffArguments, defaultCompareArgument, defaultCompareVariable, defaultComparePremise, defaultCompareExpression, } from "./core/diff.js";
+export * from "./types/relationships.js";
+export { analyzePremiseRelationships, buildPremiseProfile, } from "./core/relationships.js";
 export { parseFormula } from "./core/parser/formula.js";
 export type { FormulaAST } from "./core/parser/formula.js";
 //# sourceMappingURL=index.d.ts.map

package/dist/lib/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/lib/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,OAAO,EAAE,cAAc,EAAE,MAAM,0BAA0B,CAAA;AACzD,OAAO,EAAE,cAAc,EAAE,MAAM,0BAA0B,CAAA;AACzD,cAAc,uBAAuB,CAAA;AACrC,cAAc,iBAAiB,CAAA;AAC/B,OAAO,EACH,aAAa,EACb,sBAAsB,EACtB,sBAAsB,EACtB,qBAAqB,EACrB,wBAAwB,GAC3B,MAAM,gBAAgB,CAAA;AACvB,OAAO,EAAE,YAAY,EAAE,MAAM,0BAA0B,CAAA;AACvD,YAAY,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAA"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/lib/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,OAAO,EAAE,cAAc,EAAE,MAAM,0BAA0B,CAAA;AACzD,OAAO,EAAE,cAAc,EAAE,MAAM,0BAA0B,CAAA;AACzD,cAAc,uBAAuB,CAAA;AACrC,cAAc,iBAAiB,CAAA;AAC/B,OAAO,EACH,aAAa,EACb,sBAAsB,EACtB,sBAAsB,EACtB,qBAAqB,EACrB,wBAAwB,GAC3B,MAAM,gBAAgB,CAAA;AACvB,cAAc,0BAA0B,CAAA;AACxC,OAAO,EACH,2BAA2B,EAC3B,mBAAmB,GACtB,MAAM,yBAAyB,CAAA;AAChC,OAAO,EAAE,YAAY,EAAE,MAAM,0BAA0B,CAAA;AACvD,YAAY,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAA"}

package/dist/lib/index.js

@@ -7,5 +7,7 @@ export { PremiseManager } from "./core/PremiseManager.js";
 export * from "./types/evaluation.js";
 export * from "./types/diff.js";
 export { diffArguments, defaultCompareArgument, defaultCompareVariable, defaultComparePremise, defaultCompareExpression, } from "./core/diff.js";
+export * from "./types/relationships.js";
+export { analyzePremiseRelationships, buildPremiseProfile, } from "./core/relationships.js";
 export { parseFormula } from "./core/parser/formula.js";
 //# sourceMappingURL=index.js.map

package/dist/lib/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/lib/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,OAAO,EAAE,cAAc,EAAE,MAAM,0BAA0B,CAAA;AACzD,OAAO,EAAE,cAAc,EAAE,MAAM,0BAA0B,CAAA;AACzD,cAAc,uBAAuB,CAAA;AACrC,cAAc,iBAAiB,CAAA;AAC/B,OAAO,EACH,aAAa,EACb,sBAAsB,EACtB,sBAAsB,EACtB,qBAAqB,EACrB,wBAAwB,GAC3B,MAAM,gBAAgB,CAAA;AACvB,OAAO,EAAE,YAAY,EAAE,MAAM,0BAA0B,CAAA"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/lib/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,OAAO,EAAE,cAAc,EAAE,MAAM,0BAA0B,CAAA;AACzD,OAAO,EAAE,cAAc,EAAE,MAAM,0BAA0B,CAAA;AACzD,cAAc,uBAAuB,CAAA;AACrC,cAAc,iBAAiB,CAAA;AAC/B,OAAO,EACH,aAAa,EACb,sBAAsB,EACtB,sBAAsB,EACtB,qBAAqB,EACrB,wBAAwB,GAC3B,MAAM,gBAAgB,CAAA;AACvB,cAAc,0BAA0B,CAAA;AACxC,OAAO,EACH,2BAA2B,EAC3B,mBAAmB,GACtB,MAAM,yBAAyB,CAAA;AAChC,OAAO,EAAE,YAAY,EAAE,MAAM,0BAA0B,CAAA"}

package/dist/lib/types/relationships.d.ts

@@ -0,0 +1,36 @@
+/** Polarity of a variable within an expression subtree. */
+export type TCoreVariablePolarity = "positive" | "negative";
+/** Which side of an inference premise a variable appears on. */
+export type TCorePremiseSide = "antecedent" | "consequent";
+/** A single variable appearance within a premise, recording its side and polarity. */
+export interface TCoreVariableAppearance {
+    variableId: string;
+    side: TCorePremiseSide;
+    polarity: TCoreVariablePolarity;
+}
+/** Profile of a premise's variable appearances, split by antecedent/consequent. */
+export interface TCorePremiseProfile {
+    premiseId: string;
+    isInference: boolean;
+    appearances: TCoreVariableAppearance[];
+}
+/** The five relationship categories a premise can have relative to a focused premise. */
+export type TCorePremiseRelationshipType = "supporting" | "contradicting" | "restricting" | "downstream" | "unrelated";
+/** Per-variable relationship detail explaining why a variable contributes to the classification. */
+export interface TCoreVariableRelationship {
+    variableId: string;
+    relationship: "supporting" | "contradicting" | "restricting";
+}
+/** Classification result for a single premise relative to the focused premise. */
+export interface TCorePremiseRelationResult {
+    premiseId: string;
+    relationship: TCorePremiseRelationshipType;
+    variableDetails: TCoreVariableRelationship[];
+    transitive: boolean;
+}
+/** Top-level result from `analyzePremiseRelationships`. */
+export interface TCorePremiseRelationshipAnalysis {
+    focusedPremiseId: string;
+    premises: TCorePremiseRelationResult[];
+}
+//# sourceMappingURL=relationships.d.ts.map

package/dist/lib/types/relationships.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"relationships.d.ts","sourceRoot":"","sources":["../../../src/lib/types/relationships.ts"],"names":[],"mappings":"AAAA,2DAA2D;AAC3D,MAAM,MAAM,qBAAqB,GAAG,UAAU,GAAG,UAAU,CAAA;AAE3D,gEAAgE;AAChE,MAAM,MAAM,gBAAgB,GAAG,YAAY,GAAG,YAAY,CAAA;AAE1D,sFAAsF;AACtF,MAAM,WAAW,uBAAuB;IACpC,UAAU,EAAE,MAAM,CAAA;IAClB,IAAI,EAAE,gBAAgB,CAAA;IACtB,QAAQ,EAAE,qBAAqB,CAAA;CAClC;AAED,mFAAmF;AACnF,MAAM,WAAW,mBAAmB;IAChC,SAAS,EAAE,MAAM,CAAA;IACjB,WAAW,EAAE,OAAO,CAAA;IACpB,WAAW,EAAE,uBAAuB,EAAE,CAAA;CACzC;AAED,yFAAyF;AACzF,MAAM,MAAM,4BAA4B,GAClC,YAAY,GACZ,eAAe,GACf,aAAa,GACb,YAAY,GACZ,WAAW,CAAA;AAEjB,oGAAoG;AACpG,MAAM,WAAW,yBAAyB;IACtC,UAAU,EAAE,MAAM,CAAA;IAClB,YAAY,EAAE,YAAY,GAAG,eAAe,GAAG,aAAa,CAAA;CAC/D;AAED,kFAAkF;AAClF,MAAM,WAAW,0BAA0B;IACvC,SAAS,EAAE,MAAM,CAAA;IACjB,YAAY,EAAE,4BAA4B,CAAA;IAC1C,eAAe,EAAE,yBAAyB,EAAE,CAAA;IAC5C,UAAU,EAAE,OAAO,CAAA;CACtB;AAED,2DAA2D;AAC3D,MAAM,WAAW,gCAAgC;IAC7C,gBAAgB,EAAE,MAAM,CAAA;IACxB,QAAQ,EAAE,0BAA0B,EAAE,CAAA;CACzC"}

package/dist/lib/types/relationships.js

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=relationships.js.map

package/dist/lib/types/relationships.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"relationships.js","sourceRoot":"","sources":["../../../src/lib/types/relationships.ts"],"names":[],"mappings":""}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@polintpro/proposit-core",
-  "version": "0.1.7",
+  "version": "0.1.8",
   "description": "Core engine for building and manipulating propositional logic arguments.",
   "license": "MIT",
   "keywords": [