Verifiable reasoning of large language models over structured spatial data

Authors

DOI:

https://doi.org/10.24425/ijet.2026.6314

Abstract

Large language models increasingly answer questions grounded in structured spatial data such as road networks: in navigation assistants, in conversational interfaces to geographic information, and in tools that maintain digital maps. Their answers are fluent but not verifiable, and in spatial domains a claim about a turn restriction, a lane, or an opening time is either consistent with the map or it is not. This survey reviews the methods by which such claims can be machine-checked. We organize the literature along an argument: models cannot reliably verify their own outputs; external checkers such as program execution and symbolic solvers demonstrably can; constrained decoding guarantees syntactic but not factual validity; execution against the data is the established gold standard of evaluation in the text-to-query literature; and knowledge-graph grounding already supports detect-verify-repair pipelines. We then examine the spatial domain specifically and find a documented gap: existing geospatial benchmarks measure model capability, and none verifies model claims against lane-level, temporal, or version-aware map data. We synthesize a taxonomy of verification mechanisms, compare existing benchmarks by oracle type, and outline a research agenda toward validity contracts and certificates for spatial claims that remain checkable as the underlying map evolves.

Downloads

Published

2026-10-29

How to Cite

Essam, Kamal, and Ryszard S. Romaniuk. “Verifiable Reasoning of Large Language Models over Structured Spatial Data”. International Journal of Electronics and Telecommunications, vol. 72, no. 4, Oct. 2026, pp. 1-7, doi:10.24425/ijet.2026.6314.

Issue

Section

Artykuły

Most read articles by the same author(s)

1 2 3 4 > >>