Skip to content

Schema-Anchored Latent Reasoning for Semantic Parsing-Based Knowledge Base Question Answering

Sep 2026 · 0 citations · 33 references
Computer Science

TL;DR

SALR is proposed, a schema-anchored latent reasoning method for LF construction that performs multi-step reasoning by generating continuous thoughts in the model's hidden states, thereby delaying the explicit commitment to LF decisions.

Abstract

Semantic parsing (SP)-based knowledge base question answering aims to answer natural language questions by generating executable logical forms (LFs) over knowledge bases (KBs). When applying Large Language Models (LLMs) to this task, a key challenge over large, heterogeneous KBs is selecting question-related schema elements (i.e., relations and classes) and composing them into complex LFs. Recent LLM-based methods often make early discrete commitments to schema elements during intermediate reasoning, allowing incorrect intermediate schema decisions to propagate and finally result in incorrect LFs. To overcome this limitation, we propose SALR, a schema-anchored latent reasoning method for LF construction. It performs multi-step reasoning by generating continuous thoughts in the model's hidden states, thereby delaying the explicit commitment to LF decisions. To ground this latent reasoning process in the corresponding KB schema, SALR aligns continuous thoughts with a codebook of KB schema elements through an alignment objective supervised by schema traces deterministically derived from gold LFs. It then incorporates the aligned schema codes into inputs for subsequent reasoning steps. This schema-mediated feedback guides LF generation without requiring the model to emit an explicit textual reasoning trajectory. Experiments on GrailQA and WebQSP show that SALR achieves consistent overall gains over strong baselines. Notably, on compositional questions from GrailQA, SALR outperforms TIARA, a strong SP-based baseline, by 2.86 F1 points. Further analyses show that schema-mediated feedback affects LF generation and that schema information is recoverable from the latent states.

View source

Similar papers

Sep 2026

Focus on Evidence: Relational-Structure Enhances LLM Effectiveness in TableQA

Table Question Answering (TableQA) requires reasoning over natural language questions and structured tables, and remains challenging due to noisy evidence and complex multi-step reasoning. Recent Large Language Model (LLM)-based approaches typically adopt decomposition–reasoning–validation pipelines that combine Chain-...

Zhen Yang, Zi-Wei Du, Ming-Han Zhang et al. · 0 citations
Preprint Aug 2026

Compositional Chain-of-Relations for Faithful Knowledge Graph Question Answering with Large Language Models

A relation-centric exploration paradigm is introduced, which uses relations rather than entities as search units and thus avoids unreliable entity pruning and proposes Compositional Chain-of-Relations (CCoR), a simple and effective framework that grounds both phases in the KG with two relation chains.

Chenhui Liu, Jianpeng Zhou, Jia-Hai Wang · 0 citations
Preprint Aug 2026

KGCaRe: Explainable Complex Conditional Question Answering using Automatic Knowledge Graph Construction and Context Retrieval with LLMs

KGCaRe is proposed, a hybrid approach that combines neural retrieval with symbolic reasoning over LLM-generated KGs that consistently outperforms existing baselines, including Vanilla LLM, Code Prompt, Text Prompt, Think-on-Graph, Vanilla RAG, and HybridContextQA.

Ghanshyam Verma, Sima Sarkar, Devishree Pillai et al. · 0 citations
Open access Aug 2026

Constrained Entity Selection Under Partial Knowledge for LLM-Based Knowledge Graph QA

Experiments show that precision improves by filtering invalid candidates, while recall is preserved due to retaining candidates whose constraints are not explicitly violated, and a three-valued constraint semantics that avoids incorrect rejections under open-world assumptions.

Emanuel Kitzelmann · 0 citations
Open access Aug 2026

Towards Building a Multi-Source Heterogeneous Knowledge Graph for Complex Material Question Answering

Results indicate that integrating multi-source domain knowledge with relation-preserved retrieval and attribute-supported filtering provides more focused and inspectable evidence, thereby supporting more accurate complex material question answering.

Peize Li, Xi Guo, Nan Yin et al. · 0 citations
#artificial intelligence Preprint Sep 2026

Surprising Effectiveness of Self-Demonstrations in Enhancing Schema-Ontology Mapping with LLMs

This paper presents a self-demonstration-driven approach that combines a neuro-symbolic task decomposition with a novel mechanism for automatically generating pattern-guided, dependency-aware demonstrations to address the integration challenge of heterogeneous relational databases into a centralized ontology.

Siddhesh Thombre, Manasi S. Patwardhan, Sunita Sarawagi · 0 citations

Related blog posts

MIT News · Artificial Intelligence Sep 24, 2026

Estimating suicide risk from text

A new language-processing tool could help identify the highest-risk individuals from natural language, enabling swifter interventions.

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