agentic_kg_memory

Extract normalized triplets from sources into graph-backed semantic memory.

Updated Apr 20, 2026
One-click install
npx skills add https://github.com/thistleknot/skills --skill agentic-kg-memory
Or copy as Structured Prompt for Agent
Please help me install this Agent Skill.
Skill: agentic_kg_memory
Source: https://github.com/thistleknot/skills/tree/main/agentic_kg_memory
Command: npx skills add https://github.com/thistleknot/skills --skill agentic-kg-memory

SYSTEM DOCUMENTATION & REQUIREMENTS

What problem does it solve?

It helps you turn scattered source material into graph-backed semantic memory, retrieve the most relevant evidence for a question, and continuously update conclusions as new evidence arrives.

Core Features & Use Cases

  • Graph-backed semantic memory: extract normalized triplets (with polarity and inference type) and store them as typed edges plus searchable dense/sparse surfaces.
  • Evidence-first retrieval and synthesis: narrow candidates with BM25/vector similarity, optionally route structural queries via the KG, and synthesize answers grounded in sources.
  • Updateable “throughlines”: maintain durable abductive conclusions whose identity is the premise set, then revise or supersede them as evidence changes.

Quick Start

Run agentic_kg_memory to ingest your sources, build the triplet and page layers, and retrieve grounded throughlines for your next question.

Frequently Asked Questions about agentic_kg_memory

High-intent search queries and answers about installing and using this skill.

FAQPage Schema
How do I build a knowledge graph from unstructured text sources?

To build a knowledge graph from sources, you extract normalized triplets with polarity and inference type, storing them as typed edges with searchable dense and sparse surfaces for retrieval.

What is the best way to update semantic memory as new evidence arrives?

Updating semantic memory involves maintaining updateable throughlines where conclusions are identified by premise sets, allowing you to revise, reinforce, weaken, or supersede them as evidence changes.

How does BM25 and vector embedding retrieval work for evidence grounding?

Evidence grounding uses BM25 and vector embedding retrieval to narrow candidate sources via sparse and dense similarity, optionally routing structural queries through the knowledge graph to synthesize answers.

Do I need SQLite or Chroma storage to manage graph-backed memory?

Yes, graph-backed memory requires a SQLite or Chroma-backed storage setup to maintain the triplet and page layers necessary for query-time retrieval and durable throughline management.

Can I use graph-backed memory for both semantic and structural evidence lookup?

Graph-backed memory applies to both semantic or fuzzy questions and graph-structured evidence lookup by combining BM25 vector similarity narrowing with knowledge graph routing.

When should I use throughlines for knowledge accumulation?

Use throughlines for knowledge accumulation when you need durable abductive conclusions whose identity is the premise set, enabling you to revise or supersede them as new evidence arrives.