ImageNet classification with deep convolutional neural networks
Alex Krizhevsky, Ilya Sutskever et al.
0
Citations
0
Influential Citations
—
Venue
2026
Year
Large language models often fail when answer options require combining atomic judgments under explicit logical operators, even when they judge the individual atoms correctly. We study compound options connected by AND, OR, and NEITHER/NOR, introducing a framework that decomposes each option into atomic answers and scores contrastive hypotheses about each one, so the model never sees a compound option. An operator-constrained integer linear program then composes the calibrated scores into a single prediction. We evaluate on LOGICAL-COMMONSENSEQA and introduce LOGICAL-SATA, a reading-comprehension benchmark derived from SATA-Bench. Our framework improves Macro-F1 from 48.3 to 77.0 on the human-validated LOGICAL-COMMONSENSEQA split and from 47.0 to 75.6 on LOGICAL-SATA, with the largest gains on NEITHER/NOR.
Large language models (LLMs) have shown remarkable capabilities in many natural language tasks, yet they often stumble when faced with compound answer options that require combining multiple atomic judgments under logical operators like AND, OR, and NEITHER/NOR. This paper identifies a fundamental limitation: even when models correctly judge individual atoms, they fail to compose them logically. This is a significant problem because real-world reasoning often involves such compound statements, and the inability to handle them undermines the reliability of LLMs in decision-making and question-answering.
The authors propose a novel framework that sidesteps the issue by never presenting the compound option to the model. Instead, they decompose each option into atomic answers, score each atom independently, and then use an operator-constrained integer linear program (ILP) to compose the scores into a final prediction. This approach is both intuitive and effective, as demonstrated by substantial improvements on two benchmarks. The introduction of LOGICAL-SATA, a new benchmark derived from SATA-Bench, provides a valuable resource for future research on logical composition in reading comprehension.
The proposed framework achieves dramatic improvements over baseline LLMs. On the human-validated LOGICAL-COMMONSENSEQA split, Macro-F1 jumps from 48.3 to 77.0, a relative improvement of nearly 60%. On LOGICAL-SATA, the improvement is from 47.0 to 75.6. Notably, the largest gains are observed on NEITHER/NOR options, which are often the most challenging because they require negating both atoms. These results underscore the effectiveness of the decomposition and composition approach.
This work has significant implications for the AI field. By demonstrating that structured compositional reasoning can be achieved through decomposition and ILP-based composition, it opens new avenues for improving LLM reasoning without requiring architectural changes or extensive fine-tuning. The approach is model-agnostic and can be applied to any LLM, making it a practical tool for enhancing logical reasoning in real-world applications. Moreover, the introduction of LOGICAL-SATA provides a benchmark that can drive further research in this area. The success on NEITHER/NOR suggests that the method is particularly adept at handling negation, a known weakness of LLMs. Overall, this paper contributes both a novel methodology and a new benchmark, advancing the state of the art in compositional reasoning.
Alex Krizhevsky, Ilya Sutskever et al.
Ashish Vaswani, Noam Shazeer et al.
Douglas M. Bates, Martin Mächler et al.
Diederik P. Kingma, Jimmy Ba