grounding-llm-reasoning-under-incomplete-graph-evidence-1b2fef84·1 events·first seen Aliases: Grounding LLM Reasoning under Incomplete Graph Evidence
A new arXiv preprint develops a formal theoretical framework for understanding how LLMs reason when guided by incomplete knowledge graphs. The authors introduce constructs including entity anchors, typed relation residuals, path energies, and support regions, and prove that under open-world incompleteness no hard rule can simultaneously reject all false unsupported trajectories while retaining all true-but-unobserved ones. Soft grounding is characterized as a KL-regularized deformation of the LLM prior, with hard conditioning as an infinite-penalty limit. The framework yields stability bounds under evidence perturbations and has implications for GraphRAG, KGQA, graph agents, constrained decoding, and faithful generation.