Skip to content
Conference Open access

NaVQA: Mitigating Silent Failures in Question Answering over Virtual Knowledge Graph

Sep 2026 · Proceedings of the Thirty-Fifth International Joint Conference on Artificial Intelligence · 0 citations · 45 references

TL;DR

This paper studies the VKG-QA task, which enables users to interact with the VKGs through a natural language (NL) interface by translating their questions into SPARQL queries, and pro-poses NaVQA (Navigation-based VKG Question Answering), a framework leveraging Large Language Models.

Abstract

Virtual Knowledge Graphs (VKGs) provide unified access to legacy relational data sources through a high-level ontology modeling a domain of interest. The content of the ontology elements (classes and properties) is virtually mapped to underlying data sources through declarative mappings. The standard approach to interacting with a VKG system is to use SPARQL as the query language. However, the complexity of SPARQL creates a high entry barrier for normal users. In this paper, we study the VKG-QA task, which enables users to interact with the VKGs through a natural language (NL) interface by translating their questions into SPARQL queries. One critical challenge in such translation is silent failures, where a syntactically correct SPARQL query returns empty results because it involves ontology elements that lack mappings to the underlying data. To address this, we propose NaVQA (Navigation-based VKG Question Answering), a framework leveraging Large Language Models that (1) identifies and indexes the active ontology elements based on the mapping specifications, and (2) iteratively constructs a query graph from the NL question using the active ontology elements and their relations to synthesize SPARQL. Experiments on three real-world VKGs show that NaVQA significantly mitigates silent failures and outperforms existing baselines.

Read PDF

Similar papers

Preprint Aug 2026

Towards Researcher Agents for Knowledge-Graph Question Answering

This work presents an agentic text-to-SPARQL system that goes one step beyond static tool-using agents: a researcher agent that, after each round of inference on a validation set, proposes and tests changes to its own prompts, rules, and tool-orchestration code.

Tommaso Soru, Abdulsobur Oyewale · 0 citations

Natural Language Access to Domain-Specific Metadata: A Reusable Framework for LLM Query Generation

It is shown that when domain vocabulary and semantics are captured in a well-designed Web Ontology Language (OWL) ontology, Large Language Models (LLMs) can generate accurate structured queries zero-shot, without task-specific fine-tuning, retrieval augmentation, or multi-agent orchestration.

B. Fitch, Cato Elia Kurtz · 0 citations
Conference Jul 2026

OASA-KGQA: Ontology-Aware Semantic Agent for Knowledge Graph Question Answering

In order to enable natural language interaction with structured knowledge bases based on ontologies, widely used to represent knowledge in multiple complex domains, Knowledge Graph Question Answering (KGQA) systems are required. Large Language Models (LLMs) can play a pivotal role in this context, however they suffer f...

Zahra Fereidooni, M. Fanfani, G. Pantaleo et al. · 0 citations
#artificial intelligence Preprint Sep 2026

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

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.

Harshdeep Singh, Yu-Rui Zhu, Giovanni Colavizza et al. · 0 citations
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
Jul 2026

Making Mathematical Knowledge Explainable, Accessible and Interoperable Through Large Language Model Integration

The benefits of combining the accessibility of an LLM with the epistemic safety of a curated knowledge base through the adaptability of the MCP protocol are illustrated by two use cases involving mathematical models in the fields of continuum mechanics and enzyme kinetics.

Jan Range, B. Schembera, Dominik Göddeke · 0 citations

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