AdaLoGN: Adaptive Logic Graph Network for Reasoning-Based Machine Reading Comprehension (2022.acl-long)
Copied to clipboard
| Challenge: | Existing methods and limitations for machine reading comprehension are insufficient for logical reasoning over text. |
| Approach: | They propose a neural-symbolic approach which passes messages over a graph representing logical relations between text units to predict an answer. |
| Outcome: | The proposed approach outperforms existing methods on ReClor and LogiQA. |
Similar Papers
LogiGraph: Logical Reasoning with Contrastive Learning and Lightweight Graph Networks (2025.coling-main)
Copied to clipboard
| Challenge: | Existing methods emphasize contextual semantics while others pay more attention to explicit logical features. Existing models utilize graph convolutional networks (GCN) for node updates, still exhibiting some shortcomings. |
| Approach: | They propose a logical reasoning method with contrastive learning and lightweight graph networks (LogiGraph) they employ conjunction and punctuation marks as two types of edges to construct a dual graph. |
| Outcome: | The proposed method improves the GCN and employs conjunction and punctuation marks as two types of edges to construct a dual graph. |
Modeling Hierarchical Reasoning Chains by Linking Discourse Units and Key Phrases for Reading Comprehension (2022.coling-1)
Copied to clipboard
| Challenge: | Existing methods of logical reasoning focus on entity-aware information but ignore hierarchical relations that may even have mutual effects. |
| Approach: | They propose a holistic graph network that deals with context at both discourse-level and word-level as the basis for logical reasoning. |
| Outcome: | The proposed method improves on logical reasoning QA datasets and natural language inference datasets. |
Question Answering by Reasoning Across Documents with Graph Convolutional Networks (N19-1)
Copied to clipboard
| Challenge: | Recent research in reading comprehension has focused on answering questions based on individual documents or even single paragraphs. |
| Approach: | They propose a neural model which integrates and reasons relying on information spread within documents and across multiple documents. |
| Outcome: | The proposed model achieves state-of-the-art on a multi-document question answering dataset, WikiHop. |
ReasoningLM: Enabling Structural Subgraph Reasoning in Pre-trained Language Models for Question Answering over Knowledge Graph (2023.emnlp-main)
Copied to clipboard
| Challenge: | Question Answering over Knowledge Graph (KGQA) aims to find answer entities for natural language questions based on knowledge graphs. |
| Approach: | They propose a subgraph-aware self-attention mechanism to imitate the graph neural network (GNN) based module to perform multi-hop reasoning on KG. |
| Outcome: | The proposed method surpasses state-of-the-art models by a large margin even with fewer updated parameters and less training data. |
Machine Reading Comprehension Using Structural Knowledge Graph-aware Network (D19-1)
Copied to clipboard
| Challenge: | Recent large-scale datasets specify that external knowledge is required to answer questions. |
| Approach: | They propose a model that leverages external knowledge to construct sub-graphs for entities in machine comprehension context. |
| Outcome: | The proposed model achieves state-of-the-art performance on the ReCoRD dataset. |
Towards Interpretable Tabular Reasoning: Enhancing LLM Reasoning on Tabular Data with Pre-Constructed Logic Graph (2026.acl-long)
Copied to clipboard
Lirong Gao, Zewei Yu, Zhongrui Yin, Qi Zhang, Yuke Zhu, Bo Zheng, Haobo Wang, Junbo Zhao, Gang Chen, Sheng Guo
| Challenge: | Tabular data is used in fields such as finance and healthcare due to its heterogeneity and complexity. |
| Approach: | They propose a Logic-Graph-Enhanced LLM Reasoning framework that integrates the strengths of tree-based models and LLMs to improve their interpretability. |
| Outcome: | The proposed framework outperforms tree-based models and state-of-the-art LLMs on tabular prediction tasks, achieving superior accuracy and interpretability. |
Adaptive LLM-Symbolic Reasoning via Dynamic Logical Solver Composition (2026.eacl-long)
Copied to clipboard
| Challenge: | Existing approaches to NLP are static and require manual formalization. |
| Approach: | They propose an adaptive, multi-paradigm, neuro-symbolic inference framework that automatically identifies formal reasoning strategies from problems expressed in natural language and dynamically selects and applies specialized formal logical solvers. |
| Outcome: | The proposed framework outperforms baselines on individual and multi-paradigm reasoning tasks by 17% and 6%. |
GraphMR: Graph Neural Network for Mathematical Reasoning (2021.emnlp-main)
Copied to clipboard
| Challenge: | Existing studies have shown the effectiveness of sequence-to-sequence (Seq2Seque) on mathematics solving. |
| Approach: | They propose a graph-to-sequence neural network which can learn hierarchical information of graphs inputs to solve mathematical problems and speculate answers. |
| Outcome: | The proposed neural network outperforms other neural networks in hidden information learning and mathematics resolving. |
Multi-choice Relational Reasoning for Machine Reading Comprehension (2020.coling-main)
Copied to clipboard
| Challenge: | cloze-style reading comprehension is a task that requires much semantic understanding and reasoning using various clues from texts. |
| Approach: | They propose a multi-choice relational reasoning model that emulates human reading comprehension by combining fusion representations of document, query and candidates. |
| Outcome: | The proposed model outperforms baseline models significantly on four datasets. |
Learning Logic Rules for Document-Level Relation Extraction (2021.emnlp-main)
Copied to clipboard
| Challenge: | Existing models for document-level relation extraction relied on implicitly powerful representations, which makes the model less transparent. |
| Approach: | They propose a probabilistic model for document-level relation extraction by learning logic rules. |
| Outcome: | The proposed model outperforms baseline models in relation performance and logical consistency. |