Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
41 tokens/sec
GPT-4o
59 tokens/sec
Gemini 2.5 Pro Pro
41 tokens/sec
o3 Pro
7 tokens/sec
GPT-4.1 Pro
50 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

AdaLoGN: Adaptive Logic Graph Network for Reasoning-Based Machine Reading Comprehension (2203.08992v1)

Published 16 Mar 2022 in cs.CL, cs.AI, cs.NE, and cs.SC

Abstract: Recent machine reading comprehension datasets such as ReClor and LogiQA require performing logical reasoning over text. Conventional neural models are insufficient for logical reasoning, while symbolic reasoners cannot directly apply to text. To meet the challenge, we present a neural-symbolic approach which, to predict an answer, passes messages over a graph representing logical relations between text units. It incorporates an adaptive logic graph network (AdaLoGN) which adaptively infers logical relations to extend the graph and, essentially, realizes mutual and iterative reinforcement between neural and symbolic reasoning. We also implement a novel subgraph-to-node message passing mechanism to enhance context-option interaction for answering multiple-choice questions. Our approach shows promising results on ReClor and LogiQA.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (5)
  1. Xiao Li (354 papers)
  2. Gong Cheng (78 papers)
  3. Ziheng Chen (30 papers)
  4. Yawei Sun (4 papers)
  5. Yuzhong Qu (30 papers)
Citations (17)