@kortexya/reasoninglayer 0.2.2 → 0.2.3

package/dist/index.d.cts

@@ -109,7 +109,7 @@ type JsonValue$1 = string | number | boolean | null | JsonValue$1[] | object;
  * This is the single source of truth for the version constant.
  * The `scripts/release.sh` script updates this value alongside `package.json`.
  */
-declare const SDK_VERSION = "0.2.2";
+declare const SDK_VERSION = "0.2.3";
 /**
  * Configuration for the Reasoning Layer client.
  *

package/dist/index.d.ts

@@ -109,7 +109,7 @@ type JsonValue$1 = string | number | boolean | null | JsonValue$1[] | object;
  * This is the single source of truth for the version constant.
  * The `scripts/release.sh` script updates this value alongside `package.json`.
  */
-declare const SDK_VERSION = "0.2.2";
+declare const SDK_VERSION = "0.2.3";
 /**
  * Configuration for the Reasoning Layer client.
  *

package/dist/index.js

@@ -1,5 +1,5 @@
 // src/config.ts
-var SDK_VERSION = "0.2.2";
+var SDK_VERSION = "0.2.3";
 function resolveConfig(config) {
   if (!config.baseUrl) {
     throw new Error("ClientConfig.baseUrl is required");
@@ -12547,6 +12547,12 @@ var RagClient = class {
 };
 
 // src/builders/lp.ts
+function numericTerm(n) {
+  return {
+    sort_name: Number.isInteger(n) ? "integer_type" : "real_type",
+    features: { value: n }
+  };
+}
 var LP = {
   /**
    * Create a maximization objective.
@@ -12666,8 +12672,8 @@ function compileLP(problem, solutionSortName) {
           sort_name: "real_between_constraint",
           features: {
             var: ref,
-            lower: bounds.min,
-            upper: bounds.max
+            lower: numericTerm(bounds.min),
+            upper: numericTerm(bounds.max)
           }
         });
       } else {
@@ -12676,7 +12682,7 @@ function compileLP(problem, solutionSortName) {
             sort_name: "real_ge_constraint",
             features: {
               left: ref,
-              right: bounds.min
+              right: numericTerm(bounds.min)
             }
           });
         }
@@ -12685,7 +12691,7 @@ function compileLP(problem, solutionSortName) {
             sort_name: "real_le_constraint",
             features: {
               left: ref,
-              right: bounds.max
+              right: numericTerm(bounds.max)
             }
           });
         }
@@ -12700,7 +12706,7 @@ function compileLP(problem, solutionSortName) {
       sort_name: sortName,
       features: {
         left: compiled.resultRef,
-        right: constraint.rhs
+        right: numericTerm(constraint.rhs)
       }
     });
   }
@@ -12717,7 +12723,7 @@ function compileLP(problem, solutionSortName) {
       sort_name: "real_eq_constraint",
       features: {
         left: objVar,
-        right: objectiveRef
+        right: numericTerm(objectiveRef)
       }
     });
     objectiveRef = objVar;
@@ -12781,7 +12787,7 @@ function compileLinearExpression(expression, varRefs, nextVar) {
       antecedents.push({
         sort_name: "real_times_constraint",
         features: {
-          coefficient,
+          coefficient: numericTerm(coefficient),
           variable: varRef,
           result: resultVar
         }
@@ -12790,7 +12796,7 @@ function compileLinearExpression(expression, varRefs, nextVar) {
     }
   }
   if (termResults.length === 0) {
-    return { antecedents, resultRef: 0 };
+    return { antecedents, resultRef: numericTerm(0) };
   }
   if (termResults.length === 1) {
     return { antecedents, resultRef: termResults[0] };
@@ -12907,18 +12913,19 @@ var OptimizeClient = class {
       }
       const solution = bcResponse.data.solutions[0];
       const variables = {};
-      let objectiveValue = 0;
       for (const binding of solution.substitution.bindings) {
         const varName = binding.variable_name;
         if (!varName) continue;
         const value = parseFloat(binding.bound_to_display);
         if (isNaN(value)) continue;
-        if (varName === "?_lp_objective") {
-          objectiveValue = value;
-        } else if (varName.startsWith("?") && !varName.startsWith("?_lp_")) {
+        if (varName.startsWith("?") && !varName.startsWith("?_lp_")) {
           variables[varName.slice(1)] = value;
         }
       }
+      let objectiveValue = 0;
+      for (const [varName, coeff] of Object.entries(problem.objective.coefficients)) {
+        objectiveValue += coeff * (variables[varName] ?? 0);
+      }
       return {
         status: "optimal",
         variables,