{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/dynamic-semantic-graph-construction-and","title":"Dynamic Semantic Graph Construction and Reasoning for Explainable Multi-hop Science Question Answering","arxiv_id":"2105.11776","date":"2021-05-25","proceeding":"Findings (ACL) 2021 8","authors":["Weiwen Xu","Huihui Zhang","Deng Cai","Wai Lam"],"abstract":"Knowledge retrieval and reasoning are two key stages in multi-hop question answering (QA) at web scale. Existing approaches suffer from low confidence when retrieving evidence facts to fill the knowledge gap and lack transparent reasoning process. In this paper, we propose a new framework to exploit more valid facts while obtaining explainability for multi-hop QA by dynamically constructing a semantic graph and reasoning over it. We employ Abstract Meaning Representation (AMR) as semantic graph representation. Our framework contains three new ideas: (a) {\\tt AMR-SG}, an AMR-based Semantic Graph, constructed by candidate fact AMRs to uncover any hop relations among question, answer and multiple facts. (b) A novel path-based fact analytics approach exploiting {\\tt AMR-SG} to extract active facts from a large fact pool to answer questions. (c) A fact-level relation modeling leveraging graph convolution network (GCN) to guide the reasoning process. Results on two scientific multi-hop QA datasets show that we can surpass recent approaches including those using additional knowledge graphs while maintaining high explainability on OpenBookQA and achieve a new state-of-the-art result on ARC-Challenge in a computationally practicable setting.","url_abs":"https://arxiv.org/abs/2105.11776v1","url_pdf":"https://arxiv.org/pdf/2105.11776v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"dynamic-semantic-graph-construction-and","repo_url":"https://github.com/wwxu21/AMR-SG","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"arc","task_name":"ARC"},{"task_slug":"abstract-meaning-representation","task_name":"Abstract Meaning Representation"},{"task_slug":"knowledge-graphs","task_name":"Knowledge Graphs"},{"task_slug":"multi-hop-question-answering","task_name":"Multi-hop Question Answering"},{"task_slug":"question-answering","task_name":"Question Answering"},{"task_slug":"retrieval","task_name":"Retrieval"},{"task_slug":"science-question-answering","task_name":"Science Question Answering"},{"task_slug":"graph-construction","task_name":"graph construction"},{"task_slug":null,"task_name":"valid"}],"methods":[{"method_slug":"convolution","method_name":"Convolution"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2105.11776","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.11776"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/wwxu21/AMR-SG","reach":null}],"summary":{"ran":2},"by_repo_kind":{"official":{"samples":2,"ran":2,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":2,"samples":[{"code_sha256_prefix":"fc31b6dfd485b025","entry":"GCN","repo":"wwxu21/AMR-SG","repo_kind":"official","path":"RoBERTa_finetune/transformers_amr/modeling_bert.py","file_url":"https://github.com/wwxu21/AMR-SG/blob/HEAD/RoBERTa_finetune/transformers_amr/modeling_bert.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"fc31b6dfd485b025"}},{"code_sha256_prefix":"c004971a21b5e0be","entry":"GCNlayer","repo":"wwxu21/AMR-SG","repo_kind":"official","path":"RoBERTa_finetune/transformers_amr/modeling_bert.py","file_url":"https://github.com/wwxu21/AMR-SG/blob/HEAD/RoBERTa_finetune/transformers_amr/modeling_bert.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"c004971a21b5e0be"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}