@kortexya/reasoninglayer 0.14.0 → 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.14.0";
+declare const SDK_VERSION = "0.15.2";
 /**
  * Configuration for the Reasoning Layer client.
  *
@@ -4468,16 +4468,6 @@ interface DocumentProgressDto$1 {
     inference_rules_applied: number;
     /** LLM model name (if applicable). */
     model_name?: string | null;
-    /**
-     * OSF residuations created.
-     * @min 0
-     */
-    osf_residuations_created: number;
-    /**
-     * OSF residuations resumed.
-     * @min 0
-     */
-    osf_residuations_resumed: number;
     /**
      * References resolved.
      * @min 0
@@ -4503,6 +4493,16 @@ interface DocumentProgressDto$1 {
      * @min 0
      */
     relations_integrated: number;
+    /**
+     * Residuations created (suspended operations).
+     * @min 0
+     */
+    residuations_created: number;
+    /**
+     * Residuations resumed.
+     * @min 0
+     */
+    residuations_resumed: number;
     /**
      * Reviews persisted.
      * @min 0
@@ -4520,11 +4520,6 @@ interface DocumentProgressDto$1 {
      * @min 0
      */
     sorts_reused: number;
-    /**
-     * Sorts reused via GLB/feature matching.
-     * @min 0
-     */
-    sorts_reused_glb: number;
     /**
      * Sorts reused via semantic matching.
      * @min 0
@@ -5109,6 +5104,27 @@ interface EntityDto$1 {
      */
     sort_id: string;
 }
+/** Audit record for one substring-based entity merge. */
+interface EntityMergeAuditDto {
+    /**
+     * Term ID of the entity that was merged away (the shorter form).
+     * @format uuid
+     */
+    merged_from_id: string;
+    /** Name of the merged-away entity. */
+    merged_from_name: string;
+    /** Original sort name of the merged-away entity. */
+    merged_from_sort: string;
+    /**
+     * Term ID of the surviving entity (the longer/canonical form).
+     * @format uuid
+     */
+    merged_into_id: string;
+    /** Name of the surviving entity. */
+    merged_into_name: string;
+    /** Sort name of the surviving entity (which won the merge). */
+    merged_into_sort: string;
+}
 /** Per-entity verification detail. */
 interface EntityVerificationDetailDto$1 {
     /**
@@ -6070,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;
     /**
@@ -8355,6 +8373,13 @@ interface IngestMarkdownRequest$1 {
 }
 /** Request to ingest RDF/OWL data */
 interface IngestRdfRequest$1 {
+    /**
+     * Whether to compute and store text embeddings for each ingested term.
+     *
+     * Default `true` because downstream extraction relies on embeddings.
+     * Set to `false` only for opt-in fast structural-only ingest.
+     */
+    compute_embeddings?: boolean;
     /** RDF content in Turtle, N-Triples, or RDF/XML format */
     content: string;
     /** Format of the RDF content */
@@ -8364,7 +8389,7 @@ interface IngestRdfRequest$1 {
     /** Whether to also parse SHACL shapes from the content */
     parse_shacl?: boolean;
 }
-/** Response from RDF ingestion */
+/** Response from RDF ingestion (sync mode, HTTP 201). */
 interface IngestRdfResponse$1 {
     /**
      * Number of SHACL shapes parsed
@@ -8445,6 +8470,17 @@ interface IngestionConfigDto$1 {
      * Default: true
      */
     enable_focused_extraction?: boolean;
+    /**
+     * Enable LLM-based coreference resolution for hard cases.
+     * When true, after structural deduplication the pipeline runs parallel
+     * per-pair LLM calls to resolve ambiguous coreferences (e.g.,
+     * "Stanley Reed" vs "Justice Reed"). Adds LLM calls proportional to the
+     * number of candidate pairs — violates the 0-LLM-token guarantee for the
+     * LocalNer strategy, so disabled by default. Opt in to improve entity
+     * deduplication quality at the cost of extra LLM calls.
+     * Default: false
+     */
+    enable_llm_coreference?: boolean;
     /**
      * Enable schema discovery before extraction.
      * Samples the document to discover entity/relation types before per-chunk extraction.
@@ -8609,6 +8645,11 @@ interface IngestionStatsDto$1 {
      * @min 0
      */
     entities_pending_review: number;
+    /**
+     * Audit trail for substring-based entity merges (surface-form coreference).
+     * E.g., "Brown v. Board" merged into "Brown v. Board of Education of Topeka".
+     */
+    entity_merge_audit?: EntityMergeAuditDto[];
     /**
      * Estimated USD cost of LLM API calls (if model pricing is available)
      * @format double
@@ -11388,25 +11429,20 @@ interface PipelineQualityStatsDto$1 {
      */
     dynamic_config_relation_threshold: number;
     /**
-     * Total formal concepts enumerated by FCA
+     * Entities rejected by validation
      * @min 0
      */
-    fca_concepts_enumerated: number;
+    entities_rejected: number;
     /**
-     * Concepts filtered (matching existing sorts)
-     * @min 0
-     */
-    fca_concepts_filtered: number;
-    /**
-     * Novel concepts discovered (not matching any existing sort)
+     * Entities auto-corrected to a better sort
      * @min 0
      */
-    fca_novel_concepts: number;
+    entities_sort_corrected: number;
     /**
-     * Sorts created from FCA-discovered concepts
+     * Entities that passed validation
      * @min 0
      */
-    fca_sorts_created: number;
+    entities_validated: number;
     /**
      * Axioms learned from entity feature patterns
      * @min 0
@@ -11418,75 +11454,76 @@ interface PipelineQualityStatsDto$1 {
      */
     feedback_pipeline_adjustments: number;
     /**
-     * LLM entities deduped against NER entities by normalized name in hybrid mode
+     * Total quality issues from forward chaining
      * @min 0
      */
-    hybrid_intra_batch_deduped: number;
+    forward_chaining_issues: number;
     /**
-     * Relations from inference rules deduplicated against existing
+     * Entities fully valid (all constraints pass)
      * @min 0
      */
-    inference_relations_deduped: number;
+    fully_valid: number;
     /**
-     * Inference rules successfully applied (expanded to relations)
+     * LLM entities deduped against NER entities by normalized name in hybrid mode
      * @min 0
      */
-    inference_rules_applied: number;
+    hybrid_intra_batch_deduped: number;
     /**
-     * Inference rules filtered due to low confidence
+     * Entities missing required features
      * @min 0
      */
-    inference_rules_filtered_low_confidence: number;
+    incomplete_entities: number;
     /**
-     * Inference rules with scope_sort not found among entities
+     * Entities with incompatible sort assignments
      * @min 0
      */
-    inference_rules_invalid_scope_sort: number;
+    inconsistent_sorts: number;
     /**
-     * Total inference rules extracted across all chunks
+     * Number of forward-chaining iterations executed.
      * @min 0
      */
-    inference_rules_total: number;
+    inference_iterations: number;
     /**
-     * Entities rejected by OSF validation
+     * Relations from inference rules deduplicated against existing
      * @min 0
      */
-    osf_entities_rejected: number;
+    inference_relations_deduped: number;
     /**
-     * Entities auto-corrected to a better sort
+     * Inference rules successfully applied (expanded to relations)
      * @min 0
      */
-    osf_entities_sort_corrected: number;
+    inference_rules_applied: number;
     /**
-     * Entities that passed OSF validation
+     * Inference rules filtered due to low confidence
      * @min 0
      */
-    osf_entities_validated: number;
+    inference_rules_filtered_low_confidence: number;
     /**
-     * Total quality issues from forward chaining
+     * Inference rules with scope_sort not found among entities
      * @min 0
      */
-    osf_forward_chaining_issues: number;
+    inference_rules_invalid_scope_sort: number;
     /**
-     * Entities fully valid (all constraints pass)
+     * Total inference rules extracted across all chunks
      * @min 0
      */
-    osf_fully_valid: number;
+    inference_rules_total: number;
     /**
-     * Entities missing required features (from forward chaining)
+     * Pattern rules generated from co-occurrence analysis.
+     * These are homoiconic Ψ-term rules persisted to the term store.
      * @min 0
      */
-    osf_incomplete_entities: number;
+    pattern_rules_persisted: number;
     /**
-     * Entities with incompatible sort assignments
+     * Total relations generated from inference rule expansion
      * @min 0
      */
-    osf_inconsistent_sorts: number;
+    relations_from_inference_rules: number;
     /**
-     * Total relations generated from inference rule expansion
+     * Total relations derived by forward chaining.
      * @min 0
      */
-    relations_from_inference_rules: number;
+    relations_inferred: number;
 }
 /** A matching plan from the library. */
 interface PlanMatchDto$1 {
@@ -13587,6 +13624,13 @@ interface SearchCommunitiesResponse$1 {
     /** Search statistics */
     stats: CommunitySearchStatsDto$1;
 }
+/**
+ * Which computation the search endpoint should perform.
+ *
+ * Defaults to `solutions` for full backward compatibility with existing clients
+ * that do not send a `mode` field.
+ */
+type SearchModeDto$1 = "solutions" | "feasibility";
 /** Request to search for solutions */
 interface SearchRequest {
     /**
@@ -13596,10 +13640,15 @@ interface SearchRequest {
      */
     collect_traces?: boolean | null;
     /**
-     * Maximum number of solutions to find
+     * Maximum number of solutions to find (only used in `solutions` mode)
      * @min 0
      */
     max_solutions?: number | null;
+    /**
+     * Which computation to perform.  Omit or set to `"solutions"` for the
+     * default enumeration behaviour (backward compatible).
+     */
+    mode?: SearchModeDto$1;
     /** Search strategy to use */
     strategy: SearchStrategyDto$1;
     /**
@@ -13609,18 +13658,36 @@ interface SearchRequest {
      */
     use_neural_guidance?: boolean | null;
 }
-/** Response with search results */
-interface SearchResponse {
+/**
+ * Response from the search endpoint.
+ *
+ * The `kind` field is a discriminator — always read it first to know which
+ * variant you received before accessing the mode-specific fields.
+ */
+type SearchResponse = {
     /**
-     * Total number of solutions found
+     * Number of solutions found.
      * @min 0
      */
     count: number;
-    /** Search statistics (present when collect_traces is true or use_neural_guidance is true) */
+    kind: "solutions";
+    /**
+     * Search statistics (present when `collect_traces` or `use_neural_guidance`
+     * is true, or when the SAT solver was used).
+     */
     search_stats?: null | SearchStatsDto$1;
-    /** Solutions found */
+    /** Enumerated complete assignments. */
     solutions: SpaceSolutionDto$1[];
-}
+} | {
+    kind: "feasibility";
+    /** Solver statistics for the feasibility queries. */
+    search_stats?: null | SearchStatsDto$1;
+    /**
+     * Per-variable feasibility.  Key is the variable name as registered
+     * in the space's choice points.
+     */
+    variables: Record<string, VariableFeasibilityDto$1>;
+};
 /**
  * Search statistics collected during a search operation.
  *
@@ -13633,6 +13700,19 @@ interface SearchStatsDto$1 {
      * @min 0
      */
     backtracks: number;
+    /**
+     * Choice points that were forced by initial propagation (before any
+     * search decision). Each entry is an unbiased "confirmed" assignment:
+     * every solution in the search space respects it. Clients should use
+     * this list (not the intersection of enumerated solutions) to display
+     * which choices are definitively locked in.
+     */
+    forced_choices?: ChoiceSelection$1[];
+    /**
+     * Number of learned nogood clauses.
+     * @min 0
+     */
+    learned_clauses: number;
     /**
      * Total nodes visited during search.
      * @min 0
@@ -13643,6 +13723,11 @@ interface SearchStatsDto$1 {
      * @min 0
      */
     nodes_pruned: number;
+    /**
+     * Number of restarts performed (Luby restart strategy).
+     * @min 0
+     */
+    restarts: number;
     /**
      * Number of times the neural scorer was invoked.
      * @min 0
@@ -14116,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 */
@@ -16078,6 +16165,33 @@ type ValuePatternDto$1 = {
     type: "bind";
     variable: string;
 };
+/**
+ * Feasibility of a single binary variable in the constraint space.
+ *
+ * Produced by `feasibility` mode search.  Both fields can be `false` only
+ * when the problem is UNSAT (no valid assignment exists).
+ */
+interface VariableFeasibilityDto$1 {
+    /**
+     * `true` if there exists at least one valid assignment where this variable
+     * is 0 (unselected / false).
+     */
+    can_be_false: boolean;
+    /**
+     * `true` if there exists at least one valid assignment where this variable
+     * 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 {
     /**
@@ -26373,15 +26487,18 @@ declare class Ingestion<SecurityDataType = unknown> {
      */
     ingestMarkdownBatch: (data: IngestMarkdownBatchRequest$1, params?: RequestParams) => Promise<HttpResponse<void, void>>;
     /**
-     * No description
+     * @description Defaults to async dispatch: returns `202` with a session id and the pipeline runs in a background tokio task. Pass `?sync=true` to run the whole pipeline inside the request and get a `201` with the full result — suitable only for small ontologies because the embedding loop dominates wall time on large inputs.
      *
      * @tags ingestion
      * @name IngestRdf
-     * @summary Ingest RDF/OWL/SHACL data and convert to OSF
+     * @summary Ingest RDF/OWL/SHACL data and convert to OSF.
      * @request POST:/api/v1/ingest/rdf
      * @secure
      */
-    ingestRdf: (data: IngestRdfRequest$1, params?: RequestParams) => Promise<HttpResponse<IngestRdfResponse$1, void>>;
+    ingestRdf: (query: {
+        /** When true, run synchronously (returns 201). Default false: returns 202 with a session id. */
+        sync: boolean;
+    }, data: IngestRdfRequest$1, params?: RequestParams) => Promise<HttpResponse<IngestRdfResponse$1, void>>;
     /**
      * @description Returns paginated list of chunk failures in the dead-letter queue.
      *
@@ -26548,10 +26665,10 @@ interface DocumentProgressDto {
     inferenceRulesApplied: number;
     /** LLM model name (if applicable). */
     modelName?: string | null;
-    /** OSF residuations created. */
-    osfResiduationsCreated: number;
-    /** OSF residuations resumed. */
-    osfResiduationsResumed: number;
+    /** Residuations created (suspended operations). */
+    residuationsCreated: number;
+    /** Residuations resumed. */
+    residuationsResumed: number;
     /** References resolved. */
     referencesResolved: number;
     /** Unresolved references. */
@@ -26570,8 +26687,6 @@ interface DocumentProgressDto {
     sortsCreated: number;
     /** Existing sorts reused (exact match). */
     sortsReused: number;
-    /** Sorts reused via GLB/feature matching. */
-    sortsReusedGlb: number;
     /** Sorts reused via semantic matching. */
     sortsReusedSemantic: number;
     /** When ingestion started (ISO 8601). */
@@ -26941,20 +27056,28 @@ interface PipelineQualityStatsDto {
     dynamicConfigEntityThreshold: number;
     /** Dynamic relation confidence threshold based on KB maturity. */
     dynamicConfigRelationThreshold: number;
-    /** Total formal concepts enumerated by FCA. */
-    fcaConceptsEnumerated: number;
-    /** Concepts filtered (matching existing sorts). */
-    fcaConceptsFiltered: number;
-    /** Novel concepts discovered (not matching any existing sort). */
-    fcaNovelConcepts: number;
-    /** Sorts created from FCA-discovered concepts. */
-    fcaSortsCreated: number;
+    /** Entities rejected by validation. */
+    entitiesRejected: number;
+    /** Entities auto-corrected to a better sort. */
+    entitiesSortCorrected: number;
+    /** Entities that passed validation. */
+    entitiesValidated: number;
     /** Axioms learned from entity feature patterns. */
     feedbackAxiomsLearned: number;
     /** Pipeline threshold adjustments applied by dynamic config. */
     feedbackPipelineAdjustments: number;
+    /** Total quality issues from forward chaining. */
+    forwardChainingIssues: number;
+    /** Entities fully valid (all constraints pass). */
+    fullyValid: number;
     /** LLM entities deduped against NER entities by normalized name in hybrid mode. */
     hybridIntraBatchDeduped: number;
+    /** Entities missing required features. */
+    incompleteEntities: number;
+    /** Entities with incompatible sort assignments. */
+    inconsistentSorts: number;
+    /** Number of forward-chaining iterations executed. */
+    inferenceIterations: number;
     /** Relations from inference rules deduplicated against existing. */
     inferenceRelationsDeduped: number;
     /** Inference rules successfully applied (expanded to relations). */
@@ -26965,18 +27088,12 @@ interface PipelineQualityStatsDto {
     inferenceRulesInvalidScopeSort: number;
     /** Total inference rules extracted across all chunks. */
     inferenceRulesTotal: number;
-    /** Entities rejected by validation. */
-    osfEntitiesRejected: number;
-    /** Entities auto-corrected to a better sort. */
-    osfEntitiesSortCorrected: number;
-    /** Entities that passed validation. */
-    osfEntitiesValidated: number;
-    /** Total quality issues from forward chaining. */
-    osfForwardChainingIssues: number;
-    /** Entities fully valid (all constraints pass). */
-    osfFullyValid: number;
-    /** Entities missing required features (from forward chaining). */
-    osfIncompleteEntities: number;
+    /** Pattern rules generated from co-occurrence analysis. */
+    patternRulesPersisted: number;
+    /** Total relations generated from inference rule expansion. */
+    relationsFromInferenceRules: number;
+    /** Total relations derived by forward chaining. */
+    relationsInferred: number;
 }
 /**
  * Token usage from LLM API calls during ingestion.
@@ -27221,6 +27338,11 @@ interface IngestRdfRequest {
     parseOntology?: boolean;
     /** Whether to also parse SHACL shapes from the content. */
     parseShacl?: boolean;
+    /**
+     * When true, run synchronously and return the result immediately (HTTP 201).
+     * When false (default), return HTTP 202 with a session ID for async polling.
+     */
+    sync?: boolean;
     /** Tenant ID for the ingested data. */
     tenantId: string;
 }
@@ -30684,6 +30806,15 @@ interface SearchStatsDto {
     solveTimeMs: number;
     /** Number of times the neural scorer was invoked. */
     scorerCalls: number;
+    /** Number of restarts performed (Luby restart strategy). */
+    restarts: number;
+    /** Number of learned nogood clauses. */
+    learnedClauses: number;
+    /**
+     * Choice points forced by initial propagation (before any search decision).
+     * Every solution in the search space respects these assignments unconditionally.
+     */
+    forcedChoices?: ChoiceSelection[];
 }
 /**
  * Trace event from LIFE feature operations during search.
@@ -30744,35 +30875,98 @@ interface CommitRequest {
     /** Index of the alternative to commit to. */
     alternativeIndex: number;
 }
+/**
+ * Which computation the search endpoint should perform.
+ *
+ * @remarks
+ * - `"solutions"`: enumerate complete, valid assignments (default — backward compatible).
+ * - `"feasibility"`: run 2×N per-variable SAT queries and return reachability info.
+ *   Much faster than full enumeration for large spaces.
+ */
+type SearchModeDto = 'solutions' | 'feasibility';
+/**
+ * Reachability of a single binary choice-point variable.
+ *
+ * @remarks
+ * Produced by `mode = "feasibility"` search.
+ * - `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 the solver witnessed a valid assignment where this variable is 1. */
+    canBeTrue: boolean;
+    /** 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.
  */
 interface SpaceSearchRequest {
     /** Search strategy to use. */
     strategy: SearchStrategyDto;
-    /** Maximum number of solutions to find. */
+    /** Maximum number of solutions to find (only used in `"solutions"` mode). */
     maxSolutions?: number | null;
     /** Enable trace collection during search. */
     collectTraces?: boolean | null;
     /** Wire the neural scorer into search (AlphaProof-style guidance). */
     useNeuralGuidance?: boolean | null;
+    /**
+     * Which computation to perform.
+     * Omit or set to `"solutions"` for the default enumeration behaviour (backward compatible).
+     */
+    mode?: SearchModeDto;
 }
 /**
- * Response with search results.
+ * Response from the search endpoint.
+ *
+ * @remarks
+ * Discriminated union on `kind`. Always read `kind` first:
+ * - `"solutions"`: standard enumeration result with `solutions` and `count`.
+ * - `"feasibility"`: per-variable reachability map in `variables`.
  */
-interface SpaceSearchResponse {
-    /** Solutions found. */
+type SpaceSearchResponse = {
+    /** Discriminator — always `"solutions"` for this variant. */
+    kind: 'solutions';
+    /** Enumerated complete assignments. */
     solutions: SpaceSolutionDto[];
-    /** Total number of solutions found. */
+    /** Number of solutions found. */
     count: number;
     /** Search statistics. */
     searchStats?: SearchStatsDto | null;
-}
+} | {
+    /** Discriminator — always `"feasibility"` for this variant. */
+    kind: 'feasibility';
+    /**
+     * Per-variable reachability. Key is the variable name as registered
+     * in the space's choice points.
+     */
+    variables: Record<string, VariableFeasibilityDto>;
+    /** Solver statistics for the feasibility queries. */
+    searchStats?: SearchStatsDto | null;
+};
 
 type spaces_ChoicePointDto = ChoicePointDto;
 type spaces_ChoiceSelection = ChoiceSelection;
 type spaces_CommitRequest = CommitRequest;
 type spaces_CreateSpaceRequest = CreateSpaceRequest;
+type spaces_SearchModeDto = SearchModeDto;
 type spaces_SearchStatsDto = SearchStatsDto;
 type spaces_SearchStrategyDto = SearchStrategyDto;
 type spaces_SpaceConstraintDto = SpaceConstraintDto;
@@ -30782,8 +30976,9 @@ type spaces_SpaceSearchResponse = SpaceSearchResponse;
 type spaces_SpaceSolutionDto = SpaceSolutionDto;
 type spaces_SpaceStatusDto = SpaceStatusDto;
 type spaces_TraceEventDto = TraceEventDto;
+type spaces_VariableFeasibilityDto = VariableFeasibilityDto;
 declare namespace spaces {
-  export type { spaces_ChoicePointDto as ChoicePointDto, spaces_ChoiceSelection as ChoiceSelection, spaces_CommitRequest as CommitRequest, spaces_CreateSpaceRequest as CreateSpaceRequest, spaces_SearchStatsDto as SearchStatsDto, spaces_SearchStrategyDto as SearchStrategyDto, spaces_SpaceConstraintDto as SpaceConstraintDto, spaces_SpaceResponse as SpaceResponse, spaces_SpaceSearchRequest as SpaceSearchRequest, spaces_SpaceSearchResponse as SpaceSearchResponse, spaces_SpaceSolutionDto as SpaceSolutionDto, spaces_SpaceStatusDto as SpaceStatusDto, spaces_TraceEventDto as TraceEventDto };
+  export type { spaces_ChoicePointDto as ChoicePointDto, spaces_ChoiceSelection as ChoiceSelection, spaces_CommitRequest as CommitRequest, spaces_CreateSpaceRequest as CreateSpaceRequest, spaces_SearchModeDto as SearchModeDto, spaces_SearchStatsDto as SearchStatsDto, spaces_SearchStrategyDto as SearchStrategyDto, spaces_SpaceConstraintDto as SpaceConstraintDto, spaces_SpaceResponse as SpaceResponse, spaces_SpaceSearchRequest as SpaceSearchRequest, spaces_SpaceSearchResponse as SpaceSearchResponse, spaces_SpaceSolutionDto as SpaceSolutionDto, spaces_SpaceStatusDto as SpaceStatusDto, spaces_TraceEventDto as TraceEventDto, spaces_VariableFeasibilityDto as VariableFeasibilityDto };
 }
 
 /**