llm-kb
← Back to social
Community

Executable ontologies fix confident-wrong-answer problem in graph RAG

A developer reports that graph-backed retrieval systems can produce confident wrong answers when traversing incorrect edge types, e.g., returning 'this person directed the genre Crime' due to a directed_by edge leaving a Genre node. The fix is making the ontology executable: declaring domain/range per relationship in YAML and checking every hop at runtime, so bad hops raise named errors instead of returning wrong nodes.

1 engagement·1 source·Sun, Jul 12, 2026, 08:21 PM
The post describes a recurring failure mode in graph-based retrieval: an edge exists in the graph, so traversal follows it, but the edge is semantically wrong for the question, leading to a confident wrong answer with no error signal. The concrete example given is 'this person directed the genre Crime' because a directed_by edge was leaving a Genre node. The solution proposed is to make the ontology executable rather than just documentation. By declaring domain and range constraints per relationship in YAML and checking every hop as the traversal runs, a bad hop raises a named error instead of returning the wrong node. The author notes that the same ontology can then be used for validation, documentation, and runtime enforcement.

Entities

executable ontology(concept)graph-backed retrieval(concept)

Related

PaperTue, Jul 7, 2026, 05:09 PM

DynaKRAG: A unified framework for learnable evidence control in multi-hop RAG

Researchers propose DynaKRAG, a framework that learns a state-conditioned policy to dynamically choose among evidence operations (retrieval, reformulation, critique, sufficiency checking) in multi-hop retrieval-augmented generation. This moves beyond fixed pipelines, potentially improving accuracy and flexibility in complex QA tasks.

0 engagement·1 source·arxiv
arXiv
CommunitySun, Jul 12, 2026, 05:16 PM

Developer shares technique: rewrite tool descriptions for AI agents, not humans

A developer on Reddit describes a practical technique for improving AI agent tool selection: rewriting tool descriptions to answer six specific questions an agent needs, such as one-line purpose, when to use, when not to use, and required input format. The post argues that many agent failures stem from descriptions written for humans familiar with the codebase, not for the agent itself.

2 engagement·1 source·reddit
ProductSat, Jul 11, 2026, 10:33 PM

Git-aware AI debugger that checks out old commits to fix production bugs

A tool that makes AI coding assistants (like Cursor or Claude Code) automatically checkout the git commit corresponding to a production error before debugging, preventing the agent from analyzing current code that has shifted. It solves the problem of AI agents hallucinating fixes because they look at the present state of files while the bug existed in a past commit.

5 engagement·2 sources·reddit
CommunitySat, Jul 11, 2026, 12:00 AM

Community discusses agent reliability: Fix the loop, not the LLM

A series of Reddit posts and articles highlight that the main challenge in building reliable AI agents is architectural, not model quality. Practitioners share experiences where agents skip safety steps or hallucinate actions, advocating for structured loops with self-reflection, approval gates, and stop reasons. NVIDIA's Nemotron post-training data and a Medium guide reinforce that improving the agent loop—rather than upgrading the LLM—is key to production reliability.

19 engagement·7 sources·rss, reddit
RSS
PaperTue, Jul 7, 2026, 05:32 PM

RSF-GLLM framework decouples differentiable graph reasoning from answer generation for multi-hop QA over knowledge graphs

Researchers propose RSF-GLLM, a framework that decouples differentiable graph reasoning from answer generation to address the non-differentiability issue in traditional retrieve-then-read pipelines for multi-hop question answering over knowledge graphs. The Recurrent Soft-Flow module uses a GRU-guided query updater and dynamic gating to propagate relevance scores across semantically dissimilar bridge nodes.

0 engagement·1 source·arxiv
arXiv