明确语义关系的图推理

IF 3.2 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS High-Confidence Computing Pub Date : 2023-11-24 DOI:10.1016/j.hcc.2023.100190
Tianyou Zhu, Shi Liu, Bo Li, Junjian Liu, Pufan Liu, Fei Zheng
{"title":"明确语义关系的图推理","authors":"Tianyou Zhu,&nbsp;Shi Liu,&nbsp;Bo Li,&nbsp;Junjian Liu,&nbsp;Pufan Liu,&nbsp;Fei Zheng","doi":"10.1016/j.hcc.2023.100190","DOIUrl":null,"url":null,"abstract":"<div><p>Multi-hop reasoning over language or graphs represents a significant challenge in contemporary research, particularly with the reliance on deep neural networks. These networks are integral to text reasoning processes, yet they present challenges in extracting and representing domain or commonsense knowledge, and they often lack robust logical reasoning capabilities. To address these issues, we introduce an innovative text reasoning framework. This framework is grounded in the use of a semantic relation graph and a graph neural network, designed to enhance the model’s ability to encapsulate knowledge and facilitate complex multi-hop reasoning.</p><p>Our framework operates by extracting knowledge from a broad range of texts. It constructs a semantic relationship graph based on the logical relationships inherent in the reasoning process. Beginning with the core question, the framework methodically deduces key knowledge, using it as a guide to iteratively establish a complete evidence chain, thereby determining the final answer. Leveraging the advanced reasoning capabilities of the graph neural network, this approach is adept at multi-hop logical reasoning. It demonstrates strong performance in tasks like machine reading comprehension and question answering, while also clearly delineating the path of logical reasoning.</p></div>","PeriodicalId":100605,"journal":{"name":"High-Confidence Computing","volume":"4 2","pages":"Article 100190"},"PeriodicalIF":3.2000,"publicationDate":"2023-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2667295223000880/pdfft?md5=828625193dc2302f5c9c29c69fed0f34&pid=1-s2.0-S2667295223000880-main.pdf","citationCount":"0","resultStr":"{\"title\":\"Graph reasoning over explicit semantic relation\",\"authors\":\"Tianyou Zhu,&nbsp;Shi Liu,&nbsp;Bo Li,&nbsp;Junjian Liu,&nbsp;Pufan Liu,&nbsp;Fei Zheng\",\"doi\":\"10.1016/j.hcc.2023.100190\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Multi-hop reasoning over language or graphs represents a significant challenge in contemporary research, particularly with the reliance on deep neural networks. These networks are integral to text reasoning processes, yet they present challenges in extracting and representing domain or commonsense knowledge, and they often lack robust logical reasoning capabilities. To address these issues, we introduce an innovative text reasoning framework. This framework is grounded in the use of a semantic relation graph and a graph neural network, designed to enhance the model’s ability to encapsulate knowledge and facilitate complex multi-hop reasoning.</p><p>Our framework operates by extracting knowledge from a broad range of texts. It constructs a semantic relationship graph based on the logical relationships inherent in the reasoning process. Beginning with the core question, the framework methodically deduces key knowledge, using it as a guide to iteratively establish a complete evidence chain, thereby determining the final answer. Leveraging the advanced reasoning capabilities of the graph neural network, this approach is adept at multi-hop logical reasoning. It demonstrates strong performance in tasks like machine reading comprehension and question answering, while also clearly delineating the path of logical reasoning.</p></div>\",\"PeriodicalId\":100605,\"journal\":{\"name\":\"High-Confidence Computing\",\"volume\":\"4 2\",\"pages\":\"Article 100190\"},\"PeriodicalIF\":3.2000,\"publicationDate\":\"2023-11-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.sciencedirect.com/science/article/pii/S2667295223000880/pdfft?md5=828625193dc2302f5c9c29c69fed0f34&pid=1-s2.0-S2667295223000880-main.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"High-Confidence Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2667295223000880\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"High-Confidence Computing","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2667295223000880","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

语言或图形上的多跳推理是当代研究中的一项重大挑战,尤其是对深度神经网络的依赖。这些网络在文本推理过程中不可或缺,但它们在提取和表示领域或常识性知识方面存在挑战,而且往往缺乏强大的逻辑推理能力。为了解决这些问题,我们引入了一个创新的文本推理框架。该框架以语义关系图和图神经网络的使用为基础,旨在增强模型封装知识和促进复杂多跳推理的能力。它根据推理过程中固有的逻辑关系构建语义关系图。从核心问题开始,该框架有条不紊地推导出关键知识,并以此为指导,反复建立完整的证据链,从而确定最终答案。利用图神经网络的高级推理能力,这种方法擅长多跳逻辑推理。它在机器阅读理解和问题解答等任务中表现出强劲的性能,同时还清晰地勾勒出逻辑推理的路径。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Graph reasoning over explicit semantic relation

Multi-hop reasoning over language or graphs represents a significant challenge in contemporary research, particularly with the reliance on deep neural networks. These networks are integral to text reasoning processes, yet they present challenges in extracting and representing domain or commonsense knowledge, and they often lack robust logical reasoning capabilities. To address these issues, we introduce an innovative text reasoning framework. This framework is grounded in the use of a semantic relation graph and a graph neural network, designed to enhance the model’s ability to encapsulate knowledge and facilitate complex multi-hop reasoning.

Our framework operates by extracting knowledge from a broad range of texts. It constructs a semantic relationship graph based on the logical relationships inherent in the reasoning process. Beginning with the core question, the framework methodically deduces key knowledge, using it as a guide to iteratively establish a complete evidence chain, thereby determining the final answer. Leveraging the advanced reasoning capabilities of the graph neural network, this approach is adept at multi-hop logical reasoning. It demonstrates strong performance in tasks like machine reading comprehension and question answering, while also clearly delineating the path of logical reasoning.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
4.70
自引率
0.00%
发文量
0
期刊最新文献
Erratum to “Exploring Personalized Internet of Things (PIoT), social connectivity, and Artificial Social Intelligence (ASI): A survey” [High-Confidence Computing 4 (2024) 100242] Identity-based threshold (multi) signature with private accountability for privacy-preserving blockchain Navigating the Digital Twin Network landscape: A survey on architecture, applications, privacy and security Erratum to “An effective digital audio watermarking using a deep convolutional neural network with a search location optimization algorithm for improvement in Robustness and Imperceptibility” [High-Confid. Comput. 3 (2023) 100153] A lightweight practical consensus mechanism for supply chain blockchain
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1