Logical Discrete Graphical Models Must Supplement Large Language Models for Information Synthesis
On the map: LLM reasoning → Knowledge- and tool-augmented reasoning
Abstract (arXiv)
Given the emergent reasoning abilities of large language models, information retrieval is becoming more complex. Rather than just retrieve a document, modern information retrieval systems advertise that they can synthesize an answer based on potentially many different documents, conflicting data sources, and using reasoning. We review recent literature and argue that the large language model has crucial flaws that prevent it from on its own ever constituting general intelligence, or answering general information synthesis requests. This review shows that the following are problems for large language models: hallucinations, complex reasoning, planning under uncertainty, and complex calculations. We outline how logical discrete graphical models can solve all of these problems, and outline a method of training a logical discrete model from unlabeled text.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Placed in Knowledge- and tool-augmented reasoning, one of 17 directions in LLM reasoning. First posted on arXiv 14 Mar 2024.
Builds on
No reference list yet.
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2025The Structure-Content Trade-off in Knowledge Graph Retrieval
- 2023Evaluating the Effectiveness of Retrieval-Augmented Large Language Models in Scientific Document Reasoning
- 2024A Categorization of Complexity Classes for Information Retrieval and Synthesis Using Natural Logic
- 2025Reasoning in Action: MCTS-Driven Knowledge Retrieval for Large Language Models
- 2023Evaluating Large Language Models on Graphs: Performance Insights and Comparative Analysis
- 2025Model-Document Protocol for AI Search
- 2025A Survey of Graph Retrieval-Augmented Generation for Customized Large Language Models
- 2026Breaking the Evaluation Paradox: Evaluating High-Entropy Search with Computationally Irreducible Constraints