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.
Cite
CITATION STYLE
Li, X., Cheng, G., Chen, Z., Sun, Y., & Qu, Y. (2022). AdaLoGN: Adaptive Logic Graph Network for Reasoning-Based Machine Reading Comprehension. In Proceedings of the Annual Meeting of the Association for Computational Linguistics (Vol. 1, pp. 7147–7161). Association for Computational Linguistics (ACL). https://doi.org/10.18653/v1/2022.acl-long.494
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.