HexLogicAgent is proposed, a framework that first organizes the meaning of natural-language statements and then guides logical reasoning through structured verification, supported by a logical hexagon theory, which explains why a complete structure of opposing meanings is necessary for reliable reasoning.
Abstract
Large language models (LLMs) have become powerful tools for language understanding and logical reasoning. However, they still make mistakes when a problem requires both understanding meaning and following logic. A key reason is that natural-language statements often carry implicit semantic relations before any formal reasoning begins. If these hidden meanings are not properly organized, the model may reach incorrect conclusions even when the subsequent reasoning process appears logically valid. Existing methods improve reasoning through decomposition, symbolic translation, external solvers, or self-verification, but pay comparatively less attention to the semantic structure on which reasoning depends. In this paper, we further investigate how semantic organization influences logical reasoning in LLMs. To this end, we propose HexLogicAgent, a framework that first organizes the meaning of natural-language statements and then guides logical reasoning through structured verification. In our investigation, we also make two observations. First, incomplete semantic representations, rather than deductive inference itself, are a major source of logical reasoning failures in LLMs. Second, explicitly modeling the complete structure of semantic opposition substantially delays the degradation of reasoning performance as logical complexity increases. Experiments on challenging logical reasoning benchmarks demonstrate that HexLogicAgent consistently improves reasoning reliability across multiple LLMs. The core idea is supported by a logical hexagon theory, which explains why a complete structure of opposing meanings is necessary for reliable reasoning.
Logical reasoning with large language models (LLMs) is a critical capability, as it reflects a system's ability to correctly deduce hypotheses from a given context using faithful deductive processes. However, LLM reasoning has often been shown to be sensitive to small surface-level variations in problem formulation, ra...
Ramya Keerthy Thatikonda, W. Buntine, Ehsan Shareghi· 0 citations
A Neuro-Symbolic architecture that integrates a Logical Knowledge Graph (LKG) with dynamic solver routing, and introduces an ontology-based LKG that treats logical rules and constraints as first-class topological nodes, enabling explicit modeling of dependencies extracted from text.
Hai-Zhao Fan, Yu-Chi Xiong, Jize Wang et al.· 0 citations
Most of mathematical knowledge has been communicated through so-called informal use of mathematics and natural language. With large language models (LLMs) being highly adept in using natural language, they achieve strong performance, yet not perfect, in informal mathematical reasoning. Restraining LLMs to informal reas...
Joshua Ong Jun Leang, Haonan Li, Zheng-Yang Zhao et al.· 0 citations
Since 2023, large language models (LLMs) have achieved remarkable progress in natural language processing, but they still face dilemmas of unclear reasoning processes and low accuracy when tackling complex tasks such as logical reasoning and mathematical computation. The Chain of Thought (CoT) strategy has emerged as a...
Ai Wu, Shun-Nian Luo, Jungmin Li et al.· 電腦學刊· 0 citations
Large language models (LLMs) are said to exhibit “emergent” reasoning capabilities — ones that are virtually nonexistent in smaller models but suddenly emerge as soon as the model size surpasses a critical point. This claim has been at the heart of discussions on the capability forecasting, safety planning and evaluati...
N. Kuotsu· International Journal of Cre...· 0 citations
Test-time compute has emerged as a major approach to improving the capabilities of Large Language Models (LLMs). However, existing test-time reasoning paradigms rely heavily on externally imposed control, either through fixed reasoning programs or through costly expansion in constrained search spaces, limiting both gen...
Z. Gong, Yi-Kun Hou, Zi-Hao Zeng et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.