Sign inGet started
Paper · arXiv

Schema-Agnostic Graph Reasoning Agent for Hybrid Knowledge Graphs

Tool-calling LLM agents navigate unfamiliar codebases with a handful of generic primitives for listing, reading and searching files (ls, cat, grep). A knowledge graph admits the same interface: listing neighbours, reading node content and searching descriptions are the same operations on a different substrate. Building on this correspondence, we present GRA, a Graph Reasoning Agent that explores hybrid knowledge graphs, whose nodes are either textual concepts or relational tables, with seven generic tools, discovering everything domain-specific at run time. On UFK-M (Unified Factory Knowledge Model), an industrial benchmark of 258 analytical questions whose gold answers are produced by ex...

AuthorsMarius Dragic, Ruben Ifrah, Alexandre Rio
Primary categorycs.AI
Published16 August 2026
Last updated at source16 August 2026
cs.AIcs.CLcs.DB
Embed this entry
<iframe src="https://silytics.si/embed/item/e4ab2a72-1a85-4d67-8a24-2e16ddbca873" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.