kibi-cli 2.26.3 → 2.28.0

package/dist/operations/mutation/upsert.js

@@ -1,7 +1,7 @@
 import { createHash } from "node:crypto";
 import { existsSync, readFileSync, unlinkSync, writeFileSync } from "node:fs";
 import path from "node:path";
-import { OperationError } from "../../cli-errors.js";
+import { InputError, OperationError } from "../../cli-errors.js";
 import { DEFAULT_FIRMNESS, carriesFirmness, firmnessRef, isFirmness, } from "../../decision-firmness.js";
 import { readManifestWithCoordinateOverlay } from "../../extractors/manifest.js";
 import { extractManifestSymbolRecords } from "../../extractors/manifest.js";
@@ -120,9 +120,23 @@ function restoreRelationshipShard(shardPath, before, expectedAfterHash, beforeTi
     // shard with a new time would read as a newer source after a refusal.
     restoreFileTimes(shardPath, beforeTimes);
 }
+/** Test fields the stored receipts were recorded against. */
+const RECEIPT_BOUND_FIELDS = [
+    "verification_scope",
+    "verification_perspective",
+];
+/**
+ * Check a test write against the stored proof receipt history, which is
+ * append-only. An update that omits `proof_receipts` keeps the stored history
+ * (an update keeps every property it leaves out): the stored receipts are
+ * returned for the write to carry, with the verification scope and
+ * perspective they were recorded against. Undefined when there is nothing to
+ * carry.
+ */
+// implements REQ-kb-upsert-keeps-omitted-proof-receipts
 export async function validateAppendOnlyProofReceipts(entity, context, staged) {
     if (entity.type !== "test")
-        return;
+        return undefined;
     // An earlier plan step that writes the same test is the history this
     // write must extend.
     const planned = staged?.entities.get(String(entity.id));
@@ -136,12 +150,21 @@ export async function validateAppendOnlyProofReceipts(entity, context, staged) {
         });
     const previous = receiptRecords(existing[0]?.proof_receipts);
     if (!previous || previous.length === 0)
-        return;
+        return undefined;
+    if (entity.proof_receipts === undefined) {
+        // The receipts bind the test's verification scope, so it travels too.
+        const stored = existing[0];
+        return {
+            proof_receipts: previous,
+            ...Object.fromEntries(RECEIPT_BOUND_FIELDS.filter((field) => entity[field] === undefined && stored?.[field] !== undefined).map((field) => [field, stored[field]])),
+        };
+    }
     const next = receiptRecords(entity.proof_receipts);
     const errors = appendOnlyProofReceiptHistoryErrors(previous, next);
     if (errors.length > 0) {
         throw new Error(`Entity validation failed: ${errors.join("; ")}`);
     }
+    return undefined;
 }
 export async function effectiveRelationships(input, entity, relationships, context, staged, lookup) {
     const prolog = requireProlog(context);
@@ -234,8 +257,8 @@ export async function validateUpsertForCommit(payload, context, options = {}) {
     // The payload must be valid on its own before the store is read.
     const checked = validateUpsertInput(payload, context.clock());
     validateRelationshipSources(payload.id, checked.relationships);
-    // Symbol granularity reads only the payload and its source file, and stored
-    // state never changes a symbol payload, so it runs before the store is read.
+    // Symbol granularity of a payload that names its source file reads only the
+    // payload and that file, so it runs before the store is read.
     await validateSymbolGranularity(checked.entity, checked.relationships, context);
     // One read of the entity this upsert replaces, shared by the ledger merge
     // and the stored origin below.
@@ -250,15 +273,28 @@ export async function validateUpsertForCommit(payload, context, options = {}) {
         : await readUncompiledAuthoredSource(context, payload);
     if (uncompiledSource !== null)
         lookup = authoredEntityLookup(uncompiledSource);
-    const input = await withStoredRequirementSemantics(payload, prolog, staged, lookup);
-    const validated = input === payload ? checked : validateUpsertInput(input, context.clock());
+    // implements REQ-kibi-symbol-link-guidance
+    // An update that only adds links keeps the stored sourceFile: judge the
+    // symbol as it will be stored, so a coarse link is refused here rather
+    // than later by the staged gate.
+    if (checked.entity.sourceFile === undefined)
+        await validateSymbolGranularity(checked.entity, checked.relationships, context, async () => staged?.entities.get(payload.id) ?? (await lookup.entity()));
+    let input = await withStoredRequirementSemantics(payload, prolog, staged, lookup);
+    let validated = input === payload ? checked : validateUpsertInput(input, context.clock());
     if (uncompiledSource !== null)
         lookup = {
             ...lookup,
             relationships: assertAuthoredWriteCompiles(uncompiledSource, input, validated.entity),
         };
     if (options.allowReceiptsPrune !== true) {
-        await validateAppendOnlyProofReceipts(validated.entity, context, staged);
+        const kept = await validateAppendOnlyProofReceipts(validated.entity, context, staged);
+        if (kept !== undefined) {
+            input = {
+                ...input,
+                properties: { ...input.properties, ...kept },
+            };
+            validated = validateUpsertInput(input, context.clock());
+        }
     }
     const relationships = await effectiveRelationships(input, validated.entity, validated.relationships, context, staged, lookup);
     await validateStrictLanePairing(prolog, validated.relationships, staged);
@@ -748,7 +784,8 @@ export async function executeUpsert(input, context, options = {}) {
             operationFailure = { error: failure };
             throw failure;
         }
-        if (error instanceof OperationError) {
+        // A coded refusal keeps its code and message for the error envelope.
+        if (error instanceof OperationError || error instanceof InputError) {
             const failure = withPlanRecoveryNotes(error, planRecoveryWarnings);
             operationFailure = { error: failure };
             throw failure;

package/dist/operations/mutation/validation.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"validation.d.ts","sourceRoot":"","sources":["../../../src/operations/mutation/validation.ts"],"names":[],"mappings":"AAKA,OAAO,EAEL,0BAA0B,EAC3B,MAAM,oCAAoC,CAAC;AAU5C,OAAO,KAAK,EAAE,WAAW,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AA8L/D,wBAAgB,mBAAmB,CACjC,KAAK,EAAE,WAAW,EAClB,GAAG,EAAE,IAAI,GACR,eAAe,CA6DjB;AAED,OAAO,EAAE,0BAA0B,EAAE,CAAC"}
+{"version":3,"file":"validation.d.ts","sourceRoot":"","sources":["../../../src/operations/mutation/validation.ts"],"names":[],"mappings":"AAKA,OAAO,EAEL,0BAA0B,EAC3B,MAAM,oCAAoC,CAAC;AAU5C,OAAO,KAAK,EAAE,WAAW,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAqN/D,wBAAgB,mBAAmB,CACjC,KAAK,EAAE,WAAW,EAClB,GAAG,EAAE,IAAI,GACR,eAAe,CA6DjB;AAED,OAAO,EAAE,0BAA0B,EAAE,CAAC"}

package/dist/operations/mutation/validation.js

@@ -94,6 +94,22 @@ function typeRestrictedFields(schemaPath) {
     const fields = requiredLists.flatMap((list) => Array.isArray(list) ? list.map(String) : []);
     return types.length > 0 && fields.length > 0 ? { fields, types } : null;
 }
+// implements REQ-kibi-symbol-link-guidance
+/**
+ * The documented status vocabulary of each entity type (docs/entity-schema.md).
+ * The schema accepts the union of every type's statuses for older sources, so
+ * an invalid status names only the values that fit the entity being written.
+ */
+const STATUS_VALUES_BY_TYPE = new Map([
+    ["req", ["open", "in_progress", "closed", "deprecated"]],
+    ["scenario", ["draft", "active", "deprecated"]],
+    ["test", ["passing", "failing", "skipped", "pending"]],
+    ["adr", ["proposed", "accepted", "deprecated", "superseded"]],
+    ["flag", ["active", "inactive", "deprecated"]],
+    ["event", ["active", "deprecated"]],
+    ["symbol", ["active", "deprecated", "removed"]],
+    ["fact", ["active", "deprecated"]],
+]);
 // implements REQ-upsert-unknown-field-guidance
 function formatEntityErrors(entity, errors) {
     // A field only some entity types carry fails a type-conditional `not`
@@ -135,6 +151,11 @@ function formatEntityErrors(entity, errors) {
             return `${path}: unknown property '${property}' (${error.message}).`;
         }
         if (error.keyword === "enum" && params.allowedValues) {
+            const typed = path === "/status"
+                ? STATUS_VALUES_BY_TYPE.get(String(entity.type))
+                : undefined;
+            if (typed !== undefined)
+                return `${path}: ${error.message}. Allowed values for ${String(entity.type)} entities: ${typed.join(", ")}`;
             return `${path}: ${error.message}. Allowed values: ${params.allowedValues.map(String).join(", ")}`;
         }
         return `${path}: ${error.message}`;

package/dist/operations/planning/compile-intent.d.ts

@@ -2,6 +2,7 @@ import { type IntentSearchFacets, type IntentSearchMatch, type SourceLocation }
 import type { OperationContext } from "../../public/operations/runtime-types.js";
 import { type ContradictionWitness } from "../mutation/what-if.js";
 import type { SemanticInterpretationInput } from "../semantic-advisor/types.js";
+import { type ConflictReviewCandidate, type ConflictReviewDecision, type UncheckedReason } from "./conflict-review.js";
 export declare const COMPILE_PLAN_VERSION: "kibi.compile-plan.v1";
 export type CompileIntentArgs = Readonly<{
     intent: string;
@@ -24,6 +25,11 @@ export type CompileIntentArgs = Readonly<{
     sourceExcerpt?: string;
     /** Locator of that text (ticket, URL, path); rendered in `## Source`. */
     sourceReference?: string;
+    /**
+     * The agent's verdict on each review candidate a previous compile returned:
+     * whether the intent contradicts that current requirement.
+     */
+    conflictReviews?: readonly ConflictReviewDecision[];
 }>;
 export type ScenarioDraft = Readonly<{
     id?: string;
@@ -49,6 +55,7 @@ export type ProposalDecision = Readonly<{
  * fields so callers can act on more than requirement ids.
  */
 export type { ContradictionWitness, WhatIfAnalysis, } from "../mutation/what-if.js";
+export type { ConflictReviewCandidate, ConflictReviewDecision, UncheckedReason, } from "./conflict-review.js";
 export { isBlockingWitness, parseWhatIfAnalysis } from "../mutation/what-if.js";
 export type TraceabilityProposal = Readonly<{
     proposalId: string;
@@ -105,6 +112,15 @@ export type CompilePlanV1 = Readonly<{
         removed?: readonly ContradictionWitness[];
         /** Staged witnesses that already exist in the current KB. */
         unchanged?: readonly ContradictionWitness[];
+        /** Why the check could not decide; empty when it could. */
+        reasons?: readonly UncheckedReason[];
+        /**
+         * Current requirements the checker could not compare with the intent,
+         * which the agent must compare and judge through conflictReviews.
+         */
+        reviewCandidates?: readonly ConflictReviewCandidate[];
+        /** What the agent does next while the outcome is not decided. */
+        nextAction?: string;
     };
     proposals: readonly TraceabilityProposal[];
     steps: readonly PlanStep[];

package/dist/operations/planning/compile-intent.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"compile-intent.d.ts","sourceRoot":"","sources":["../../../src/operations/planning/compile-intent.ts"],"names":[],"mappings":"AAOA,OAAO,EACL,KAAK,kBAAkB,EACvB,KAAK,iBAAiB,EACtB,KAAK,cAAc,EAEpB,MAAM,wBAAwB,CAAC;AAMhC,OAAO,KAAK,EACV,gBAAgB,EAEjB,MAAM,0CAA0C,CAAC;AAKlD,OAAO,EACL,KAAK,oBAAoB,EAG1B,MAAM,wBAAwB,CAAC;AAGhC,OAAO,KAAK,EAEV,2BAA2B,EAE5B,MAAM,8BAA8B,CAAC;AAGtC,eAAO,MAAM,oBAAoB,EAAG,sBAA+B,CAAC;AAGpE,MAAM,MAAM,iBAAiB,GAAG,QAAQ,CAAC;IACvC,MAAM,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,QAAQ,GAAG,QAAQ,CAAC;IAC1B,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,eAAe,CAAC,EAAE,SAAS,cAAc,EAAE,CAAC;IAC5C,cAAc,CAAC,EAAE,kBAAkB,CAAC;IACpC,OAAO,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IAC5B,eAAe,CAAC,EAAE,SAAS,2BAA2B,EAAE,CAAC;IACzD,cAAc,CAAC,EAAE,SAAS,aAAa,EAAE,CAAC;IAC1C,UAAU,CAAC,EAAE,SAAS,SAAS,EAAE,CAAC;IAClC,iBAAiB,CAAC,EAAE,SAAS,gBAAgB,EAAE,CAAC;IAChD;;;OAGG;IACH,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,mFAAmF;IACnF,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,yEAAyE;IACzE,eAAe,CAAC,EAAE,MAAM,CAAC;CAC1B,CAAC,CAAC;AAGH,MAAM,MAAM,aAAa,GAAG,QAAQ,CAAC;IACnC,EAAE,CAAC,EAAE,MAAM,CAAC;IACZ,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;CACd,CAAC,CAAC;AAGH,MAAM,MAAM,SAAS,GAAG,QAAQ,CAAC;IAC/B,EAAE,CAAC,EAAE,MAAM,CAAC;IACZ,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;IACb,iEAAiE;IACjE,WAAW,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IAChC,iBAAiB,CAAC,EAAE,MAAM,GAAG,aAAa,GAAG,YAAY,CAAC;IAC1D,uBAAuB,CAAC,EAAE,UAAU,GAAG,UAAU,CAAC;CACnD,CAAC,CAAC;AAGH,MAAM,MAAM,gBAAgB,GAAG,QAAQ,CAAC;IACtC,UAAU,EAAE,MAAM,CAAC;IACnB,QAAQ,EAAE,QAAQ,GAAG,QAAQ,CAAC;CAC/B,CAAC,CAAC;AAGH;;;;GAIG;AACH,YAAY,EACV,oBAAoB,EACpB,cAAc,GACf,MAAM,wBAAwB,CAAC;AAChC,OAAO,EAAE,iBAAiB,EAAE,mBAAmB,EAAE,MAAM,wBAAwB,CAAC;AAGhF,MAAM,MAAM,oBAAoB,GAAG,QAAQ,CAAC;IAC1C,UAAU,EAAE,MAAM,CAAC;IACnB,WAAW,EAAE,MAAM,CAAC;IACpB,aAAa,EAAE,MAAM,CAAC;IACtB,YAAY,EAAE,QAAQ,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,EAAE,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IACnE,UAAU,EAAE,MAAM,CAAC;IACnB,QAAQ,EAAE,SAAS,MAAM,EAAE,CAAC;IAC5B,QAAQ,EAAE,SAAS,GAAG,QAAQ,GAAG,QAAQ,CAAC;CAC3C,CAAC,CAAC;AAGH,MAAM,MAAM,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC;AAGzD,wBAAgB,eAAe,CAC7B,IAAI,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,GACtC,MAAM,CAGR;AAGD,MAAM,MAAM,aAAa,GAAG,QAAQ,CAAC;IACnC,OAAO,EAAE,OAAO,oBAAoB,CAAC;IACrC,QAAQ,EAAE,MAAM,CAAC;IACjB,MAAM,EAAE,OAAO,GAAG,kBAAkB,GAAG,SAAS,CAAC;IACjD,QAAQ,EAAE;QACR,MAAM,EAAE,MAAM,CAAC;QACf,YAAY,EAAE,MAAM,CAAC;QACrB,iBAAiB,EAAE,MAAM,CAAC;QAC1B,YAAY,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC;KACvD,CAAC;IACF,MAAM,EAAE;QACN,IAAI,EAAE,QAAQ,GAAG,QAAQ,CAAC;QAC1B,aAAa,EAAE,MAAM,CAAC;QACtB,eAAe,EAAE,MAAM,CAAC;KACzB,CAAC;IACF,SAAS,EAAE;QACT,UAAU,EAAE,SAAS,iBAAiB,EAAE,CAAC;QACzC,SAAS,EAAE,OAAO,CAAC;KACpB,CAAC;IACF,YAAY,EAAE,SAAS;QACrB,QAAQ,EAAE,MAAM,CAAC;QACjB,IAAI,EAAE,MAAM,CAAC;QACb,IAAI,EAAE;YAAE,KAAK,EAAE,MAAM,CAAC;YAAC,GAAG,EAAE,MAAM,CAAA;SAAE,CAAC;QACrC,WAAW,EACP,iBAAiB,GACjB,WAAW,GACX,MAAM,GACN,aAAa,GACb,YAAY,CAAC;QACjB,MAAM,EAAE,SAAS,GAAG,WAAW,GAAG,cAAc,GAAG,YAAY,CAAC;QAChE,MAAM,EAAE,MAAM,GAAG,eAAe,CAAC;KAClC,EAAE,CAAC;IACJ,qBAAqB,EAAE;QACrB,OAAO,EAAE,aAAa,GAAG,UAAU,GAAG,YAAY,CAAC;QACnD,2GAA2G;QAC3G,SAAS,EAAE,SAAS,oBAAoB,EAAE,CAAC;QAC3C,qDAAqD;QACrD,UAAU,CAAC,EAAE,SAAS,oBAAoB,EAAE,CAAC;QAC7C,2CAA2C;QAC3C,OAAO,CAAC,EAAE,SAAS,oBAAoB,EAAE,CAAC;QAC1C,6DAA6D;QAC7D,SAAS,CAAC,EAAE,SAAS,oBAAoB,EAAE,CAAC;KAC7C,CAAC;IACF,SAAS,EAAE,SAAS,oBAAoB,EAAE,CAAC;IAC3C,KAAK,EAAE,SAAS,QAAQ,EAAE,CAAC;IAC3B,YAAY,EAAE,SAAS,eAAe,EAAE,CAAC;IACzC,WAAW,EAAE,SAAS,MAAM,EAAE,CAAC;IAC/B,gFAAgF;IAChF,iBAAiB,CAAC,EAAE,QAAQ,CAAC;QAC3B,MAAM,EAAE,SAAS;YACf,QAAQ,EAAE,MAAM,CAAC;YACjB,aAAa,EAAE,MAAM,CAAC;YACtB,UAAU,EAAE,MAAM,CAAC;YACnB,IAAI,EAAE,MAAM,CAAC;YACb,QAAQ,EAAE,OAAO,CAAC;YAClB,OAAO,EAAE,OAAO,CAAC;YACjB,OAAO,EAAE,OAAO,CAAC;YACjB,YAAY,CAAC,EAAE,OAAO,CAAC;YACvB,KAAK,CAAC,EAAE,MAAM,CAAC;SAChB,EAAE,CAAC;QACJ,cAAc,EAAE,QAAQ,CAAC;YACvB,YAAY,EAAE,OAAO,CAAC;YACtB,SAAS,EAAE,SAAS;gBAClB,QAAQ,EAAE,MAAM,CAAC;gBACjB,IAAI,EAAE,MAAM,CAAC;gBACb,UAAU,EAAE,MAAM,CAAC;aACpB,EAAE,CAAC;YACJ,iBAAiB,EAAE,SAAS;gBAC1B,QAAQ,EAAE,MAAM,CAAC;gBACjB,aAAa,EAAE,MAAM,CAAC;gBACtB,UAAU,EAAE,MAAM,CAAC;gBACnB,IAAI,EAAE,MAAM,CAAC;gBACb,QAAQ,EAAE,OAAO,CAAC;gBAClB,OAAO,EAAE,OAAO,CAAC;gBACjB,OAAO,EAAE,OAAO,CAAC;gBACjB,YAAY,CAAC,EAAE,OAAO,CAAC;gBACvB,KAAK,CAAC,EAAE,MAAM,CAAC;gBACf,SAAS,EAAE,SAAS;oBAClB,QAAQ,EAAE,MAAM,CAAC;oBACjB,IAAI,EAAE,MAAM,CAAC;oBACb,UAAU,EAAE,MAAM,CAAC;iBACpB,EAAE,CAAC;aACL,EAAE,CAAC;SACL,CAAC,GAAG,IAAI,CAAC;QACV,QAAQ,EAAE,QAAQ,CAAC;YACjB,QAAQ,EAAE,OAAO,CAAC;YAClB,UAAU,EAAE,MAAM,CAAC;YACnB,gBAAgB,EAAE,MAAM,CAAC;YACzB,aAAa,EAAE,SAAS;gBACtB,MAAM,EAAE,MAAM,CAAC;gBACf,QAAQ,EAAE,MAAM,CAAC;gBACjB,aAAa,EAAE,MAAM,CAAC;gBACtB,UAAU,EAAE,MAAM,CAAC;aACpB,EAAE,CAAC;SACL,CAAC,CAAC;KACJ,CAAC,CAAC;CACJ,CAAC,CAAC;AAEH,MAAM,MAAM,eAAe,GAAG,QAAQ,CAAC;IACrC,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,OAAO,GAAG,QAAQ,CAAC;IACzB,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;IAC1B,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,IAAI,CAAC,EAAE,MAAM,CAAC;CACf,CAAC,CAAC;AAyWH,4EAA4E;AAC5E,wBAAgB,cAAc,CAAC,KAAK,EAAE,SAAS,QAAQ,EAAE,EAAE,GAAG,EAAE,IAAI,GAAG,MAAM,CAqC5E;AAqQD,MAAM,MAAM,kBAAkB,GAAG,QAAQ,CAAC;IACxC,aAAa,EAAE,MAAM,CAAC;IACtB,QAAQ,EAAE,MAAM,CAAC;IACjB,IAAI,EAAE,MAAM,CAAC;IACb,sEAAsE;IACtE,KAAK,EAAE,SAAS,QAAQ,EAAE,CAAC;CAC5B,CAAC,CAAC;AAGH;;;;;;GAMG;AACH,wBAAsB,oBAAoB,CACxC,OAAO,EAAE,gBAAgB,EACzB,MAAM,EAAE,WAAW,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC,EAC/C,KAAK,EAAE,kBAAkB,GACxB,OAAO,CAAC,aAAa,CAAC,CAoExB;AAGD,wBAAsB,oBAAoB,CACxC,IAAI,EAAE,iBAAiB,EACvB,OAAO,EAAE,gBAAgB,GACxB,OAAO,CAAC;IACT,OAAO,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IAC/C,iBAAiB,EAAE,aAAa,CAAC;CAClC,CAAC,CA2aD"}
+{"version":3,"file":"compile-intent.d.ts","sourceRoot":"","sources":["../../../src/operations/planning/compile-intent.ts"],"names":[],"mappings":"AAOA,OAAO,EACL,KAAK,kBAAkB,EACvB,KAAK,iBAAiB,EACtB,KAAK,cAAc,EAEpB,MAAM,wBAAwB,CAAC;AAMhC,OAAO,KAAK,EACV,gBAAgB,EAEjB,MAAM,0CAA0C,CAAC;AAKlD,OAAO,EACL,KAAK,oBAAoB,EAG1B,MAAM,wBAAwB,CAAC;AAGhC,OAAO,KAAK,EAEV,2BAA2B,EAE5B,MAAM,8BAA8B,CAAC;AACtC,OAAO,EACL,KAAK,uBAAuB,EAC5B,KAAK,sBAAsB,EAG3B,KAAK,eAAe,EAIrB,MAAM,sBAAsB,CAAC;AAG9B,eAAO,MAAM,oBAAoB,EAAG,sBAA+B,CAAC;AAGpE,MAAM,MAAM,iBAAiB,GAAG,QAAQ,CAAC;IACvC,MAAM,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,QAAQ,GAAG,QAAQ,CAAC;IAC1B,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,eAAe,CAAC,EAAE,SAAS,cAAc,EAAE,CAAC;IAC5C,cAAc,CAAC,EAAE,kBAAkB,CAAC;IACpC,OAAO,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IAC5B,eAAe,CAAC,EAAE,SAAS,2BAA2B,EAAE,CAAC;IACzD,cAAc,CAAC,EAAE,SAAS,aAAa,EAAE,CAAC;IAC1C,UAAU,CAAC,EAAE,SAAS,SAAS,EAAE,CAAC;IAClC,iBAAiB,CAAC,EAAE,SAAS,gBAAgB,EAAE,CAAC;IAChD;;;OAGG;IACH,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,mFAAmF;IACnF,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,yEAAyE;IACzE,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB;;;OAGG;IACH,eAAe,CAAC,EAAE,SAAS,sBAAsB,EAAE,CAAC;CACrD,CAAC,CAAC;AAGH,MAAM,MAAM,aAAa,GAAG,QAAQ,CAAC;IACnC,EAAE,CAAC,EAAE,MAAM,CAAC;IACZ,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;CACd,CAAC,CAAC;AAGH,MAAM,MAAM,SAAS,GAAG,QAAQ,CAAC;IAC/B,EAAE,CAAC,EAAE,MAAM,CAAC;IACZ,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;IACb,iEAAiE;IACjE,WAAW,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IAChC,iBAAiB,CAAC,EAAE,MAAM,GAAG,aAAa,GAAG,YAAY,CAAC;IAC1D,uBAAuB,CAAC,EAAE,UAAU,GAAG,UAAU,CAAC;CACnD,CAAC,CAAC;AAGH,MAAM,MAAM,gBAAgB,GAAG,QAAQ,CAAC;IACtC,UAAU,EAAE,MAAM,CAAC;IACnB,QAAQ,EAAE,QAAQ,GAAG,QAAQ,CAAC;CAC/B,CAAC,CAAC;AAGH;;;;GAIG;AACH,YAAY,EACV,oBAAoB,EACpB,cAAc,GACf,MAAM,wBAAwB,CAAC;AAChC,YAAY,EACV,uBAAuB,EACvB,sBAAsB,EACtB,eAAe,GAChB,MAAM,sBAAsB,CAAC;AAC9B,OAAO,EAAE,iBAAiB,EAAE,mBAAmB,EAAE,MAAM,wBAAwB,CAAC;AAGhF,MAAM,MAAM,oBAAoB,GAAG,QAAQ,CAAC;IAC1C,UAAU,EAAE,MAAM,CAAC;IACnB,WAAW,EAAE,MAAM,CAAC;IACpB,aAAa,EAAE,MAAM,CAAC;IACtB,YAAY,EAAE,QAAQ,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,EAAE,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IACnE,UAAU,EAAE,MAAM,CAAC;IACnB,QAAQ,EAAE,SAAS,MAAM,EAAE,CAAC;IAC5B,QAAQ,EAAE,SAAS,GAAG,QAAQ,GAAG,QAAQ,CAAC;CAC3C,CAAC,CAAC;AAGH,MAAM,MAAM,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC;AAGzD,wBAAgB,eAAe,CAC7B,IAAI,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,GACtC,MAAM,CAGR;AAGD,MAAM,MAAM,aAAa,GAAG,QAAQ,CAAC;IACnC,OAAO,EAAE,OAAO,oBAAoB,CAAC;IACrC,QAAQ,EAAE,MAAM,CAAC;IACjB,MAAM,EAAE,OAAO,GAAG,kBAAkB,GAAG,SAAS,CAAC;IACjD,QAAQ,EAAE;QACR,MAAM,EAAE,MAAM,CAAC;QACf,YAAY,EAAE,MAAM,CAAC;QACrB,iBAAiB,EAAE,MAAM,CAAC;QAC1B,YAAY,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC;KACvD,CAAC;IACF,MAAM,EAAE;QACN,IAAI,EAAE,QAAQ,GAAG,QAAQ,CAAC;QAC1B,aAAa,EAAE,MAAM,CAAC;QACtB,eAAe,EAAE,MAAM,CAAC;KACzB,CAAC;IACF,SAAS,EAAE;QACT,UAAU,EAAE,SAAS,iBAAiB,EAAE,CAAC;QACzC,SAAS,EAAE,OAAO,CAAC;KACpB,CAAC;IACF,YAAY,EAAE,SAAS;QACrB,QAAQ,EAAE,MAAM,CAAC;QACjB,IAAI,EAAE,MAAM,CAAC;QACb,IAAI,EAAE;YAAE,KAAK,EAAE,MAAM,CAAC;YAAC,GAAG,EAAE,MAAM,CAAA;SAAE,CAAC;QACrC,WAAW,EACP,iBAAiB,GACjB,WAAW,GACX,MAAM,GACN,aAAa,GACb,YAAY,CAAC;QACjB,MAAM,EAAE,SAAS,GAAG,WAAW,GAAG,cAAc,GAAG,YAAY,CAAC;QAChE,MAAM,EAAE,MAAM,GAAG,eAAe,CAAC;KAClC,EAAE,CAAC;IACJ,qBAAqB,EAAE;QACrB,OAAO,EAAE,aAAa,GAAG,UAAU,GAAG,YAAY,CAAC;QACnD,2GAA2G;QAC3G,SAAS,EAAE,SAAS,oBAAoB,EAAE,CAAC;QAC3C,qDAAqD;QACrD,UAAU,CAAC,EAAE,SAAS,oBAAoB,EAAE,CAAC;QAC7C,2CAA2C;QAC3C,OAAO,CAAC,EAAE,SAAS,oBAAoB,EAAE,CAAC;QAC1C,6DAA6D;QAC7D,SAAS,CAAC,EAAE,SAAS,oBAAoB,EAAE,CAAC;QAC5C,2DAA2D;QAC3D,OAAO,CAAC,EAAE,SAAS,eAAe,EAAE,CAAC;QACrC;;;WAGG;QACH,gBAAgB,CAAC,EAAE,SAAS,uBAAuB,EAAE,CAAC;QACtD,iEAAiE;QACjE,UAAU,CAAC,EAAE,MAAM,CAAC;KACrB,CAAC;IACF,SAAS,EAAE,SAAS,oBAAoB,EAAE,CAAC;IAC3C,KAAK,EAAE,SAAS,QAAQ,EAAE,CAAC;IAC3B,YAAY,EAAE,SAAS,eAAe,EAAE,CAAC;IACzC,WAAW,EAAE,SAAS,MAAM,EAAE,CAAC;IAC/B,gFAAgF;IAChF,iBAAiB,CAAC,EAAE,QAAQ,CAAC;QAC3B,MAAM,EAAE,SAAS;YACf,QAAQ,EAAE,MAAM,CAAC;YACjB,aAAa,EAAE,MAAM,CAAC;YACtB,UAAU,EAAE,MAAM,CAAC;YACnB,IAAI,EAAE,MAAM,CAAC;YACb,QAAQ,EAAE,OAAO,CAAC;YAClB,OAAO,EAAE,OAAO,CAAC;YACjB,OAAO,EAAE,OAAO,CAAC;YACjB,YAAY,CAAC,EAAE,OAAO,CAAC;YACvB,KAAK,CAAC,EAAE,MAAM,CAAC;SAChB,EAAE,CAAC;QACJ,cAAc,EAAE,QAAQ,CAAC;YACvB,YAAY,EAAE,OAAO,CAAC;YACtB,SAAS,EAAE,SAAS;gBAClB,QAAQ,EAAE,MAAM,CAAC;gBACjB,IAAI,EAAE,MAAM,CAAC;gBACb,UAAU,EAAE,MAAM,CAAC;aACpB,EAAE,CAAC;YACJ,iBAAiB,EAAE,SAAS;gBAC1B,QAAQ,EAAE,MAAM,CAAC;gBACjB,aAAa,EAAE,MAAM,CAAC;gBACtB,UAAU,EAAE,MAAM,CAAC;gBACnB,IAAI,EAAE,MAAM,CAAC;gBACb,QAAQ,EAAE,OAAO,CAAC;gBAClB,OAAO,EAAE,OAAO,CAAC;gBACjB,OAAO,EAAE,OAAO,CAAC;gBACjB,YAAY,CAAC,EAAE,OAAO,CAAC;gBACvB,KAAK,CAAC,EAAE,MAAM,CAAC;gBACf,SAAS,EAAE,SAAS;oBAClB,QAAQ,EAAE,MAAM,CAAC;oBACjB,IAAI,EAAE,MAAM,CAAC;oBACb,UAAU,EAAE,MAAM,CAAC;iBACpB,EAAE,CAAC;aACL,EAAE,CAAC;SACL,CAAC,GAAG,IAAI,CAAC;QACV,QAAQ,EAAE,QAAQ,CAAC;YACjB,QAAQ,EAAE,OAAO,CAAC;YAClB,UAAU,EAAE,MAAM,CAAC;YACnB,gBAAgB,EAAE,MAAM,CAAC;YACzB,aAAa,EAAE,SAAS;gBACtB,MAAM,EAAE,MAAM,CAAC;gBACf,QAAQ,EAAE,MAAM,CAAC;gBACjB,aAAa,EAAE,MAAM,CAAC;gBACtB,UAAU,EAAE,MAAM,CAAC;aACpB,EAAE,CAAC;SACL,CAAC,CAAC;KACJ,CAAC,CAAC;CACJ,CAAC,CAAC;AAEH,MAAM,MAAM,eAAe,GAAG,QAAQ,CAAC;IACrC,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,OAAO,GAAG,QAAQ,CAAC;IACzB,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;IAC1B,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,IAAI,CAAC,EAAE,MAAM,CAAC;CACf,CAAC,CAAC;AAyWH,4EAA4E;AAC5E,wBAAgB,cAAc,CAAC,KAAK,EAAE,SAAS,QAAQ,EAAE,EAAE,GAAG,EAAE,IAAI,GAAG,MAAM,CAqC5E;AAwYD,MAAM,MAAM,kBAAkB,GAAG,QAAQ,CAAC;IACxC,aAAa,EAAE,MAAM,CAAC;IACtB,QAAQ,EAAE,MAAM,CAAC;IACjB,IAAI,EAAE,MAAM,CAAC;IACb,sEAAsE;IACtE,KAAK,EAAE,SAAS,QAAQ,EAAE,CAAC;CAC5B,CAAC,CAAC;AAGH;;;;;;GAMG;AACH,wBAAsB,oBAAoB,CACxC,OAAO,EAAE,gBAAgB,EACzB,MAAM,EAAE,WAAW,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC,EAC/C,KAAK,EAAE,kBAAkB,GACxB,OAAO,CAAC,aAAa,CAAC,CAoExB;AAGD,wBAAsB,oBAAoB,CACxC,IAAI,EAAE,iBAAiB,EACvB,OAAO,EAAE,gBAAgB,GACxB,OAAO,CAAC;IACT,OAAO,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IAC/C,iBAAiB,EAAE,aAAa,CAAC;CAClC,CAAC,CAobD"}

package/dist/operations/planning/compile-intent.js

@@ -12,6 +12,7 @@ import { validateUpsertInput } from "../mutation/validation.js";
 import { isBlockingWitness, parseWhatIfAnalysis, } from "../mutation/what-if.js";
 import { analyzeSemanticAdvisorInputWithPlugins } from "../semantic-advisor/plugin-orchestration.js";
 import { canonicalize } from "../semantic-advisor/shared.js";
+import { MAX_REVIEW_CANDIDATES, REVIEW_CANDIDATE_MIN_SCORE, loadReviewRequirements, reviewCandidate, reviewNextAction, } from "./conflict-review.js";
 // implements REQ-kibi-change-to-proof-plan-compiler-v2
 export const COMPILE_PLAN_VERSION = "kibi.compile-plan.v1";
 export { isBlockingWitness, parseWhatIfAnalysis } from "../mutation/what-if.js";
@@ -358,6 +359,7 @@ async function contradictionAnalysis(prolog, requirementId, steps, now) {
         introduced: [],
         removed: [],
         unchanged: [],
+        reasons: [{ reason: "analysis_unavailable", ids: [] }],
     };
     let goal;
     try {
@@ -389,6 +391,108 @@ async function contradictionAnalysis(prolog, requirementId, steps, now) {
         unchanged: analysis.unchanged,
     };
 }
+// implements REQ-kibi-contradiction-review-candidates
+// No witness is not the same as no conflict: the checker compares only what
+// has a logical model. When a target proposition is unmodeled, or a related
+// current requirement from discovery has no logic of its own, the outcome
+// stays unresolved with the reason, and the related requirements become
+// review candidates the agent compares and judges. The verdicts come back
+// through conflictReviews: a conflict blocks the plan, a no_conflict clears
+// that candidate. A pending review leaves a ready plan ready; the outcome and
+// nextAction say what was not checked.
+async function withConflictReview(prolog, analysis, input) {
+    const diagnostics = [];
+    const decisions = new Map();
+    for (const decision of input.decisions) {
+        const id = text(decision.requirementId);
+        if (id)
+            decisions.set(id, decision);
+    }
+    const unmodeledClaims = input.propositions
+        .filter((proposition) => proposition.status === "ontology_gap" ||
+        proposition.status === "ambiguous")
+        .map((proposition) => proposition.claimKey);
+    // Matches arrive best first, so the first score seen is the highest.
+    const scores = new Map();
+    for (const match of input.matches) {
+        const id = text(match.entity.id);
+        if (text(match.entity.type) !== "req" ||
+            !id ||
+            id === input.requirementId ||
+            match.score < REVIEW_CANDIDATE_MIN_SCORE ||
+            scores.has(id))
+            continue;
+        scores.set(id, match.score);
+    }
+    const requirements = await loadReviewRequirements(prolog, [
+        ...scores.keys(),
+        ...[...decisions.keys()].filter((id) => id !== input.requirementId),
+    ]);
+    for (const id of decisions.keys()) {
+        if (id === input.requirementId || !requirements.has(id))
+            diagnostics.push(`conflictReviews names ${id}, which is not a current requirement other than the target; its verdict was ignored.`);
+    }
+    const candidates = [];
+    let pendingCount = 0;
+    for (const [id, score] of scores) {
+        const requirement = requirements.get(id);
+        if (!requirement)
+            continue;
+        const decision = decisions.get(id);
+        if (!decision) {
+            // A modeled target is compared logically with every modeled
+            // requirement; only prose-only ones need the agent. An unmodeled
+            // target cannot be compared with anything.
+            if (unmodeledClaims.length === 0 && requirement.modeled)
+                continue;
+            if (pendingCount >= MAX_REVIEW_CANDIDATES)
+                continue;
+            pendingCount += 1;
+        }
+        candidates.push(reviewCandidate(input.intent, requirement, score, decision));
+    }
+    // A verdict on a requirement discovery did not rank still counts: the
+    // agent may know a conflict the search missed.
+    for (const [id, decision] of decisions) {
+        const requirement = requirements.get(id);
+        if (!requirement || scores.has(id) || id === input.requirementId)
+            continue;
+        candidates.push(reviewCandidate(input.intent, requirement, 0, decision));
+    }
+    const pending = candidates.filter((candidate) => candidate.review === "pending");
+    const declaredConflicts = candidates.filter((candidate) => candidate.review === "conflict");
+    const reasons = [...(analysis.reasons ?? [])];
+    if (unmodeledClaims.length > 0)
+        reasons.push({ reason: "unmodeled_target", ids: unmodeledClaims });
+    const pendingUnmodeled = pending.filter((candidate) => !candidate.modeled);
+    if (unmodeledClaims.length === 0 && pendingUnmodeled.length > 0)
+        reasons.push({
+            reason: "unmodeled_related",
+            ids: pendingUnmodeled.map((candidate) => candidate.requirementId),
+        });
+    const outcome = analysis.outcome === "conflict" || declaredConflicts.length > 0
+        ? "conflict"
+        : analysis.outcome === "unresolved" || reasons.length > 0
+            ? "unresolved"
+            : "no_conflict";
+    if (declaredConflicts.length > 0)
+        diagnostics.push(`By your review the intent contradicts current requirement ${declaredConflicts.map((candidate) => candidate.requirementId).join(", ")}: ask the human which rule holds, then supersede or change the conflicting requirement, or change the intent, before applying this plan.`);
+    if (pending.length > 0)
+        diagnostics.push(`Contradiction check incomplete: Kibi could not compare this intent logically with current requirement ${pending.map((candidate) => candidate.requirementId).join(", ")}. Compare them (contradictionAnalysis.reviewCandidates) and send your verdicts in conflictReviews.`);
+    const nextAction = outcome === "no_conflict"
+        ? undefined
+        : reviewNextAction(candidates, unmodeledClaims);
+    return {
+        analysis: {
+            ...analysis,
+            outcome,
+            reasons,
+            reviewCandidates: candidates,
+            ...(nextAction !== undefined ? { nextAction } : {}),
+        },
+        diagnostics,
+    };
+}
 function proposalFor(requirementId, match) {
     const candidateId = text(match.entity.id);
     const candidateType = text(match.entity.type);
@@ -847,15 +951,24 @@ export async function executeCompileIntent(args, context) {
     // specified_by links) into the requirement step, which an upsert needs:
     // a step without properties fails entity validation.
     const stepsWithAcceptedProposals = applyAcceptedProposals(mergeSteps([...stepsWithInventory, ...drafts.steps]), proposals);
-    const contradictions = await contradictionAnalysis(prolog, requirementId, stepsWithAcceptedProposals, context.clock());
-    if (contradictions.outcome === "conflict")
-        diagnostics.push(contradictions.witnesses.some((witness) => witness.kind === "scenario_feasibility")
+    const checked = await contradictionAnalysis(prolog, requirementId, stepsWithAcceptedProposals, context.clock());
+    if (checked.outcome === "conflict")
+        diagnostics.push(checked.witnesses.some((witness) => witness.kind === "scenario_feasibility")
             ? "The plan leaves a success scenario infeasible or conflicts with a current requirement: set expects: rejection, correct the assumption, record an approved exception, or supersede the conflicting requirement before applying this plan."
             : "Current requirement conflicts must be resolved with an explicit supersedes relationship before applying this plan.");
-    if (contradictions.outcome === "unresolved")
-        diagnostics.push(contradictions.witnesses.length > 0
+    if (checked.outcome === "unresolved")
+        diagnostics.push(checked.witnesses.length > 0
             ? "Contradiction analysis is unresolved: the planned rules may overlap with current requirements and the checker can neither prove nor exclude a conflict."
             : "Contradiction analysis could not run against the attached KB snapshot with this plan staged.");
+    const reviewed = await withConflictReview(prolog, checked, {
+        intent,
+        requirementId,
+        propositions,
+        matches: search.matches,
+        decisions: args.conflictReviews ?? [],
+    });
+    const contradictions = reviewed.analysis;
+    diagnostics.push(...reviewed.diagnostics);
     if (args.mode === "create" &&
         existing.length > 0 &&
         diagnostics.some((entry) => entry.includes("already exists with different content")))

package/dist/operations/planning/conflict-review.d.ts

@@ -0,0 +1,69 @@
+import type { PrologPort } from "../../public/operations/runtime-types.js";
+/**
+ * Relevance floor for a related requirement, below the kb_search default
+ * (0.18): a missed contradiction costs more than one extra comparison, and a
+ * requirement sharing half the intent's terms in other words ("label length
+ * is limited" against "label length must be at most 200") scores about 0.13.
+ * The candidate cap bounds the noise.
+ */
+export declare const REVIEW_CANDIDATE_MIN_SCORE = 0.1;
+/** At most this many related requirements are put up for review. */
+export declare const MAX_REVIEW_CANDIDATES = 5;
+export type ConflictReviewVerdict = "conflict" | "no_conflict";
+/** The agent's judgement of one review candidate, sent back on recompile. */
+export type ConflictReviewDecision = Readonly<{
+    requirementId: string;
+    verdict: ConflictReviewVerdict;
+    note?: string;
+}>;
+/**
+ * A current requirement the contradiction checker could not compare with the
+ * intent, which the agent must compare itself.
+ */
+export type ConflictReviewCandidate = Readonly<{
+    requirementId: string;
+    title: string;
+    /** The sentence of the requirement that shares the most terms with the intent. */
+    sentence: string;
+    /** The requirement's checked statement (semantic text, else title), bounded. */
+    statement: string;
+    /** Discovery score; 0 for a requirement only the agent's review named. */
+    score: number;
+    /** Whether the requirement has a logical representation of its own. */
+    modeled: boolean;
+    review: "pending" | ConflictReviewVerdict;
+    note?: string;
+}>;
+/** Why the contradiction check could not decide, with the ids involved. */
+export type UncheckedReason = Readonly<{
+    reason: "unmodeled_target" | "unmodeled_related" | "analysis_unavailable";
+    /** Claim keys for unmodeled_target, requirement ids for unmodeled_related. */
+    ids: readonly string[];
+}>;
+/** One current requirement as review reads it. */
+export type ReviewRequirement = Readonly<{
+    id: string;
+    title: string;
+    semanticText: string;
+    modeled: boolean;
+}>;
+/**
+ * The current requirements among `ids`, each with whether it has a logical
+ * representation. Ids that are not current requirements (superseded,
+ * deprecated or unknown) are left out.
+ */
+export declare function loadReviewRequirements(prolog: Pick<PrologPort, "query">, ids: readonly string[]): Promise<Map<string, ReviewRequirement>>;
+/**
+ * The sentence of a requirement most likely to bear on the intent: the one
+ * sharing the most intent terms, the first on a tie, the title when the
+ * requirement has no prose.
+ */
+export declare function reviewSentence(intent: string, requirement: Pick<ReviewRequirement, "title" | "semanticText">): string;
+export declare function reviewCandidate(intent: string, requirement: ReviewRequirement, score: number, decision: ConflictReviewDecision | undefined): ConflictReviewCandidate;
+/**
+ * What the agent does next while the contradiction outcome is not decided:
+ * resolve a conflict it found, compare the candidates still pending, or model
+ * the claims Kibi could not check.
+ */
+export declare function reviewNextAction(candidates: readonly ConflictReviewCandidate[], unmodeledClaims: readonly string[]): string | undefined;
+//# sourceMappingURL=conflict-review.d.ts.map

package/dist/operations/planning/conflict-review.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"conflict-review.d.ts","sourceRoot":"","sources":["../../../src/operations/planning/conflict-review.ts"],"names":[],"mappings":"AAOA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,0CAA0C,CAAC;AAc3E;;;;;;GAMG;AAEH,eAAO,MAAM,0BAA0B,MAAM,CAAC;AAE9C,oEAAoE;AAEpE,eAAO,MAAM,qBAAqB,IAAI,CAAC;AAMvC,MAAM,MAAM,qBAAqB,GAAG,UAAU,GAAG,aAAa,CAAC;AAE/D,6EAA6E;AAE7E,MAAM,MAAM,sBAAsB,GAAG,QAAQ,CAAC;IAC5C,aAAa,EAAE,MAAM,CAAC;IACtB,OAAO,EAAE,qBAAqB,CAAC;IAC/B,IAAI,CAAC,EAAE,MAAM,CAAC;CACf,CAAC,CAAC;AAEH;;;GAGG;AAEH,MAAM,MAAM,uBAAuB,GAAG,QAAQ,CAAC;IAC7C,aAAa,EAAE,MAAM,CAAC;IACtB,KAAK,EAAE,MAAM,CAAC;IACd,kFAAkF;IAClF,QAAQ,EAAE,MAAM,CAAC;IACjB,gFAAgF;IAChF,SAAS,EAAE,MAAM,CAAC;IAClB,0EAA0E;IAC1E,KAAK,EAAE,MAAM,CAAC;IACd,uEAAuE;IACvE,OAAO,EAAE,OAAO,CAAC;IACjB,MAAM,EAAE,SAAS,GAAG,qBAAqB,CAAC;IAC1C,IAAI,CAAC,EAAE,MAAM,CAAC;CACf,CAAC,CAAC;AAEH,2EAA2E;AAE3E,MAAM,MAAM,eAAe,GAAG,QAAQ,CAAC;IACrC,MAAM,EAAE,kBAAkB,GAAG,mBAAmB,GAAG,sBAAsB,CAAC;IAC1E,8EAA8E;IAC9E,GAAG,EAAE,SAAS,MAAM,EAAE,CAAC;CACxB,CAAC,CAAC;AAEH,kDAAkD;AAElD,MAAM,MAAM,iBAAiB,GAAG,QAAQ,CAAC;IACvC,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;IACd,YAAY,EAAE,MAAM,CAAC;IACrB,OAAO,EAAE,OAAO,CAAC;CAClB,CAAC,CAAC;AAMH;;;;GAIG;AAEH,wBAAsB,sBAAsB,CAC1C,MAAM,EAAE,IAAI,CAAC,UAAU,EAAE,OAAO,CAAC,EACjC,GAAG,EAAE,SAAS,MAAM,EAAE,GACrB,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,iBAAiB,CAAC,CAAC,CA+BzC;AAaD;;;;GAIG;AAEH,wBAAgB,cAAc,CAC5B,MAAM,EAAE,MAAM,EACd,WAAW,EAAE,IAAI,CAAC,iBAAiB,EAAE,OAAO,GAAG,cAAc,CAAC,GAC7D,MAAM,CAgBR;AASD,wBAAgB,eAAe,CAC7B,MAAM,EAAE,MAAM,EACd,WAAW,EAAE,iBAAiB,EAC9B,KAAK,EAAE,MAAM,EACb,QAAQ,EAAE,sBAAsB,GAAG,SAAS,GAC3C,uBAAuB,CAWzB;AAED;;;;GAIG;AAEH,wBAAgB,gBAAgB,CAC9B,UAAU,EAAE,SAAS,uBAAuB,EAAE,EAC9C,eAAe,EAAE,SAAS,MAAM,EAAE,GACjC,MAAM,GAAG,SAAS,CAcpB"}

package/dist/operations/planning/conflict-review.js

@@ -0,0 +1,133 @@
+import { intentTokens } from "../../intent-search.js";
+import { escapeAtomContent, parseListOfLists, parsePrologValue, } from "../../prolog/codec.js";
+import { loadEntityRows } from "../../public/operations/discovery-entities.js";
+/**
+ * Relationships that give a requirement a logical representation the
+ * contradiction checker can compare. A requirement with none of them is prose
+ * only: no witness can ever name it.
+ */
+const LOGICAL_RELATIONSHIPS = [
+    "constrains",
+    "requires_property",
+    "requires_predicate",
+    "requires_rule",
+];
+/**
+ * Relevance floor for a related requirement, below the kb_search default
+ * (0.18): a missed contradiction costs more than one extra comparison, and a
+ * requirement sharing half the intent's terms in other words ("label length
+ * is limited" against "label length must be at most 200") scores about 0.13.
+ * The candidate cap bounds the noise.
+ */
+// implements REQ-kibi-contradiction-review-candidates
+export const REVIEW_CANDIDATE_MIN_SCORE = 0.1;
+/** At most this many related requirements are put up for review. */
+// implements REQ-kibi-contradiction-review-candidates
+export const MAX_REVIEW_CANDIDATES = 5;
+/** The longest requirement statement a review candidate quotes. */
+const MAX_STATEMENT_LENGTH = 600;
+function text(value) {
+    return typeof value === "string" ? value.trim() : "";
+}
+/**
+ * The current requirements among `ids`, each with whether it has a logical
+ * representation. Ids that are not current requirements (superseded,
+ * deprecated or unknown) are left out.
+ */
+// implements REQ-kibi-contradiction-review-candidates
+export async function loadReviewRequirements(prolog, ids) {
+    const unique = [...new Set(ids.filter(Boolean))];
+    const found = new Map();
+    if (unique.length === 0)
+        return found;
+    const idList = unique.map((id) => `'${escapeAtomContent(id)}'`).join(",");
+    const result = await prolog.query(`findall([R,M], (member(R, [${idList}]), kb:current_req(R), (once((member(T, [${LOGICAL_RELATIONSHIPS.join(",")}]), kb_relationship(T, R, _))) -> M = modeled ; M = unmodeled)), Rows)`);
+    if (!result.success)
+        return found;
+    const modeled = new Map(parseListOfLists(result.bindings.Rows ?? "[]").map(([id, flag]) => [
+        atom(id),
+        atom(flag) === "modeled",
+    ]));
+    const rows = await loadEntityRows(prolog, [...modeled.keys()], ["id", "title", "semantic_text"]);
+    for (const row of rows) {
+        const id = text(row.id);
+        if (!modeled.has(id))
+            continue;
+        found.set(id, {
+            id,
+            title: text(row.title),
+            semanticText: text(row.semantic_text),
+            modeled: modeled.get(id) === true,
+        });
+    }
+    return found;
+}
+function atom(value) {
+    return String(parsePrologValue(value ?? "")).replace(/^['"]|['"]$/g, "");
+}
+function sentences(value) {
+    return value
+        .split(/(?<=[.!?])\s+|\n+/)
+        .map((sentence) => sentence.trim())
+        .filter(Boolean);
+}
+/**
+ * The sentence of a requirement most likely to bear on the intent: the one
+ * sharing the most intent terms, the first on a tie, the title when the
+ * requirement has no prose.
+ */
+// implements REQ-kibi-contradiction-review-candidates
+export function reviewSentence(intent, requirement) {
+    const units = sentences(requirement.semanticText);
+    if (units.length === 0)
+        return requirement.title;
+    const wanted = new Set(intentTokens(intent));
+    let best = units[0] ?? requirement.title;
+    let bestShared = -1;
+    for (const unit of units) {
+        const shared = intentTokens(unit).filter((token) => wanted.has(token)).length;
+        if (shared > bestShared) {
+            best = unit;
+            bestShared = shared;
+        }
+    }
+    return best;
+}
+function bounded(value) {
+    return value.length > MAX_STATEMENT_LENGTH
+        ? `${value.slice(0, MAX_STATEMENT_LENGTH - 1).trimEnd()}…`
+        : value;
+}
+// implements REQ-kibi-contradiction-review-candidates
+export function reviewCandidate(intent, requirement, score, decision) {
+    return {
+        requirementId: requirement.id,
+        title: requirement.title,
+        sentence: reviewSentence(intent, requirement),
+        statement: bounded(requirement.semanticText || requirement.title),
+        score: Math.round(score * 1000) / 1000,
+        modeled: requirement.modeled,
+        review: decision?.verdict ?? "pending",
+        ...(decision?.note ? { note: decision.note } : {}),
+    };
+}
+/**
+ * What the agent does next while the contradiction outcome is not decided:
+ * resolve a conflict it found, compare the candidates still pending, or model
+ * the claims Kibi could not check.
+ */
+// implements REQ-kibi-contradiction-review-candidates
+export function reviewNextAction(candidates, unmodeledClaims) {
+    const ids = (review) => candidates
+        .filter((candidate) => candidate.review === review)
+        .map((candidate) => candidate.requirementId);
+    const conflicts = ids("conflict");
+    if (conflicts.length > 0)
+        return `You judged that the intent contradicts ${conflicts.join(", ")}. Ask the human which rule holds, then supersede or change the conflicting requirement, or change the intent, and compile again. Record a conflict the human has not decided yet as a review:conflict observation fact.`;
+    const pending = ids("pending");
+    if (pending.length > 0)
+        return `Kibi could not compare this intent with ${pending.join(", ")} logically. Read each reviewCandidates entry (its statement and sentence) and decide whether the intent contradicts it, then call kb_compile_intent again with the same arguments plus conflictReviews: [{requirementId, verdict: "conflict" | "no_conflict", note}] for each.`;
+    if (unmodeledClaims.length > 0)
+        return `Kibi could not check claim ${unmodeledClaims.join(", ")} for contradictions because it has no logical model: model it with kb_model (mode requirement or predicates) and compile again. Until then no conflict is confirmed, only reviewed.`;
+    return undefined;
+}

package/dist/operations/semantic-advisor/ingestion-boundary.d.ts

@@ -12,6 +12,14 @@ export type SemanticRelationship = Readonly<{
     to?: unknown;
 }>;
 export declare function validateSemanticInventoryBoundary(payload: Payload, relationships: readonly SemanticRelationship[], receipt: SemanticAdvisorReceipt): SemanticInventoryBoundaryResult;
+/**
+ * The inventory contract the advisor derives for this payload's prose, as
+ * the properties to resend: the version, source field and hash, one ledger
+ * entry per proposition and the assertive claim keys. An entry keeps the
+ * status the payload already gave the same claim key; otherwise it carries
+ * the advisor's status (an ambiguity or ontology gap stays explicit).
+ */
+export declare function semanticInventoryContract(payload: Payload, receipt: SemanticAdvisorReceipt): Record<string, unknown>;
 export declare function assertSemanticInventoryBoundary(payload: Payload, relationships: readonly SemanticRelationship[], receipt: SemanticAdvisorReceipt): void;
 /**
  * The write-time claim_key check, run against planned writes only. Returns

package/dist/operations/semantic-advisor/ingestion-boundary.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"ingestion-boundary.d.ts","sourceRoot":"","sources":["../../../src/operations/semantic-advisor/ingestion-boundary.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,0CAA0C,CAAC;AAG3E,OAAO,EACL,KAAK,OAAO,EAOb,MAAM,aAAa,CAAC;AACrB,OAAO,KAAK,EAAE,sBAAsB,EAAuB,MAAM,YAAY,CAAC;AAgB9E,MAAM,WAAW,+BAA+B;IAC9C,QAAQ,CAAC,UAAU,EAAE,OAAO,CAAC;IAC7B,QAAQ,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC;IACnC,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;CAC7B;AAED,MAAM,MAAM,oBAAoB,GAAG,QAAQ,CAAC;IAC1C,IAAI,CAAC,EAAE,OAAO,CAAC;IACf,IAAI,CAAC,EAAE,OAAO,CAAC;IACf,EAAE,CAAC,EAAE,OAAO,CAAC;CACd,CAAC,CAAC;AAuEH,wBAAgB,iCAAiC,CAC/C,OAAO,EAAE,OAAO,EAChB,aAAa,EAAE,SAAS,oBAAoB,EAAE,EAC9C,OAAO,EAAE,sBAAsB,GAC9B,+BAA+B,CA0IjC;AAED,wBAAgB,+BAA+B,CAC7C,OAAO,EAAE,OAAO,EAChB,aAAa,EAAE,SAAS,oBAAoB,EAAE,EAC9C,OAAO,EAAE,sBAAsB,GAC9B,IAAI,CAWN;AAoFD;;;;GAIG;AAEH,wBAAgB,2BAA2B,CACzC,OAAO,EAAE,OAAO,EAChB,aAAa,EAAE,SAAS,oBAAoB,EAAE,EAC9C,OAAO,EAAE,WAAW,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,GAC9D,MAAM,GAAG,IAAI,CAUf;AAGD,wBAAsB,+BAA+B,CACnD,MAAM,EAAE,UAAU,EAClB,OAAO,EAAE,OAAO,EAChB,aAAa,EAAE,SAAS,oBAAoB,EAAE,EAC9C,MAAM,CAAC,EAAE,QAAQ,CAAC;IAChB,QAAQ,EAAE,WAAW,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;CAClE,CAAC,GACD,OAAO,CAAC,IAAI,CAAC,CAwBf"}
+{"version":3,"file":"ingestion-boundary.d.ts","sourceRoot":"","sources":["../../../src/operations/semantic-advisor/ingestion-boundary.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,0CAA0C,CAAC;AAG3E,OAAO,EACL,KAAK,OAAO,EAOb,MAAM,aAAa,CAAC;AACrB,OAAO,KAAK,EAAE,sBAAsB,EAAuB,MAAM,YAAY,CAAC;AAgB9E,MAAM,WAAW,+BAA+B;IAC9C,QAAQ,CAAC,UAAU,EAAE,OAAO,CAAC;IAC7B,QAAQ,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC;IACnC,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;CAC7B;AAED,MAAM,MAAM,oBAAoB,GAAG,QAAQ,CAAC;IAC1C,IAAI,CAAC,EAAE,OAAO,CAAC;IACf,IAAI,CAAC,EAAE,OAAO,CAAC;IACf,EAAE,CAAC,EAAE,OAAO,CAAC;CACd,CAAC,CAAC;AAuEH,wBAAgB,iCAAiC,CAC/C,OAAO,EAAE,OAAO,EAChB,aAAa,EAAE,SAAS,oBAAoB,EAAE,EAC9C,OAAO,EAAE,sBAAsB,GAC9B,+BAA+B,CA0IjC;AAED;;;;;;GAMG;AAEH,wBAAgB,yBAAyB,CACvC,OAAO,EAAE,OAAO,EAChB,OAAO,EAAE,sBAAsB,GAC9B,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAuBzB;AAGD,wBAAgB,+BAA+B,CAC7C,OAAO,EAAE,OAAO,EAChB,aAAa,EAAE,SAAS,oBAAoB,EAAE,EAC9C,OAAO,EAAE,sBAAsB,GAC9B,IAAI,CAWN;AAwFD;;;;GAIG;AAEH,wBAAgB,2BAA2B,CACzC,OAAO,EAAE,OAAO,EAChB,aAAa,EAAE,SAAS,oBAAoB,EAAE,EAC9C,OAAO,EAAE,WAAW,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,GAC9D,MAAM,GAAG,IAAI,CAUf;AAGD,wBAAsB,+BAA+B,CACnD,MAAM,EAAE,UAAU,EAClB,OAAO,EAAE,OAAO,EAChB,aAAa,EAAE,SAAS,oBAAoB,EAAE,EAC9C,MAAM,CAAC,EAAE,QAAQ,CAAC;IAChB,QAAQ,EAAE,WAAW,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;CAClE,CAAC,GACD,OAAO,CAAC,IAAI,CAAC,CAiCf"}