kibi-mcp 0.2.3 → 0.3.0

package/dist/tools/branch.js

@@ -15,33 +15,6 @@
  You should have received a copy of the GNU Affero General Public License
  along with this program.  If not, see <https://www.gnu.org/licenses/>.
 */
-/*
- How to apply this header to source files (examples)
-
- 1) Prepend header to a single file (POSIX shells):
-
-    cat LICENSE_HEADER.txt "$FILE" > "$FILE".with-header && mv "$FILE".with-header "$FILE"
-
- 2) Apply to multiple files (example: the project's main entry files):
-
-    for f in packages/cli/bin/kibi packages/mcp/bin/kibi-mcp packages/cli/src/*.ts packages/mcp/src/*.ts; do
-      if [ -f "$f" ]; then
-        cp "$f" "$f".bak
-        (cat LICENSE_HEADER.txt; echo; cat "$f" ) > "$f".new && mv "$f".new "$f"
-      fi
-    done
-
- 3) Avoid duplicating the header: run a quick guard to only add if missing
-
-    for f in packages/cli/bin/kibi packages/mcp/bin/kibi-mcp; do
-      if [ -f "$f" ]; then
-        if ! head -n 5 "$f" | grep -q "Copyright (C) 2026 Piotr Franczyk"; then
-          cp "$f" "$f".bak
-          (cat LICENSE_HEADER.txt; echo; cat "$f" ) > "$f".new && mv "$f".new "$f"
-        fi
-      fi
-    done
-*/
 import { execSync } from "node:child_process";
 import * as fs from "node:fs";
 import * as path from "node:path";

package/dist/tools/check.js

@@ -15,33 +15,6 @@
  You should have received a copy of the GNU Affero General Public License
  along with this program.  If not, see <https://www.gnu.org/licenses/>.
 */
-/*
- How to apply this header to source files (examples)
-
- 1) Prepend header to a single file (POSIX shells):
-
-    cat LICENSE_HEADER.txt "$FILE" > "$FILE".with-header && mv "$FILE".with-header "$FILE"
-
- 2) Apply to multiple files (example: the project's main entry files):
-
-    for f in packages/cli/bin/kibi packages/mcp/bin/kibi-mcp packages/cli/src/*.ts packages/mcp/src/*.ts; do
-      if [ -f "$f" ]; then
-        cp "$f" "$f".bak
-        (cat LICENSE_HEADER.txt; echo; cat "$f" ) > "$f".new && mv "$f".new "$f"
-      fi
-    done
-
- 3) Avoid duplicating the header: run a quick guard to only add if missing
-
-    for f in packages/cli/bin/kibi packages/mcp/bin/kibi-mcp; do
-      if [ -f "$f" ]; then
-        if ! head -n 5 "$f" | grep -q "Copyright (C) 2026 Piotr Franczyk"; then
-          cp "$f" "$f".bak
-          (cat LICENSE_HEADER.txt; echo; cat "$f" ) > "$f".new && mv "$f".new "$f"
-        fi
-      fi
-    done
-*/
 import { existsSync } from "node:fs";
 import { createRequire } from "node:module";
 import * as path from "node:path";
@@ -90,6 +63,9 @@ export async function handleKbCheck(prolog, args) {
             "no-cycles",
             "required-fields",
             "symbol-coverage",
+            "symbol-traceability",
+            "deprecated-adr-no-successor",
+            "domain-contradictions",
         ];
         const rulesToRun = rules && rules.length > 0 ? rules : allRules;
         const rulesAllowlist = new Set(rulesToRun);
@@ -137,6 +113,9 @@ export async function handleKbCheck(prolog, args) {
         if (rulesToRun.includes("symbol-coverage")) {
             violations.push(...(await checkSymbolCoverage(prolog)));
         }
+        if (rulesToRun.includes("symbol-traceability")) {
+            violations.push(...(await checkSymbolTraceability(prolog, false)));
+        }
         const diagnostics = violations.map((v) => ({
             category: "SYNC_ERROR",
             severity: "error",
@@ -232,6 +211,32 @@ async function runAggregatedChecks(prolog, rulesAllowlist) {
     }
     return violations;
 }
+async function checkSymbolTraceability(prolog, requireAdr) {
+    const violations = [];
+    const requireAdrStr = requireAdr ? "true" : "false";
+    const result = await prolog.query(`findall(violation(Rule, EntityId, Desc, Sugg, Src), checks:symbol_traceability_violation(${requireAdrStr}, violation(Rule, EntityId, Desc, Sugg, Src)), Violations)`);
+    if (!result.success || !result.bindings.Violations) {
+        return violations;
+    }
+    const violationsStr = result.bindings.Violations;
+    if (violationsStr && violationsStr !== "[]") {
+        const violationRegex = /violation\(([^,]+),'?([^',]+)'?,([^,]+),([^,]+),'?([^']*)'?\)/g;
+        let match;
+        do {
+            match = violationRegex.exec(violationsStr);
+            if (match) {
+                violations.push({
+                    rule: match[1].trim().replace(/^'|'$/g, ""),
+                    entityId: match[2].trim(),
+                    description: match[3].trim().replace(/^"|"$/g, ""),
+                    suggestion: match[4].trim().replace(/^"|"$/g, ""),
+                    source: match[5].trim() || undefined,
+                });
+            }
+        } while (match);
+    }
+    return violations;
+}
 async function checkMustPriorityCoverage(prolog) {
     const violations = [];
     const gapsResult = await prolog.query("setof([Req,Reason], coverage_gap(Req, Reason), Rows)");

package/dist/tools/context.js

@@ -1,20 +1,4 @@
-/*
- Kibi — repo-local, per-branch, queryable long-term memory for software projects
- Copyright (C) 2026 Piotr Franczyk
-
- This program is free software: you can redistribute it and/or modify
- it under the terms of the GNU Affero General Public License as published by
- the Free Software Foundation, either version 3 of the License, or
- (at your option) any later version.
-
- This program is distributed in the hope that it will be useful,
- but WITHOUT ANY WARRANTY; without even the implied warranty of
- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- GNU Affero General Public License for more details.
-
- You should have received a copy of the GNU Affero General Public License
- along with this program.  If not, see <https://www.gnu.org/licenses/>.
-*/
+import { parseEntityFromList, parseListOfLists, } from "kibi-cli/prolog/codec";
 export async function handleKbContext(prolog, args) {
     const { sourceFile } = args;
     try {
@@ -78,193 +62,3 @@ export async function handleKbContext(prolog, args) {
         throw new Error(`Context query failed: ${message}`);
     }
 }
-function parseListOfLists(listStr) {
-    const cleaned = listStr.trim().replace(/^\[/, "").replace(/\]$/, "");
-    if (cleaned === "") {
-        return [];
-    }
-    const results = [];
-    let depth = 0;
-    let current = "";
-    let currentList = [];
-    for (let i = 0; i < cleaned.length; i++) {
-        const char = cleaned[i];
-        if (char === "[") {
-            depth++;
-            if (depth > 1)
-                current += char;
-        }
-        else if (char === "]") {
-            depth--;
-            if (depth === 0) {
-                if (current) {
-                    currentList.push(current.trim());
-                    current = "";
-                }
-                if (currentList.length > 0) {
-                    results.push(currentList);
-                    currentList = [];
-                }
-            }
-            else {
-                current += char;
-            }
-        }
-        else if (char === "," && depth === 1) {
-            if (current) {
-                currentList.push(current.trim());
-                current = "";
-            }
-        }
-        else if (char === "," && depth === 0) {
-        }
-        else {
-            current += char;
-        }
-    }
-    return results;
-}
-function parseEntityFromList(data) {
-    if (data.length < 3) {
-        return {};
-    }
-    const id = data[0].trim();
-    const type = data[1].trim();
-    const propsStr = data[2].trim();
-    const props = parsePropertyList(propsStr);
-    return { ...props, id: normalizeEntityId(stripOuterQuotes(id)), type };
-}
-function parsePropertyList(propsStr) {
-    const props = {};
-    let cleaned = propsStr.trim();
-    if (cleaned.startsWith("[")) {
-        cleaned = cleaned.substring(1);
-    }
-    if (cleaned.endsWith("]")) {
-        cleaned = cleaned.substring(0, cleaned.length - 1);
-    }
-    const pairs = splitTopLevel(cleaned, ",");
-    for (const pair of pairs) {
-        const eqIndex = pair.indexOf("=");
-        if (eqIndex === -1)
-            continue;
-        const key = pair.substring(0, eqIndex).trim();
-        const value = pair.substring(eqIndex + 1).trim();
-        if (key === "..." || value === "..." || value === "...|...") {
-            continue;
-        }
-        const parsed = parsePrologValue(value);
-        props[key] = parsed;
-    }
-    return props;
-}
-function parsePrologValue(valueInput) {
-    const value = valueInput.trim();
-    if (value.startsWith("^^(")) {
-        const innerStart = value.indexOf("(") + 1;
-        let depth = 1;
-        let innerEnd = innerStart;
-        for (let i = innerStart; i < value.length; i++) {
-            if (value[i] === "(")
-                depth++;
-            if (value[i] === ")") {
-                depth--;
-                if (depth === 0) {
-                    innerEnd = i;
-                    break;
-                }
-            }
-        }
-        const innerContent = value.substring(innerStart, innerEnd);
-        const parts = splitTopLevel(innerContent, ",");
-        if (parts.length >= 2) {
-            let literalValue = parts[0].trim();
-            if (literalValue.startsWith('"') && literalValue.endsWith('"')) {
-                literalValue = literalValue.substring(1, literalValue.length - 1);
-            }
-            if (literalValue.startsWith("[") && literalValue.endsWith("]")) {
-                const listContent = literalValue.substring(1, literalValue.length - 1);
-                if (listContent === "") {
-                    return [];
-                }
-                return listContent.split(",").map((item) => item.trim());
-            }
-            return literalValue;
-        }
-    }
-    if (value.startsWith("file:///")) {
-        const lastSlash = value.lastIndexOf("/");
-        if (lastSlash !== -1) {
-            return value.substring(lastSlash + 1);
-        }
-        return value;
-    }
-    if (value.startsWith('"') && value.endsWith('"')) {
-        return value.substring(1, value.length - 1);
-    }
-    if (value.startsWith("'") && value.endsWith("'")) {
-        return value.substring(1, value.length - 1);
-    }
-    if (value.startsWith("[") && value.endsWith("]")) {
-        const listContent = value.substring(1, value.length - 1);
-        if (listContent === "") {
-            return [];
-        }
-        const items = listContent.split(",").map((item) => {
-            return parsePrologValue(item.trim());
-        });
-        return items;
-    }
-    return value;
-}
-function splitTopLevel(str, delimiter) {
-    const results = [];
-    let current = "";
-    let depth = 0;
-    let inQuotes = false;
-    for (let i = 0; i < str.length; i++) {
-        const char = str[i];
-        const prevChar = i > 0 ? str[i - 1] : "";
-        if (char === '"' && prevChar !== "\\") {
-            inQuotes = !inQuotes;
-            current += char;
-        }
-        else if (!inQuotes && (char === "[" || char === "(")) {
-            depth++;
-            current += char;
-        }
-        else if (!inQuotes && (char === "]" || char === ")")) {
-            depth--;
-            current += char;
-        }
-        else if (!inQuotes && depth === 0 && char === delimiter) {
-            if (current) {
-                results.push(current);
-                current = "";
-            }
-        }
-        else {
-            current += char;
-        }
-    }
-    if (current) {
-        results.push(current);
-    }
-    return results;
-}
-function stripOuterQuotes(value) {
-    if (value.startsWith("'") && value.endsWith("'")) {
-        return value.slice(1, -1);
-    }
-    if (value.startsWith('"') && value.endsWith('"')) {
-        return value.slice(1, -1);
-    }
-    return value;
-}
-function normalizeEntityId(value) {
-    if (!value.startsWith("file:///")) {
-        return value;
-    }
-    const idx = value.lastIndexOf("/");
-    return idx === -1 ? value : value.slice(idx + 1);
-}

package/dist/tools/coverage-report.js

@@ -1,20 +1,3 @@
-/*
- Kibi — repo-local, per-branch, queryable long-term memory for software projects
- Copyright (C) 2026 Piotr Franczyk
-
- This program is free software: you can redistribute it and/or modify
- it under the terms of the GNU Affero General Public License as published by
- the Free Software Foundation, either version 3 of the License, or
- (at your option) any later version.
-
- This program is distributed in the hope that it will be useful,
- but WITHOUT ANY WARRANTY; without even the implied warranty of
- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- GNU Affero General Public License for more details.
-
- You should have received a copy of the GNU Affero General Public License
- along with this program.  If not, see <https://www.gnu.org/licenses/>.
-*/
 import { parseAtomList, parsePairList } from "./prolog-list.js";
 export async function handleKbCoverageReport(prolog, args) {
     const requested = args.type ?? "all";

package/dist/tools/delete.js

@@ -1,23 +1,4 @@
-/*
- Kibi — repo-local, per-branch, queryable long-term memory for software projects
- Copyright (C) 2026 Piotr Franczyk
-
- This program is free software: you can redistribute it and/or modify
- it under the terms of the GNU Affero General Public License as published by
- the Free Software Foundation, either version 3 of the License, or
- (at your option) any later version.
-
- This program is distributed in the hope that it will be useful,
- but WITHOUT ANY WARRANTY; without even the implied warranty of
- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- GNU Affero General Public License for more details.
-
- You should have received a copy of the GNU Affero General Public License
- along with this program.  If not, see <https://www.gnu.org/licenses/>.
-*/
-function escapeAtom(value) {
-    return value.replace(/'/g, "''");
-}
+import { escapeAtom } from "kibi-cli/prolog/codec";
 /**
  * Handle kb.delete tool calls
  * Prevents deletion of entities with dependents (referential integrity)

package/dist/tools/derive.js

@@ -1,20 +1,4 @@
-/*
- Kibi — repo-local, per-branch, queryable long-term memory for software projects
- Copyright (C) 2026 Piotr Franczyk
-
- This program is free software: you can redistribute it and/or modify
- it under the terms of the GNU Affero General Public License as published by
- the Free Software Foundation, either version 3 of the License, or
- (at your option) any later version.
-
- This program is distributed in the hope that it will be useful,
- but WITHOUT ANY WARRANTY; without even the implied warranty of
- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- GNU Affero General Public License for more details.
-
- You should have received a copy of the GNU Affero General Public License
- along with this program.  If not, see <https://www.gnu.org/licenses/>.
-*/
+import { escapeAtom } from "kibi-cli/prolog/codec";
 import { parseAtomList, parsePairList } from "./prolog-list.js";
 const RULES = [
     "transitively_implements",
@@ -234,9 +218,6 @@ function makeConjunction(parts) {
     }
     return `, ${filtered.join(", ")}`;
 }
-function escapeAtom(value) {
-    return value.replace(/'/g, "\\'");
-}
 async function deriveCurrentAdr(prolog) {
     // Query for all current ADRs and their titles
     const result = await prolog.query("setof([Id,TitleAtom], (kb_entity(Id, adr, Props), memberchk(title=Title, Props), normalize_term_atom(Title, TitleAtom), current_adr(Id)), Rows)");

package/dist/tools/impact.js

@@ -1,20 +1,4 @@
-/*
- Kibi — repo-local, per-branch, queryable long-term memory for software projects
- Copyright (C) 2026 Piotr Franczyk
-
- This program is free software: you can redistribute it and/or modify
- it under the terms of the GNU Affero General Public License as published by
- the Free Software Foundation, either version 3 of the License, or
- (at your option) any later version.
-
- This program is distributed in the hope that it will be useful,
- but WITHOUT ANY WARRANTY; without even the implied warranty of
- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- GNU Affero General Public License for more details.
-
- You should have received a copy of the GNU Affero General Public License
- along with this program.  If not, see <https://www.gnu.org/licenses/>.
-*/
+import { escapeAtom } from "kibi-cli/prolog/codec";
 import { parseAtomList } from "./prolog-list.js";
 export async function handleKbImpact(prolog, args) {
     if (!args.entity || typeof args.entity !== "string") {
@@ -65,6 +49,3 @@ async function getEntityType(prolog, id) {
     }
     return result.bindings.Type;
 }
-function escapeAtom(value) {
-    return value.replace(/'/g, "\\'");
-}

package/dist/tools/list-types.js

@@ -1,20 +1,3 @@
-/*
- Kibi — repo-local, per-branch, queryable long-term memory for software projects
- Copyright (C) 2026 Piotr Franczyk
-
- This program is free software: you can redistribute it and/or modify
- it under the terms of the GNU Affero General Public License as published by
- the Free Software Foundation, either version 3 of the License, or
- (at your option) any later version.
-
- This program is distributed in the hope that it will be useful,
- but WITHOUT ANY WARRANTY; without even the implied warranty of
- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- GNU Affero General Public License for more details.
-
- You should have received a copy of the GNU Affero General Public License
- along with this program.  If not, see <https://www.gnu.org/licenses/>.
-*/
 /**
  * Handle kb_list_entity_types tool calls
  * Returns the static list of supported KB entity type names (req, scenario, test, adr, flag, event, symbol, fact).

package/dist/tools/prolog-list.js

@@ -15,33 +15,6 @@
  You should have received a copy of the GNU Affero General Public License
  along with this program.  If not, see <https://www.gnu.org/licenses/>.
 */
-/*
- How to apply this header to source files (examples)
-
- 1) Prepend header to a single file (POSIX shells):
-
-    cat LICENSE_HEADER.txt "$FILE" > "$FILE".with-header && mv "$FILE".with-header "$FILE"
-
- 2) Apply to multiple files (example: the project's main entry files):
-
-    for f in packages/cli/bin/kibi packages/mcp/bin/kibi-mcp packages/cli/src/*.ts packages/mcp/src/*.ts; do
-      if [ -f "$f" ]; then
-        cp "$f" "$f".bak
-        (cat LICENSE_HEADER.txt; echo; cat "$f" ) > "$f".new && mv "$f".new "$f"
-      fi
-    done
-
- 3) Avoid duplicating the header: run a quick guard to only add if missing
-
-    for f in packages/cli/bin/kibi packages/mcp/bin/kibi-mcp; do
-      if [ -f "$f" ]; then
-        if ! head -n 5 "$f" | grep -q "Copyright (C) 2026 Piotr Franczyk"; then
-          cp "$f" "$f".bak
-          (cat LICENSE_HEADER.txt; echo; cat "$f" ) > "$f".new && mv "$f".new "$f"
-        fi
-      fi
-    done
-*/
 export function parseAtomList(raw) {
     const trimmed = raw.trim();
     if (trimmed === "[]" || trimmed.length === 0) {

package/dist/tools/query-relationships.js

@@ -1,20 +1,3 @@
-/*
- Kibi — repo-local, per-branch, queryable long-term memory for software projects
- Copyright (C) 2026 Piotr Franczyk
-
- This program is free software: you can redistribute it and/or modify
- it under the terms of the GNU Affero General Public License as published by
- the Free Software Foundation, either version 3 of the License, or
- (at your option) any later version.
-
- This program is distributed in the hope that it will be useful,
- but WITHOUT ANY WARRANTY; without even the implied warranty of
- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- GNU Affero General Public License for more details.
-
- You should have received a copy of the GNU Affero General Public License
- along with this program.  If not, see <https://www.gnu.org/licenses/>.
-*/
 const VALID_REL_TYPES = [
     "depends_on",
     "specified_by",