{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/temporal-knowledge-graph-question-answering","title":"Temporal knowledge graph question answering via subgraph reasoning","arxiv_id":null,"date":"2022-05-30","proceeding":"KBS 2022 5","authors":["Ziyang Chen","Xiang Zhao","Jinzhi Liao","Xinyi Li","Evangelos Kanoulas"],"abstract":"Knowledge graph question answering (KGQA) has recently received a lot of attention and many innovative methods have been proposed in this area, but few have been developed for temporal KGQA. Most of the existing temporal KGQA methods focus on semantic or temporal level matching and lack the ability to reason about time constraints. In this paper we propose a subgraph-based model for answering complex questions over temporal knowledge graphs (TKG), inspired by human cognition. Our method, called SubGraph Temporal Reasoning (SubGTR), consists of three main modules: implicit knowledge extraction, relevant facts search, and subgraph logic reasoning. First, the question is reformulated using background knowledge stored in the temporal knowledge graph to acquire explicit time constraints. Then, the TKG is being searched to identify relevant entities and obtain an initial scoring of them. Finally the time constraints are quantified and applied using temporal logic to reach to the final answer. To evaluate our model we experiment against temporal QA benchmarks. We observe that existing benchmarks contain many pseudo-temporal questions, and we propose Complex-CronQuestions, which a filtered version of CronQuestions and which can better demonstrate the model’s inference ability for complex temporal questions. Experimental results show that SubGTR achieves state-of-the-art performance on both CronQuestions and Complex-CronQuestions. Moreover, our model shows better performance in handling the entity cold-start problem compared to existing temporal KGQA methods.","url_abs":"https://www.sciencedirect.com/science/article/pii/S0950705122005603","url_pdf":"https://www.sciencedirect.com/science/article/pii/S0950705122005603/pdfft?md5=7ddd57446c99fac248bea167b986d9a7&pid=1-s2.0-S0950705122005603-main.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":"temporal-knowledge-graph-question-answering","repo_url":"https://github.com/czy1999/SubGTR","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"graph-question-answering","task_name":"Graph Question Answering"},{"task_slug":"knowledge-graphs","task_name":"Knowledge Graphs"},{"task_slug":"question-answering","task_name":"Question Answering"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/question-answering-on-complex-cronquestions","task":"Question Answering","dataset":"Complex-CronQuestions","model":"SubGTR","rank_in_archive_order":1,"of":4,"metrics":{"Hits@1":"92"},"uses_additional_data":false},{"leaderboard":"/sota/question-answering-on-cronquestions","task":"Question Answering","dataset":"CronQuestions","model":"SubGTR","rank_in_archive_order":5,"of":29,"metrics":{"Hits@1":"96.6"},"uses_additional_data":false}],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"no_arxiv_id","checked_against":null,"by_repo":[{"repo":"czy1999/SubGTR","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"5a258ff2991b02f368575649fcda1764fa73900eb2ac7e0f40a3c05758cf3161","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}