Skip to content

Enabling Knowledge Graph Understanding at Scale with the EXplore Your Graphs ENgine (EXYGEN)

Sep 2026 · 0 citations · 25 references
Computer Science

TL;DR

Results show that structured schema context and lightweight prompting can substantially reduce reliance on fine-tuning for scalable conversational access to KGs, though closing the remaining gap to fully fine-tuned approaches will likely require reducing dependence on curated question-query exemplars.

Abstract

We present EXYGEN (EXplore Your Graphs ENgine), a framework for knowledge graph (KG) understanding that enables conversational access to KGs at scale. We address two questions in sequence. First, how effectively can LLMs perform text-to-SPARQL generation given only automatically derived structured metadata and small graph samples, rather than task-specific fine-tuning? We integrate VoID descriptions and ShEx schemas into a retrieval-augmented generation (RAG) pipeline and ablate KG-derived context on the SciQA benchmark. Our best configuration -- combining ShEx schemas, retrieved triples, and example question-query pairs -- reaches an exact match of 0.419 on execution results without any LLM fine-tuning. We further find that lexical metrics such as F1 poorly predict query correctness, and that larger general-purpose LLMs can outperform smaller code-specialized ones once given sufficient context. Second, we ask how to generate the structured metadata that this method relies on from very large KGs, where KG metadata generation becomes computationally intractable. We introduce a predicate-coverage-aware parallel graph sampling strategy that preserves structural diversity while remaining computationally tractable. On OpenCitations Meta and GESIS, it retains high predicate coverage with minimal triple loss and reduces runtime by over 80x; on ORKG, sampling is not just faster but the only tractable path to obtain complete metadata. Together, these results show that structured schema context and lightweight prompting can substantially reduce reliance on fine-tuning for scalable conversational access to KGs, though closing the remaining gap to fully fine-tuned approaches will likely require reducing dependence on curated question-query exemplars -- whether through synthetic generation or an execution-feedback-driven approach -- and validating these findings beyond a single benchmark.

View source

Similar papers

Preprint Sep 2026

KGVoyager: Knowledge Graph Agnostic Question Answering via Agentic Navigation

KGVoyager is presented, a KG-agnostic agentic architecture that generates SPARQL queries from natural language questions by dynamically discovering graph structure and semantics, requiring only a query endpoint of the underlying graph.

Essam Wisam, Cheng-Kai Li · 0 citations
#artificial intelligence Preprint Sep 2026

Build2SPARQL: A Large-Scale Text-to-SPARQL Benchmark Dataset for Building Knowledge Graph Querying

Building automation systems are increasingly represented as semantic knowledge graphs (KGs) using ontologies such as Brick and ASHRAE 223P, creating a machine-readable substrate for artificial-intelligence applications. One promising application is translating natural-language questions into SPARQL (text-to-SPARQL), wh...

Wooyoung Jung · 0 citations
#artificial intelligence Preprint Oct 2026

Natural Language Questions as an Interface for Knowledge Graphs: QRAKEN Graph Distillation and Semantic Self-Healing

QRAKEN is a training-free, ontology-agnostic neurosymbolic pipeline grounding generation in empirical graph evidence rather than schema expectations, supporting the value of empirical patterns beyond schema exposure.

Remo Grillo, L. Klic, Giovanni Colavizza · 0 citations
#large language models Open access Oct 2026

Assessing Graph Data Serialization and Context Selection for Knowledge-Augmented Question Answering with Large Language Models

Large language models (LLMs) can produce inaccurate answers even when relevant facts are supplied in the prompt. This study examines how graph data serialization, entity identifiers, and context selection affect factual question answering in knowledge-augmented prompting. Four synthetic knowledge graph datasets contain...

Marko Horvat, Sven Leo Kupres, Marko Delimar · 0 citations
2026

Reasoning Graph-Structured Question Answering: Datasets and Insights from LLM Benchmarking

GRS-QA is introduced, a reasoning graph-structured question answering dataset that augments multi-hop QA instances from exisiting datasets, with directed reasoning graphs representing intermediate inference steps, and highlights the importance of unified structural annotations for understanding and improving multi-hop...

Khin S. Yone, Devasha Trivedi, Anish Pahilajani et al. · 0 citations
Preprint Oct 2026

SPARQL-LLM in the TEXT2SPARQL 2026 Challenge

Querying distributed data represented as Knowledge Graphs (KGs) via SPARQL remains a difficult task, requiring fluency in query syntax, endpoint specifications, and schema details. Knowledge Graph Question Answering (KGQA) systems address this by automatically translating natural language into SPARQL, and recent advanc...

P. Smeros, Vincent Emonet, Rui-Jie Wang et al. · 0 citations

Related blog posts

MIT News · Artificial Intelligence Sep 29, 2026

Who we become when we talk to machines

Professor Sherry Turkle’s new book, “Artificial Intimacy,” offers a withering critique of chatbots and the antisocial dynamics she believes they encourage.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.