@kortexya/reasoninglayer 0.15.1 → 0.15.2

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.15.1";
+declare const SDK_VERSION = "0.15.2";
 /**
  * Configuration for the Reasoning Layer client.
  *
@@ -6086,6 +6086,8 @@ type FeatureConstraintDto = {
 };
 /** API representation of a feature descriptor */
 interface FeatureDescriptorDto$1 {
+    /** Custom OWL annotations for this feature (e.g., isIdentifier, unit, enumValues) */
+    annotations?: Record<string, string>;
     /** Optional constraint on the feature value */
     constraint?: null | ConstraintDto$1;
     /**
@@ -14199,6 +14201,8 @@ interface SortDiscoveryResponseDto {
 }
 /** API representation of a sort with full OSF schema */
 interface SortDto$1 {
+    /** Custom OWL annotations (e.g., icon, color) */
+    annotations?: Record<string, string>;
     /** Bound constraints on feature values */
     bound_constraints?: BoundConstraintDto$1[];
     /** Human-readable description for semantic search */
@@ -16178,6 +16182,15 @@ interface VariableFeasibilityDto$1 {
      * is 1 (selected / true).
      */
     can_be_true: boolean;
+    /**
+     * `true` if this variable's feasibility was fully determined by the solver.
+     * `false` if the solver hit a conflict limit before resolving this variable
+     * — in that case, `can_be_true` and `can_be_false` are conservative
+     * approximations (both may be `true` even if the variable is actually
+     * confirmed).  The frontend can show unverified variables differently
+     * (e.g. yellow/amber) so the user knows the result is approximate.
+     */
+    verified?: boolean;
 }
 /** Result of verbalizing a single PsiTerm. */
 interface VerbalizationResultDto$1 {
@@ -30876,14 +30889,31 @@ type SearchModeDto = 'solutions' | 'feasibility';
  *
  * @remarks
  * Produced by `mode = "feasibility"` search.
- * - `canBeTrue = true` means at least one valid assignment sets this variable to 1.
+ * - `canBeTrue = true` means the solver actually observed a valid assignment
+ *   with this variable = 1 (a witnessed model).
+ * - `canBeFalse = true` means the solver observed a valid assignment with
+ *   this variable = 0.
  * - `canBeTrue = false && canBeFalse = false` means the problem is UNSAT.
+ *
+ * When the underlying solver hits a conflict/time budget before the opposite
+ * polarity could be proven (im)feasible, `verified` is `false` and the
+ * reachability fields reflect only the polarities that were actually
+ * witnessed.  For example, `(canBeTrue: true, canBeFalse: false,
+ * verified: false)` means "observed in every model found so far, never
+ * observed as 0 — likely required, but the solver did not complete the
+ * UNSAT-for-0 probe to certify it."
  */
 interface VariableFeasibilityDto {
-    /** True if at least one valid assignment sets this variable to 1 (selected). */
+    /** True if the solver witnessed a valid assignment where this variable is 1. */
     canBeTrue: boolean;
-    /** True if at least one valid assignment sets this variable to 0 (unselected). */
+    /** True if the solver witnessed a valid assignment where this variable is 0. */
     canBeFalse: boolean;
+    /**
+     * True when the reachability result is fully determined by the solver
+     * (both polarities resolved).  False when a conflict/time limit was hit
+     * and the result reflects only the polarities that were observed.
+     */
+    verified: boolean;
 }
 /**
  * Request to search for solutions.

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.15.1";
+declare const SDK_VERSION = "0.15.2";
 /**
  * Configuration for the Reasoning Layer client.
  *
@@ -6086,6 +6086,8 @@ type FeatureConstraintDto = {
 };
 /** API representation of a feature descriptor */
 interface FeatureDescriptorDto$1 {
+    /** Custom OWL annotations for this feature (e.g., isIdentifier, unit, enumValues) */
+    annotations?: Record<string, string>;
     /** Optional constraint on the feature value */
     constraint?: null | ConstraintDto$1;
     /**
@@ -14199,6 +14201,8 @@ interface SortDiscoveryResponseDto {
 }
 /** API representation of a sort with full OSF schema */
 interface SortDto$1 {
+    /** Custom OWL annotations (e.g., icon, color) */
+    annotations?: Record<string, string>;
     /** Bound constraints on feature values */
     bound_constraints?: BoundConstraintDto$1[];
     /** Human-readable description for semantic search */
@@ -16178,6 +16182,15 @@ interface VariableFeasibilityDto$1 {
      * is 1 (selected / true).
      */
     can_be_true: boolean;
+    /**
+     * `true` if this variable's feasibility was fully determined by the solver.
+     * `false` if the solver hit a conflict limit before resolving this variable
+     * — in that case, `can_be_true` and `can_be_false` are conservative
+     * approximations (both may be `true` even if the variable is actually
+     * confirmed).  The frontend can show unverified variables differently
+     * (e.g. yellow/amber) so the user knows the result is approximate.
+     */
+    verified?: boolean;
 }
 /** Result of verbalizing a single PsiTerm. */
 interface VerbalizationResultDto$1 {
@@ -30876,14 +30889,31 @@ type SearchModeDto = 'solutions' | 'feasibility';
  *
  * @remarks
  * Produced by `mode = "feasibility"` search.
- * - `canBeTrue = true` means at least one valid assignment sets this variable to 1.
+ * - `canBeTrue = true` means the solver actually observed a valid assignment
+ *   with this variable = 1 (a witnessed model).
+ * - `canBeFalse = true` means the solver observed a valid assignment with
+ *   this variable = 0.
  * - `canBeTrue = false && canBeFalse = false` means the problem is UNSAT.
+ *
+ * When the underlying solver hits a conflict/time budget before the opposite
+ * polarity could be proven (im)feasible, `verified` is `false` and the
+ * reachability fields reflect only the polarities that were actually
+ * witnessed.  For example, `(canBeTrue: true, canBeFalse: false,
+ * verified: false)` means "observed in every model found so far, never
+ * observed as 0 — likely required, but the solver did not complete the
+ * UNSAT-for-0 probe to certify it."
  */
 interface VariableFeasibilityDto {
-    /** True if at least one valid assignment sets this variable to 1 (selected). */
+    /** True if the solver witnessed a valid assignment where this variable is 1. */
     canBeTrue: boolean;
-    /** True if at least one valid assignment sets this variable to 0 (unselected). */
+    /** True if the solver witnessed a valid assignment where this variable is 0. */
     canBeFalse: boolean;
+    /**
+     * True when the reachability result is fully determined by the solver
+     * (both polarities resolved).  False when a conflict/time limit was hit
+     * and the result reflects only the polarities that were observed.
+     */
+    verified: boolean;
 }
 /**
  * Request to search for solutions.

package/dist/index.js

@@ -1,5 +1,5 @@
 // src/config.ts
-var SDK_VERSION = "0.15.1";
+var SDK_VERSION = "0.15.2";
 function resolveConfig(config) {
   if (!config.baseUrl) {
     throw new Error("ClientConfig.baseUrl is required");
@@ -15490,7 +15490,8 @@ function SpaceSearchRequestFromFrontToApi(model) {
 function VariableFeasibilityDtoFromApiToFront(dto) {
   return {
     canBeTrue: dto.can_be_true,
-    canBeFalse: dto.can_be_false
+    canBeFalse: dto.can_be_false,
+    verified: dto.verified ?? true
   };
 }
 function SpaceSearchResponseFromApiToFront(dto) {