knowledge-graph-system
Active·★ 40·Apache-2.0·Updated 2026-05-29
★ Trending★ Hidden Gem
Kappa Graph — κ(G). A semantic knowledge graph where knowledge has weight. Extracts concepts, measures grounding strength, preserves disagreement, traces everything to source.
Kappa Graph is a semantic knowledge graph system designed to extract concepts and relationships from various documents, providing an epistemic layer that measures the reliability and support of claims. It distinguishes itself by offering grounding scores, detecting contradictions, and preserving the full provenance chain to source evidence.
#Knowledge Graph#Semantic Search#Epistemic Metrics#Grounding Scores#Contradiction Detection#FUSE Filesystem#LLM Integration#Document Analysis
01
Features
01Ingest documents (PDFs, markdown, images, text)
02Search by meaning, not just keywords
03Check confidence with grounding scores and detect contradictions
04Trace claims and concepts back to original source evidence
05Query via AI assistants through MCP server integration
02
Compatibility
Python
Backend Runtime
Verified via docs
PostgreSQL
Database
Verified via docs
Apache AGE
Graph Database
Verified via docs
Ollama
LLM Inference
Verified via docs
FUSE
Filesystem Integration
Verified via docs
AI Assistants
Integration
Verified via docs
03
Quick start
1
$ git clone https://github.com/aaronsb/knowledge-graph-system.git
2
$ cd knowledge-graph-system
3
$ ./operator.sh init
4
$ ./operator.sh start
04
Use cases
↳Research synthesis and identifying disagreements across papers
↳Managing and querying complex technical documentation
↳Providing persistent, grounded memory for AI agents
↳Compliance and audit with full provenance chain tracking
05
Alternatives
Brave Search MCP★ 86.5k
Allow your AI Agent to search the real-time internet using Brave Search API. Essential for getting up-to-date information.
Claude Flow★ 56.4k
The leading agent orchestration platform for Claude. Deploy intelligent multi-agent swarms.
Related searches
Comments
Log in to leave a comment
No comments yet. Be the first!