@higher.archi/boe 1.0.0

package/dist/engines/constraint/compiler.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"compiler.d.ts","sourceRoot":"","sources":["../../../src/engines/constraint/compiler.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAQH,OAAO,EACL,iBAAiB,EAEjB,yBAAyB,EAS1B,MAAM,SAAS,CAAC;AAuLjB,wBAAgB,wBAAwB,CACtC,OAAO,EAAE,iBAAiB,GACzB,yBAAyB,CAwD3B"}

package/dist/engines/constraint/compiler.js

@@ -0,0 +1,188 @@
+"use strict";
+/**
+ * Constraint Satisfaction Engine Compiler
+ *
+ * Compiles constraint rulesets into an optimized format for solving.
+ * Builds constraint graph for efficient propagation.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.compileConstraintRuleSet = compileConstraintRuleSet;
+const core_1 = require("../../core");
+const types_1 = require("./types");
+// ========================================
+// Default Configuration
+// ========================================
+const DEFAULT_CONFIG = {
+    mode: 'constraint',
+    strategy: 'backtrack',
+    variableOrdering: 'mrv', // Minimum Remaining Values (fail-fast)
+    valueOrdering: 'static',
+    maxIterations: 100000,
+    maxSolutions: 100,
+    timeout: 30000,
+    optimize: 'none' // No optimization by default (backwards compatible)
+};
+// ========================================
+// Variable Compilation
+// ========================================
+function compileVariable(variable, index) {
+    if (!variable.name) {
+        throw new Error(`Variable at index ${index} must have a name`);
+    }
+    if (!Array.isArray(variable.domain) || variable.domain.length === 0) {
+        throw new Error(`Variable '${variable.name}' must have a non-empty domain array`);
+    }
+    return {
+        name: variable.name,
+        domain: [...variable.domain], // Copy to prevent mutation
+        index
+    };
+}
+// ========================================
+// Constraint Compilation
+// ========================================
+function compileConstraint(constraint, variableMap, constraintIndex) {
+    if (!constraint.id) {
+        throw new Error(`Constraint at index ${constraintIndex} must have an id`);
+    }
+    if (!Array.isArray(constraint.variables) || constraint.variables.length === 0) {
+        throw new Error(`Constraint '${constraint.id}' must reference at least one variable`);
+    }
+    // Map variable names to indices
+    const variableIndices = [];
+    for (const varName of constraint.variables) {
+        const index = variableMap.get(varName);
+        if (index === undefined) {
+            throw new Error(`Constraint '${constraint.id}' references unknown variable '${varName}'`);
+        }
+        variableIndices.push(index);
+    }
+    // Compile the constraint rule
+    const condition = (0, core_1.compileCondition)(constraint.rule);
+    return {
+        id: constraint.id,
+        name: constraint.name,
+        variableIndices,
+        variableNames: [...constraint.variables],
+        condition
+    };
+}
+// ========================================
+// Preference Compilation
+// ========================================
+/**
+ * Resolve a preference weight to its numeric value.
+ * Semantic weights are looked up in SEMANTIC_WEIGHTS.
+ */
+function resolveWeight(weight) {
+    if (typeof weight === 'number') {
+        return weight;
+    }
+    return types_1.SEMANTIC_WEIGHTS[weight];
+}
+function compilePreference(preference, variableMap, preferenceIndex) {
+    if (!preference.id) {
+        throw new Error(`Preference at index ${preferenceIndex} must have an id`);
+    }
+    if (!Array.isArray(preference.variables) || preference.variables.length === 0) {
+        throw new Error(`Preference '${preference.id}' must reference at least one variable`);
+    }
+    // Map variable names to indices
+    const variableIndices = [];
+    for (const varName of preference.variables) {
+        const index = variableMap.get(varName);
+        if (index === undefined) {
+            throw new Error(`Preference '${preference.id}' references unknown variable '${varName}'`);
+        }
+        variableIndices.push(index);
+    }
+    // Compile the preference rule
+    const condition = (0, core_1.compileCondition)(preference.rule);
+    // Resolve weight to numeric value
+    const weight = resolveWeight(preference.weight);
+    return {
+        id: preference.id,
+        name: preference.name,
+        variableIndices,
+        variableNames: [...preference.variables],
+        condition,
+        weight
+    };
+}
+// ========================================
+// Constraint Graph Building
+// ========================================
+/**
+ * Build a map from variable index to constraint indices.
+ * Used for efficient constraint propagation.
+ */
+function buildConstraintGraph(variables, constraints) {
+    const graph = new Map();
+    // Initialize empty arrays for each variable
+    for (const variable of variables) {
+        graph.set(variable.index, []);
+    }
+    // Add constraint indices to each involved variable
+    for (let ci = 0; ci < constraints.length; ci++) {
+        const constraint = constraints[ci];
+        for (const varIndex of constraint.variableIndices) {
+            graph.get(varIndex).push(ci);
+        }
+    }
+    return graph;
+}
+// ========================================
+// Input Parameter Compilation
+// ========================================
+function compileInputParameter(input) {
+    return {
+        name: input.name,
+        type: input.type,
+        schema: input.shape ? (0, core_1.normalizeShape)(input.shape) : { type: 'object' }
+    };
+}
+// ========================================
+// RuleSet Compilation
+// ========================================
+function compileConstraintRuleSet(ruleSet) {
+    // Validate mode
+    if (ruleSet.mode !== 'constraint') {
+        throw new Error(`Expected mode 'constraint', got '${ruleSet.mode}'`);
+    }
+    // Compile variables and build name->index map
+    const variableMap = new Map();
+    const compiledVariables = ruleSet.variables.map((variable, index) => {
+        const compiled = compileVariable(variable, index);
+        if (variableMap.has(variable.name)) {
+            throw new Error(`Duplicate variable name: '${variable.name}'`);
+        }
+        variableMap.set(variable.name, index);
+        return compiled;
+    });
+    // Compile constraints
+    const compiledConstraints = ruleSet.constraints.map((constraint, index) => compileConstraint(constraint, variableMap, index));
+    // Compile preferences (soft constraints)
+    const compiledPreferences = (ruleSet.preferences ?? []).map((preference, index) => compilePreference(preference, variableMap, index));
+    // Build constraint graph
+    const constraintsByVariable = buildConstraintGraph(compiledVariables, compiledConstraints);
+    // Merge config with defaults
+    const config = {
+        ...DEFAULT_CONFIG,
+        ...ruleSet.config
+    };
+    // Compile inputs (optional)
+    const inputs = (ruleSet.inputs ?? []).map(compileInputParameter);
+    return {
+        id: ruleSet.id,
+        name: ruleSet.name,
+        mode: 'constraint',
+        schema: ruleSet.shape ? (0, core_1.normalizeShape)(ruleSet.shape) : { type: 'object' },
+        inputs,
+        variables: compiledVariables,
+        constraints: compiledConstraints,
+        preferences: compiledPreferences,
+        constraintsByVariable,
+        config
+    };
+}
+//# sourceMappingURL=compiler.js.map

package/dist/engines/constraint/compiler.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"compiler.js","sourceRoot":"","sources":["../../../src/engines/constraint/compiler.ts"],"names":[],"mappings":";AAAA;;;;;GAKG;;AA2MH,4DA0DC;AAnQD,qCAIoB;AAEpB,mCAYiB;AAEjB,2CAA2C;AAC3C,wBAAwB;AACxB,2CAA2C;AAE3C,MAAM,cAAc,GAAqB;IACvC,IAAI,EAAE,YAAY;IAClB,QAAQ,EAAE,WAAW;IACrB,gBAAgB,EAAE,KAAK,EAAO,uCAAuC;IACrE,aAAa,EAAE,QAAQ;IACvB,aAAa,EAAE,MAAM;IACrB,YAAY,EAAE,GAAG;IACjB,OAAO,EAAE,KAAK;IACd,QAAQ,EAAE,MAAM,CAAc,oDAAoD;CACnF,CAAC;AAEF,2CAA2C;AAC3C,uBAAuB;AACvB,2CAA2C;AAE3C,SAAS,eAAe,CACtB,QAA4B,EAC5B,KAAa;IAEb,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;QACnB,MAAM,IAAI,KAAK,CAAC,qBAAqB,KAAK,mBAAmB,CAAC,CAAC;IACjE,CAAC;IAED,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,QAAQ,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACpE,MAAM,IAAI,KAAK,CAAC,aAAa,QAAQ,CAAC,IAAI,sCAAsC,CAAC,CAAC;IACpF,CAAC;IAED,OAAO;QACL,IAAI,EAAE,QAAQ,CAAC,IAAI;QACnB,MAAM,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC,EAAG,2BAA2B;QAC1D,KAAK;KACN,CAAC;AACJ,CAAC;AAED,2CAA2C;AAC3C,yBAAyB;AACzB,2CAA2C;AAE3C,SAAS,iBAAiB,CACxB,UAAsB,EACtB,WAAgC,EAChC,eAAuB;IAEvB,IAAI,CAAC,UAAU,CAAC,EAAE,EAAE,CAAC;QACnB,MAAM,IAAI,KAAK,CAAC,uBAAuB,eAAe,kBAAkB,CAAC,CAAC;IAC5E,CAAC;IAED,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,SAAS,CAAC,IAAI,UAAU,CAAC,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC9E,MAAM,IAAI,KAAK,CAAC,eAAe,UAAU,CAAC,EAAE,wCAAwC,CAAC,CAAC;IACxF,CAAC;IAED,gCAAgC;IAChC,MAAM,eAAe,GAAa,EAAE,CAAC;IACrC,KAAK,MAAM,OAAO,IAAI,UAAU,CAAC,SAAS,EAAE,CAAC;QAC3C,MAAM,KAAK,GAAG,WAAW,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACvC,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACxB,MAAM,IAAI,KAAK,CACb,eAAe,UAAU,CAAC,EAAE,kCAAkC,OAAO,GAAG,CACzE,CAAC;QACJ,CAAC;QACD,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC9B,CAAC;IAED,8BAA8B;IAC9B,MAAM,SAAS,GAAG,IAAA,uBAAgB,EAAC,UAAU,CAAC,IAAI,CAAC,CAAC;IAEpD,OAAO;QACL,EAAE,EAAE,UAAU,CAAC,EAAE;QACjB,IAAI,EAAE,UAAU,CAAC,IAAI;QACrB,eAAe;QACf,aAAa,EAAE,CAAC,GAAG,UAAU,CAAC,SAAS,CAAC;QACxC,SAAS;KACV,CAAC;AACJ,CAAC;AAED,2CAA2C;AAC3C,yBAAyB;AACzB,2CAA2C;AAE3C;;;GAGG;AACH,SAAS,aAAa,CAAC,MAAwB;IAC7C,IAAI,OAAO,MAAM,KAAK,QAAQ,EAAE,CAAC;QAC/B,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,OAAO,wBAAgB,CAAC,MAAM,CAAC,CAAC;AAClC,CAAC;AAED,SAAS,iBAAiB,CACxB,UAAsB,EACtB,WAAgC,EAChC,eAAuB;IAEvB,IAAI,CAAC,UAAU,CAAC,EAAE,EAAE,CAAC;QACnB,MAAM,IAAI,KAAK,CAAC,uBAAuB,eAAe,kBAAkB,CAAC,CAAC;IAC5E,CAAC;IAED,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,SAAS,CAAC,IAAI,UAAU,CAAC,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC9E,MAAM,IAAI,KAAK,CAAC,eAAe,UAAU,CAAC,EAAE,wCAAwC,CAAC,CAAC;IACxF,CAAC;IAED,gCAAgC;IAChC,MAAM,eAAe,GAAa,EAAE,CAAC;IACrC,KAAK,MAAM,OAAO,IAAI,UAAU,CAAC,SAAS,EAAE,CAAC;QAC3C,MAAM,KAAK,GAAG,WAAW,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACvC,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACxB,MAAM,IAAI,KAAK,CACb,eAAe,UAAU,CAAC,EAAE,kCAAkC,OAAO,GAAG,CACzE,CAAC;QACJ,CAAC;QACD,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC9B,CAAC;IAED,8BAA8B;IAC9B,MAAM,SAAS,GAAG,IAAA,uBAAgB,EAAC,UAAU,CAAC,IAAI,CAAC,CAAC;IAEpD,kCAAkC;IAClC,MAAM,MAAM,GAAG,aAAa,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;IAEhD,OAAO;QACL,EAAE,EAAE,UAAU,CAAC,EAAE;QACjB,IAAI,EAAE,UAAU,CAAC,IAAI;QACrB,eAAe;QACf,aAAa,EAAE,CAAC,GAAG,UAAU,CAAC,SAAS,CAAC;QACxC,SAAS;QACT,MAAM;KACP,CAAC;AACJ,CAAC;AAED,2CAA2C;AAC3C,4BAA4B;AAC5B,2CAA2C;AAE3C;;;GAGG;AACH,SAAS,oBAAoB,CAC3B,SAAuC,EACvC,WAAiC;IAEjC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAoB,CAAC;IAE1C,4CAA4C;IAC5C,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;QACjC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;IAChC,CAAC;IAED,mDAAmD;IACnD,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,WAAW,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC;QAC/C,MAAM,UAAU,GAAG,WAAW,CAAC,EAAE,CAAC,CAAC;QACnC,KAAK,MAAM,QAAQ,IAAI,UAAU,CAAC,eAAe,EAAE,CAAC;YAClD,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAChC,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED,2CAA2C;AAC3C,8BAA8B;AAC9B,2CAA2C;AAE3C,SAAS,qBAAqB,CAAC,KAAU;IACvC,OAAO;QACL,IAAI,EAAE,KAAK,CAAC,IAAI;QAChB,IAAI,EAAE,KAAK,CAAC,IAAI;QAChB,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,IAAA,qBAAc,EAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,QAAiB,EAAE;KAChF,CAAC;AACJ,CAAC;AAED,2CAA2C;AAC3C,sBAAsB;AACtB,2CAA2C;AAE3C,SAAgB,wBAAwB,CACtC,OAA0B;IAE1B,gBAAgB;IAChB,IAAI,OAAO,CAAC,IAAI,KAAK,YAAY,EAAE,CAAC;QAClC,MAAM,IAAI,KAAK,CAAC,oCAAoC,OAAO,CAAC,IAAI,GAAG,CAAC,CAAC;IACvE,CAAC;IAED,8CAA8C;IAC9C,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC9C,MAAM,iBAAiB,GAAG,OAAO,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,KAAK,EAAE,EAAE;QAClE,MAAM,QAAQ,GAAG,eAAe,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;QAElD,IAAI,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;YACnC,MAAM,IAAI,KAAK,CAAC,6BAA6B,QAAQ,CAAC,IAAI,GAAG,CAAC,CAAC;QACjE,CAAC;QACD,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAEtC,OAAO,QAAQ,CAAC;IAClB,CAAC,CAAC,CAAC;IAEH,sBAAsB;IACtB,MAAM,mBAAmB,GAAG,OAAO,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,UAAU,EAAE,KAAK,EAAE,EAAE,CACxE,iBAAiB,CAAC,UAAU,EAAE,WAAW,EAAE,KAAK,CAAC,CAClD,CAAC;IAEF,yCAAyC;IACzC,MAAM,mBAAmB,GAAG,CAAC,OAAO,CAAC,WAAW,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,UAAU,EAAE,KAAK,EAAE,EAAE,CAChF,iBAAiB,CAAC,UAAU,EAAE,WAAW,EAAE,KAAK,CAAC,CAClD,CAAC;IAEF,yBAAyB;IACzB,MAAM,qBAAqB,GAAG,oBAAoB,CAChD,iBAAiB,EACjB,mBAAmB,CACpB,CAAC;IAEF,6BAA6B;IAC7B,MAAM,MAAM,GAAqB;QAC/B,GAAG,cAAc;QACjB,GAAG,OAAO,CAAC,MAAM;KAClB,CAAC;IAEF,4BAA4B;IAC5B,MAAM,MAAM,GAAG,CAAC,OAAO,CAAC,MAAM,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,qBAAqB,CAAC,CAAC;IAEjE,OAAO;QACL,EAAE,EAAE,OAAO,CAAC,EAAE;QACd,IAAI,EAAE,OAAO,CAAC,IAAI;QAClB,IAAI,EAAE,YAAY;QAClB,MAAM,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,IAAA,qBAAc,EAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,QAAiB,EAAE;QACnF,MAAM;QACN,SAAS,EAAE,iBAAiB;QAC5B,WAAW,EAAE,mBAAmB;QAChC,WAAW,EAAE,mBAAmB;QAChC,qBAAqB;QACrB,MAAM;KACP,CAAC;AACJ,CAAC"}

package/dist/engines/constraint/engine.d.ts

@@ -0,0 +1,95 @@
+/**
+ * Constraint Satisfaction Engine
+ *
+ * Find valid assignments for variables that satisfy all constraints.
+ * Implements IRuleEngine with strongly-typed ruleset, options, and result.
+ */
+import { IRuleEngine, WorkingMemory, Fact, FactInput, FactChange } from '../../core';
+import { CompiledConstraintRuleSet, ConstraintOptions, ConstraintResult, ConstraintAllResult } from './types';
+/**
+ * Constraint satisfaction engine.
+ *
+ * Finds valid assignments for variables that satisfy all constraints.
+ * Uses backtracking search with optional forward checking and MRV heuristic.
+ *
+ * @example
+ * ```typescript
+ * const engine = new ConstraintEngine();
+ *
+ * const result = engine.solve(compiledRules);
+ * if (result.solved) {
+ *   console.log(result.assignment);
+ *   // { room1: 'meeting-a', room2: 'meeting-b', ... }
+ * }
+ * ```
+ *
+ * @example Find all solutions
+ * ```typescript
+ * const result = engine.solveAll(compiledRules, { maxSolutions: 10 });
+ * console.log(`Found ${result.solutions.length} valid schedules`);
+ * ```
+ *
+ * @example With working memory for dynamic constraints
+ * ```typescript
+ * const engine = new ConstraintEngine();
+ * engine.add({ type: 'Room', data: { id: 'A', hasProjector: true } });
+ *
+ * const result = engine.solve(compiledRules);
+ * ```
+ */
+export declare class ConstraintEngine implements IRuleEngine<CompiledConstraintRuleSet, ConstraintOptions, ConstraintResult> {
+    private wm;
+    private strategy;
+    /**
+     * Create a new ConstraintEngine.
+     *
+     * @param workingMemory - Optional shared WorkingMemory. If not provided, creates its own.
+     */
+    constructor(workingMemory?: WorkingMemory);
+    add(input: FactInput): Fact;
+    remove(factId: string): Fact | undefined;
+    update(input: FactInput): Fact;
+    get(factId: string): Fact | undefined;
+    getByType(type: string): Fact[];
+    getAll(): Fact[];
+    has(factId: string): boolean;
+    size(): number;
+    clear(): void;
+    getChanges(): FactChange[];
+    clearChanges(): void;
+    /**
+     * Find one solution that satisfies all constraints.
+     * Alias for solve() to match IRuleEngine interface.
+     *
+     * @param ruleSet - Compiled constraint ruleset
+     * @param options - Runtime options (callbacks, limits)
+     * @returns Result with solution or conflict information
+     */
+    execute(ruleSet: CompiledConstraintRuleSet, options?: ConstraintOptions): ConstraintResult;
+    /**
+     * Find one solution that satisfies all constraints.
+     *
+     * Uses backtracking search with MRV (Minimum Remaining Values) heuristic
+     * for variable ordering. Optionally uses forward checking for constraint
+     * propagation.
+     *
+     * @param ruleSet - Compiled constraint ruleset
+     * @param options - Runtime options (callbacks, limits)
+     * @returns Result with solution or conflict information
+     */
+    solve(ruleSet: CompiledConstraintRuleSet, options?: ConstraintOptions): ConstraintResult;
+    /**
+     * Find all solutions that satisfy all constraints, up to a limit.
+     *
+     * @param ruleSet - Compiled constraint ruleset
+     * @param options - Runtime options (maxSolutions, callbacks, limits)
+     * @returns Result with array of solutions
+     */
+    solveAll(ruleSet: CompiledConstraintRuleSet, options?: ConstraintOptions): ConstraintAllResult;
+    /**
+     * Get the underlying WorkingMemory instance.
+     * Useful for sharing memory between multiple engines.
+     */
+    getWorkingMemory(): WorkingMemory;
+}
+//# sourceMappingURL=engine.d.ts.map

package/dist/engines/constraint/engine.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"engine.d.ts","sourceRoot":"","sources":["../../../src/engines/constraint/engine.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EACL,WAAW,EACX,aAAa,EACb,IAAI,EACJ,SAAS,EACT,UAAU,EACX,MAAM,YAAY,CAAC;AAEpB,OAAO,EACL,yBAAyB,EACzB,iBAAiB,EACjB,gBAAgB,EAChB,mBAAmB,EACpB,MAAM,SAAS,CAAC;AAIjB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AACH,qBAAa,gBAAiB,YAAW,WAAW,CAAC,yBAAyB,EAAE,iBAAiB,EAAE,gBAAgB,CAAC;IAClH,OAAO,CAAC,EAAE,CAAgB;IAC1B,OAAO,CAAC,QAAQ,CAAqB;IAErC;;;;OAIG;gBACS,aAAa,CAAC,EAAE,aAAa;IASzC,GAAG,CAAC,KAAK,EAAE,SAAS,GAAG,IAAI;IAI3B,MAAM,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS;IAIxC,MAAM,CAAC,KAAK,EAAE,SAAS,GAAG,IAAI;IAI9B,GAAG,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS;IAIrC,SAAS,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI,EAAE;IAI/B,MAAM,IAAI,IAAI,EAAE;IAIhB,GAAG,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO;IAI5B,IAAI,IAAI,MAAM;IAId,KAAK,IAAI,IAAI;IAIb,UAAU,IAAI,UAAU,EAAE;IAI1B,YAAY,IAAI,IAAI;IAQpB;;;;;;;OAOG;IACH,OAAO,CAAC,OAAO,EAAE,yBAAyB,EAAE,OAAO,GAAE,iBAAsB,GAAG,gBAAgB;IAQ9F;;;;;;;;;;OAUG;IACH,KAAK,CAAC,OAAO,EAAE,yBAAyB,EAAE,OAAO,GAAE,iBAAsB,GAAG,gBAAgB;IAI5F;;;;;;OAMG;IACH,QAAQ,CAAC,OAAO,EAAE,yBAAyB,EAAE,OAAO,GAAE,iBAAsB,GAAG,mBAAmB;IAQlG;;;OAGG;IACH,gBAAgB,IAAI,aAAa;CAGlC"}

package/dist/engines/constraint/engine.js

@@ -0,0 +1,144 @@
+"use strict";
+/**
+ * Constraint Satisfaction Engine
+ *
+ * Find valid assignments for variables that satisfy all constraints.
+ * Implements IRuleEngine with strongly-typed ruleset, options, and result.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.ConstraintEngine = void 0;
+const core_1 = require("../../core");
+const strategy_1 = require("./strategy");
+/**
+ * Constraint satisfaction engine.
+ *
+ * Finds valid assignments for variables that satisfy all constraints.
+ * Uses backtracking search with optional forward checking and MRV heuristic.
+ *
+ * @example
+ * ```typescript
+ * const engine = new ConstraintEngine();
+ *
+ * const result = engine.solve(compiledRules);
+ * if (result.solved) {
+ *   console.log(result.assignment);
+ *   // { room1: 'meeting-a', room2: 'meeting-b', ... }
+ * }
+ * ```
+ *
+ * @example Find all solutions
+ * ```typescript
+ * const result = engine.solveAll(compiledRules, { maxSolutions: 10 });
+ * console.log(`Found ${result.solutions.length} valid schedules`);
+ * ```
+ *
+ * @example With working memory for dynamic constraints
+ * ```typescript
+ * const engine = new ConstraintEngine();
+ * engine.add({ type: 'Room', data: { id: 'A', hasProjector: true } });
+ *
+ * const result = engine.solve(compiledRules);
+ * ```
+ */
+class ConstraintEngine {
+    wm;
+    strategy;
+    /**
+     * Create a new ConstraintEngine.
+     *
+     * @param workingMemory - Optional shared WorkingMemory. If not provided, creates its own.
+     */
+    constructor(workingMemory) {
+        this.wm = workingMemory ?? new core_1.WorkingMemory();
+        this.strategy = new strategy_1.ConstraintStrategy();
+    }
+    // ========================================
+    // IWorkingMemory Implementation
+    // ========================================
+    add(input) {
+        return this.wm.add(input);
+    }
+    remove(factId) {
+        return this.wm.remove(factId);
+    }
+    update(input) {
+        return this.wm.update(input);
+    }
+    get(factId) {
+        return this.wm.get(factId);
+    }
+    getByType(type) {
+        return this.wm.getByType(type);
+    }
+    getAll() {
+        return this.wm.getAll();
+    }
+    has(factId) {
+        return this.wm.has(factId);
+    }
+    size() {
+        return this.wm.size();
+    }
+    clear() {
+        this.wm.clear();
+    }
+    getChanges() {
+        return this.wm.getChanges();
+    }
+    clearChanges() {
+        this.wm.clearChanges();
+    }
+    // ========================================
+    // IRuleEngine Implementation
+    // ========================================
+    /**
+     * Find one solution that satisfies all constraints.
+     * Alias for solve() to match IRuleEngine interface.
+     *
+     * @param ruleSet - Compiled constraint ruleset
+     * @param options - Runtime options (callbacks, limits)
+     * @returns Result with solution or conflict information
+     */
+    execute(ruleSet, options = {}) {
+        return this.solve(ruleSet, options);
+    }
+    // ========================================
+    // Constraint-Specific Methods
+    // ========================================
+    /**
+     * Find one solution that satisfies all constraints.
+     *
+     * Uses backtracking search with MRV (Minimum Remaining Values) heuristic
+     * for variable ordering. Optionally uses forward checking for constraint
+     * propagation.
+     *
+     * @param ruleSet - Compiled constraint ruleset
+     * @param options - Runtime options (callbacks, limits)
+     * @returns Result with solution or conflict information
+     */
+    solve(ruleSet, options = {}) {
+        return this.strategy.solve(ruleSet, this.wm, options);
+    }
+    /**
+     * Find all solutions that satisfy all constraints, up to a limit.
+     *
+     * @param ruleSet - Compiled constraint ruleset
+     * @param options - Runtime options (maxSolutions, callbacks, limits)
+     * @returns Result with array of solutions
+     */
+    solveAll(ruleSet, options = {}) {
+        return this.strategy.solveAll(ruleSet, this.wm, options);
+    }
+    // ========================================
+    // Utility Methods
+    // ========================================
+    /**
+     * Get the underlying WorkingMemory instance.
+     * Useful for sharing memory between multiple engines.
+     */
+    getWorkingMemory() {
+        return this.wm;
+    }
+}
+exports.ConstraintEngine = ConstraintEngine;
+//# sourceMappingURL=engine.js.map

package/dist/engines/constraint/engine.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"engine.js","sourceRoot":"","sources":["../../../src/engines/constraint/engine.ts"],"names":[],"mappings":";AAAA;;;;;GAKG;;;AAEH,qCAMoB;AASpB,yCAAgD;AAEhD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AACH,MAAa,gBAAgB;IACnB,EAAE,CAAgB;IAClB,QAAQ,CAAqB;IAErC;;;;OAIG;IACH,YAAY,aAA6B;QACvC,IAAI,CAAC,EAAE,GAAG,aAAa,IAAI,IAAI,oBAAa,EAAE,CAAC;QAC/C,IAAI,CAAC,QAAQ,GAAG,IAAI,6BAAkB,EAAE,CAAC;IAC3C,CAAC;IAED,2CAA2C;IAC3C,gCAAgC;IAChC,2CAA2C;IAE3C,GAAG,CAAC,KAAgB;QAClB,OAAO,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAC5B,CAAC;IAED,MAAM,CAAC,MAAc;QACnB,OAAO,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAChC,CAAC;IAED,MAAM,CAAC,KAAgB;QACrB,OAAO,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAC/B,CAAC;IAED,GAAG,CAAC,MAAc;QAChB,OAAO,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAC7B,CAAC;IAED,SAAS,CAAC,IAAY;QACpB,OAAO,IAAI,CAAC,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;IACjC,CAAC;IAED,MAAM;QACJ,OAAO,IAAI,CAAC,EAAE,CAAC,MAAM,EAAE,CAAC;IAC1B,CAAC;IAED,GAAG,CAAC,MAAc;QAChB,OAAO,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAC7B,CAAC;IAED,IAAI;QACF,OAAO,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;IACxB,CAAC;IAED,KAAK;QACH,IAAI,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC;IAClB,CAAC;IAED,UAAU;QACR,OAAO,IAAI,CAAC,EAAE,CAAC,UAAU,EAAE,CAAC;IAC9B,CAAC;IAED,YAAY;QACV,IAAI,CAAC,EAAE,CAAC,YAAY,EAAE,CAAC;IACzB,CAAC;IAED,2CAA2C;IAC3C,6BAA6B;IAC7B,2CAA2C;IAE3C;;;;;;;OAOG;IACH,OAAO,CAAC,OAAkC,EAAE,UAA6B,EAAE;QACzE,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;IACtC,CAAC;IAED,2CAA2C;IAC3C,8BAA8B;IAC9B,2CAA2C;IAE3C;;;;;;;;;;OAUG;IACH,KAAK,CAAC,OAAkC,EAAE,UAA6B,EAAE;QACvE,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,OAAO,EAAE,IAAI,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;IACxD,CAAC;IAED;;;;;;OAMG;IACH,QAAQ,CAAC,OAAkC,EAAE,UAA6B,EAAE;QAC1E,OAAO,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,OAAO,EAAE,IAAI,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;IAC3D,CAAC;IAED,2CAA2C;IAC3C,kBAAkB;IAClB,2CAA2C;IAE3C;;;OAGG;IACH,gBAAgB;QACd,OAAO,IAAI,CAAC,EAAE,CAAC;IACjB,CAAC;CACF;AAvHD,4CAuHC"}

package/dist/engines/constraint/index.d.ts

@@ -0,0 +1,11 @@
+/**
+ * Constraint Satisfaction Engine
+ *
+ * Find valid assignments for variables that satisfy all constraints.
+ * Uses backtracking search with MRV heuristic and optional forward checking.
+ */
+export * from './types';
+export { compileConstraintRuleSet } from './compiler';
+export { ConstraintEngine } from './engine';
+export { ConstraintStrategy, constraintStrategy } from './strategy';
+//# sourceMappingURL=index.d.ts.map

package/dist/engines/constraint/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/engines/constraint/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAGH,cAAc,SAAS,CAAC;AAGxB,OAAO,EAAE,wBAAwB,EAAE,MAAM,YAAY,CAAC;AAGtD,OAAO,EAAE,gBAAgB,EAAE,MAAM,UAAU,CAAC;AAG5C,OAAO,EAAE,kBAAkB,EAAE,kBAAkB,EAAE,MAAM,YAAY,CAAC"}

package/dist/engines/constraint/index.js

@@ -0,0 +1,36 @@
+"use strict";
+/**
+ * Constraint Satisfaction Engine
+ *
+ * Find valid assignments for variables that satisfy all constraints.
+ * Uses backtracking search with MRV heuristic and optional forward checking.
+ */
+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.constraintStrategy = exports.ConstraintStrategy = exports.ConstraintEngine = exports.compileConstraintRuleSet = void 0;
+// Types
+__exportStar(require("./types"), exports);
+// Compiler
+var compiler_1 = require("./compiler");
+Object.defineProperty(exports, "compileConstraintRuleSet", { enumerable: true, get: function () { return compiler_1.compileConstraintRuleSet; } });
+// Engine
+var engine_1 = require("./engine");
+Object.defineProperty(exports, "ConstraintEngine", { enumerable: true, get: function () { return engine_1.ConstraintEngine; } });
+// Strategy (for advanced usage)
+var strategy_1 = require("./strategy");
+Object.defineProperty(exports, "ConstraintStrategy", { enumerable: true, get: function () { return strategy_1.ConstraintStrategy; } });
+Object.defineProperty(exports, "constraintStrategy", { enumerable: true, get: function () { return strategy_1.constraintStrategy; } });
+//# sourceMappingURL=index.js.map

package/dist/engines/constraint/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/engines/constraint/index.ts"],"names":[],"mappings":";AAAA;;;;;GAKG;;;;;;;;;;;;;;;;;AAEH,QAAQ;AACR,0CAAwB;AAExB,WAAW;AACX,uCAAsD;AAA7C,oHAAA,wBAAwB,OAAA;AAEjC,SAAS;AACT,mCAA4C;AAAnC,0GAAA,gBAAgB,OAAA;AAEzB,gCAAgC;AAChC,uCAAoE;AAA3D,8GAAA,kBAAkB,OAAA;AAAE,8GAAA,kBAAkB,OAAA"}

package/dist/engines/constraint/strategy.d.ts

@@ -0,0 +1,22 @@
+/**
+ * Constraint Satisfaction Engine Strategy
+ *
+ * Implements backtracking search with constraint propagation.
+ * Uses MRV (Minimum Remaining Values) heuristic for variable ordering.
+ */
+import { IWorkingMemory } from '../../core/memory';
+import { CompiledConstraintRuleSet, ConstraintOptions, ConstraintResult, ConstraintAllResult } from './types';
+export declare class ConstraintStrategy {
+    /**
+     * Find one solution that satisfies all constraints.
+     * When optimization is enabled, finds the best solution by preference score.
+     */
+    solve(ruleSet: CompiledConstraintRuleSet, wm: IWorkingMemory, options?: ConstraintOptions): ConstraintResult;
+    /**
+     * Find all solutions up to a limit.
+     * When optimization is enabled, returns solutions ranked by preference score.
+     */
+    solveAll(ruleSet: CompiledConstraintRuleSet, wm: IWorkingMemory, options?: ConstraintOptions): ConstraintAllResult;
+}
+export declare const constraintStrategy: ConstraintStrategy;
+//# sourceMappingURL=strategy.d.ts.map

package/dist/engines/constraint/strategy.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"strategy.d.ts","sourceRoot":"","sources":["../../../src/engines/constraint/strategy.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAGH,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AAGnD,OAAO,EACL,yBAAyB,EAIzB,iBAAiB,EACjB,gBAAgB,EAChB,mBAAmB,EAKpB,MAAM,SAAS,CAAC;AAqfjB,qBAAa,kBAAkB;IAC7B;;;OAGG;IACH,KAAK,CACH,OAAO,EAAE,yBAAyB,EAClC,EAAE,EAAE,cAAc,EAClB,OAAO,GAAE,iBAAsB,GAC9B,gBAAgB;IAsHnB;;;OAGG;IACH,QAAQ,CACN,OAAO,EAAE,yBAAyB,EAClC,EAAE,EAAE,cAAc,EAClB,OAAO,GAAE,iBAAsB,GAC9B,mBAAmB;CA8DvB;AAGD,eAAO,MAAM,kBAAkB,oBAA2B,CAAC"}