44

The benefits of query-based KGQA systems for complex and temporal questions in LLM era

International Conference on Applications of Natural Language to Data Bases (NLDB), 2025
Artem Alekseev
Mikhail Chaichuk
Miron Butko
Alexander Panchenko
Elena Tutubalina
Oleg Somov
Main:10 Pages
3 Figures
Bibliography:4 Pages
7 Tables
Appendix:1 Pages
Abstract

Large language models excel in question-answering (QA) yet still struggle with multi-hop reasoning and temporal questions. Query-based knowledge graph QA (KGQA) offers a modular alternative by generating executable queries instead of direct answers. We explore multi-stage query-based framework for WikiData QA, proposing multi-stage approach that enhances performance on challenging multi-hop and temporal benchmarks. Through generalization and rejection studies, we evaluate robustness across multi-hop and temporal QA datasets. Additionally, we introduce a novel entity linking and predicate matching method using CoT reasoning. Our results demonstrate the potential of query-based multi-stage KGQA framework for improving multi-hop and temporal QA with small language models. Code and data:this https URL

View on arXiv
Comments on this paper