Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 74

The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.

Complex Temporal Question Answering on Knowledge Graphs

Jia, Zhen, Pramanik, Soumajit, Saha Roy, Rishiraj, Weikum, Gerhard · 2021 · Proceedings of the 30th ACM International Conference on Information & Knowledge Management

Abstract

Question answering over knowledge graphs (KG-QA) is a vital topic in IR. Questions with temporal intent are a special class of practical importance, but have not received much attention in research. This work presents EXAQT, the first end-to-end system for answering complex temporal questions that have multiple entities and predicates, and associated temporal conditions. EXAQT answers natural language questions over KGs in two stages, one geared towards high recall, the other towards precision at top ranks. The first step computes question-relevant compact subgraphs within the KG, and judiciously enhances them with pertinent temporal facts, using Group Steiner Trees and fine-tuned BERT models. The second step constructs relational graph convolutional networks (R-GCNs) from the first step's output, and enhances the R-GCNs with time-aware entity embeddings and attention over temporal relations. We evaluate EXAQT on TimeQuestions, a large dataset of 16k temporal questions we compiled from a variety of general purpose KG-QA benchmarks. Results show that EXAQT outperforms three state-of-the-art systems for answering complex questions over KGs, thereby justifying specialized treatment of temporal QA.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/3459637.3482416

Cites

9 of 9 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 9 references

Research works printed but not linked: 68

  1. 10.1145/3178876.3186004 · DOI
  2. Abdalghani Abujabal , Rishiraj Saha Roy , Mohamed Yahya, and Gerhard Weikum. 2019 . ComQA: A Community-sourced Dataset for Complex Factoid Question Answering with Paraphrase Clusters. In NAACL-HLT. Abdalghani Abujabal, Rishiraj Saha Roy, Mohamed Yahya, and Gerhard Weikum. 2019. ComQA: A Community-sourced Dataset for Complex Factoid Question Answering with Paraphrase Clusters. In NAACL-HLT.
  3. 10.1145/3038912.3052583 · DOI · Paper page
  4. 10.5555/1287369.1287473 · doi:10.5555/1287369.1287473
  5. David Ahn , Steven Schockaert , Martine De Cock, and Etienne Kerre . 2006 . Supporting temporal question answering: Strategies for offline data collection. In ICoS- 5. David Ahn, Steven Schockaert, Martine De Cock, and Etienne Kerre. 2006. Supporting temporal question answering: Strategies for offline data collection. In ICoS-5.
  6. 10.1145/1328964.1328968 · DOI · Paper page
  7. Omar Alonso , Jannik Strötgen , Ricardo Baeza-Yates , and Michael Gertz . 2011 . Temporal Information Retrieval: Challenges and Opportunities . TWAW , Vol. 11 (2011). Omar Alonso, Jannik Strötgen, Ricardo Baeza-Yates, and Michael Gertz. 2011. Temporal Information Retrieval: Challenges and Opportunities. TWAW, Vol. 11 (2011).
  8. 10.5555/1785162.1785216 · doi:10.5555/1785162.1785216
  9. Junwei Bao Nan Duan Zhao Yan Ming Zhou and Tiejun Zhao. 2016. Constraint-based question answering with knowledge graph. In COLING. Junwei Bao Nan Duan Zhao Yan Ming Zhou and Tiejun Zhao. 2016. Constraint-based question answering with knowledge graph. In COLING.
  10. 10.1145/2806416.2806472 · DOI · Paper page
  11. Jonathan Berant Andrew Chou Roy Frostig and Percy Liang. 2013. Semantic parsing on freebase from question-answer pairs. In EMNLP. Jonathan Berant Andrew Chou Roy Frostig and Percy Liang. 2013. Semantic parsing on freebase from question-answer pairs. In EMNLP.
  12. 10.1007/978-3-642-12275-0_5 · DOI · Paper page
  13. 10.1145/3357384.3357874 · DOI
  14. 10.1145/3357384.3358033 · DOI
  15. 10.1016/0004-3702(72)90040-9 · DOI
  16. Qingqing Cai and Alexander Yates. 2013. Large-scale semantic parsing via schema matching and lexicon extension. In ACL. Qingqing Cai and Alexander Yates. 2013. Large-scale semantic parsing via schema matching and lexicon extension. In ACL.
  17. 10.14778/3229863.3236252 · DOI
  18. Tarc'i sio Souza Costa Simon Gottschalk and Elena Demidova. 2020. Event-QA: A Dataset for Event-Centric Question Answering over Knowledge Graphs. In CIKM. Tarc'i sio Souza Costa Simon Gottschalk and Elena Demidova. 2020. Event-QA: A Dataset for Event-Centric Question Answering over Knowledge Graphs. In CIKM. · DOI
  19. 10.1145/3308558.3314124 · DOI
  20. Bolin Ding , Jeffrey Xu Yu , Shan Wang, Lu Qin, Xiao Zhang, and Xuemin Lin. 2007 . Finding top-k min-cost connected trees in databases. In ICDE. Bolin Ding, Jeffrey Xu Yu, Shan Wang, Lu Qin, Xiao Zhang, and Xuemin Lin. 2007. Finding top-k min-cost connected trees in databases. In ICDE.
  21. Mohnish Dubey Debayan Banerjee Abdelrahman Abdelkawi and Jens Lehmann. 2019. LC-QuAD 2.0: A large dataset for complex question answering over Wikidata and DBpedia. In ISWC. Mohnish Dubey Debayan Banerjee Abdelrahman Abdelkawi and Jens Lehmann. 2019. LC-QuAD 2.0: A large dataset for complex question answering over Wikidata and DBpedia. In ISWC. · DOI · Paper page
  22. 10.5555/2969442.2969488 · doi:10.5555/2969442.2969488
  23. 10.1145/1871437.1871689 · DOI · Paper page
  24. Alberto Garcia-Duran , Sebastijan Dumanvc ić, and Mathias Niepert . 2018 . Learning Sequence Encoders for Temporal Knowledge Graph Completion. In EMNLP. Alberto Garcia-Duran, Sebastijan Dumanvc ić, and Mathias Niepert. 2018. Learning Sequence Encoders for Temporal Knowledge Graph Completion. In EMNLP.
  25. Rishab Goel , Seyed Mehran Kazemi , Marcus Brubaker, and Pascal Poupart. 2020 . Diachronic embedding for temporal knowledge graph completion. In AAAI. Rishab Goel, Seyed Mehran Kazemi, Marcus Brubaker, and Pascal Poupart. 2020. Diachronic embedding for temporal knowledge graph completion. In AAAI.
  26. Sanda Harabagiu and Cosmin Adrian Bejan . 2005 . Question answering based on temporal inference . In AAAI Workshop on inference for textual question answering. Sanda Harabagiu and Cosmin Adrian Bejan. 2005. Question answering based on temporal inference. In AAAI Workshop on inference for textual question answering.
  27. 10.1109/TKDE.2003.1208999 · DOI · Paper page
  28. 10.5555/2145432.2145521 · doi:10.5555/2145432.2145521
  29. Zhen Jia , Abdalghani Abujabal , Rishiraj Saha Roy , Jannik Strötgen, and Gerhard Weikum. 2018 a. TempQuestions: A benchmark for temporal question answering. In HQA. Zhen Jia, Abdalghani Abujabal, Rishiraj Saha Roy, Jannik Strötgen, and Gerhard Weikum. 2018a. TempQuestions: A benchmark for temporal question answering. In HQA.
  30. 10.1145/3269206.3269247 · DOI · Paper page
  31. 10.1145/3404835.3462859 · DOI
  32. 10.1145/2911451.2914805 · DOI
  33. 10.1145/2872427.2883055 · DOI
  34. Timothée Lacroix Guillaume Obozinski and Nicolas Usunier. 2020. Tensor Decompositions for temporal knowledge base completion. In ICLR. Timothée Lacroix Guillaume Obozinski and Nicolas Usunier. 2020. Tensor Decompositions for temporal knowledge base completion. In ICLR.
  35. Julien Leblay and Melisachew Wudage Chekol. 2018. Deriving validity time in knowledge graph. In TempWeb. Julien Leblay and Melisachew Wudage Chekol. 2018. Deriving validity time in knowledge graph. In TempWeb. · DOI · Paper page
  36. Belinda Z. Li Sewon Min Srinivasan Iyer Yashar Mehdad and Wen-tau Yih. 2020. Efficient One-Pass End-to-End Entity Linking for Questions. In EMNLP. Belinda Z. Li Sewon Min Srinivasan Iyer Yashar Mehdad and Wen-tau Yih. 2020. Efficient One-Pass End-to-End Entity Linking for Questions. In EMNLP. · DOI
  37. 10.1145/2882903.2915217 · DOI
  38. 10.1002/int.20502 · DOI
  39. 10.1145/3331184.3331252 · DOI
  40. 10.5555/2999792.2999959 · doi:10.5555/2999792.2999959
  41. Borja Navarro-Colorado and Estela Saquete. 2015. Combining temporal information and topic modeling for cross-document event ordering. In arXiv. Borja Navarro-Colorado and Estela Saquete. 2015. Combining temporal information and topic modeling for cross-document event ordering. In arXiv. · doi:10.18653/v1/s15-2138
  42. Barlas Oguz Xilun Chen Vladimir Karpukhin Stan Peshterliev Dmytro Okhonko Michael Schlichtkrull Sonal Gupta Yashar Mehdad and Scott Yih. 2021. UniK-QA: Unified Representations of Structured and Unstructured Knowledge for Open-Domain Question Answering. In arXiv. Barlas Oguz Xilun Chen Vladimir Karpukhin Stan Peshterliev Dmytro Okhonko Michael Schlichtkrull Sonal Gupta Yashar Mehdad and Scott Yih. 2021. UniK-QA: Unified Representations of Structured and Unstructured Knowledge for Open-Domain Question Answering. In arXiv. · DOI · Paper page
  43. Jeffrey Pennington Richard Socher and Christopher Manning. 2014. GloVe: Global vectors for word representation. In EMNLP. Jeffrey Pennington Richard Socher and Christopher Manning. 2014. GloVe: Global vectors for word representation. In EMNLP. · DOI · Paper page
  44. Soumajit Pramanik , Jesujoba Alabi , Rishiraj Saha Roy, and Gerhard Weikum . 2021 . UNIQORN : Unified Question Answering over RDF Knowledge Graphs and Natural Language Text. In arXiv. Soumajit Pramanik, Jesujoba Alabi, Rishiraj Saha Roy, and Gerhard Weikum. 2021. UNIQORN: Unified Question Answering over RDF Knowledge Graphs and Natural Language Text. In arXiv.
  45. James Pustejovsky , Janyce Wiebe , and Mark Maybury . 2002 . Multiple-perspective and temporal question answering . In Question Answering: Strategy and Resources Workshop Program. James Pustejovsky, Janyce Wiebe, and Mark Maybury. 2002. Multiple-perspective and temporal question answering. In Question Answering: Strategy and Resources Workshop Program.
  46. 10.1145/3336191.3371812 · DOI
  47. 10.1145/3397271.3401421 · DOI
  48. 10.5555/1641503.1641521 · doi:10.5555/1641503.1641521
  49. Apoorv Saxena Soumen Chakrabarti and Partha Talukdar. 2021. Question Answering Over Temporal Knowledge Graphs. In ACL. Apoorv Saxena Soumen Chakrabarti and Partha Talukdar. 2021. Question Answering Over Temporal Knowledge Graphs. In ACL. · DOI · Paper page
  50. Michael Schlichtkrull , Thomas N Kipf , Peter Bloem , Rianne Van Den Berg , Ivan Titov, and Max Welling. 2018 . Modeling relational data with graph convolutional networks. In ESWC. Michael Schlichtkrull, Thomas N Kipf, Peter Bloem, Rianne Van Den Berg, Ivan Titov, and Max Welling. 2018. Modeling relational data with graph convolutional networks. In ESWC.
  51. 10.1145/3366423.3380110 · doi:10.1145/3366423.3380110
  52. 10.5555/1859664.1859735 · doi:10.5555/1859664.1859735
  53. Yu Su Huan Sun Brian Sadler Mudhakar Srivatsa Izzeddin Gür Zenghui Yan and Xifeng Yan. 2016. On generating characteristic-rich question sets for QA evaluation. In EMNLP. Yu Su Huan Sun Brian Sadler Mudhakar Srivatsa Izzeddin Gür Zenghui Yan and Xifeng Yan. 2016. On generating characteristic-rich question sets for QA evaluation. In EMNLP. · DOI
  54. 10.1145/1242572.1242667 · DOI · Paper page
  55. Haitian Sun Tania Bedrax-Weiss and William Cohen. 2019. PullNet: Open Domain Question Answering with Iterative Retrieval on Knowledge Bases and Text. In EMNLP-IJCNLP. Haitian Sun Tania Bedrax-Weiss and William Cohen. 2019. PullNet: Open Domain Question Answering with Iterative Retrieval on Knowledge Bases and Text. In EMNLP-IJCNLP.
  56. Haitian Sun Bhuwan Dhingra Manzil Zaheer Kathryn Mazaitis Ruslan Salakhutdinov and William Cohen. 2018. Open Domain Question Answering Using Early Fusion of Knowledge Bases and Text. In EMNLP. Haitian Sun Bhuwan Dhingra Manzil Zaheer Kathryn Mazaitis Ruslan Salakhutdinov and William Cohen. 2018. Open Domain Question Answering Using Early Fusion of Knowledge Bases and Text. In EMNLP.
  57. 10.14778/3450980.3450982 · DOI
  58. Priyansh Trivedi Gaurav Maheshwari Mohnish Dubey and Jens Lehmann. 2017b. LC-QuAD: A corpus for complex question answering over knowledge graphs. In ISWC. Priyansh Trivedi Gaurav Maheshwari Mohnish Dubey and Jens Lehmann. 2017b. LC-QuAD: A corpus for complex question answering over knowledge graphs. In ISWC. · DOI · Paper page
  59. 10.5555/3305890.3306039 · doi:10.5555/3305890.3306039
  60. 10.1109/ICSC.2012.34 · DOI
  61. 10.1145/3397271.3401416 · doi:10.1145/3397271.3401416
  62. 10.5555/3295222.3295349 · doi:10.5555/3295222.3295349
  63. 10.1145/2629489 · DOI · Paper page
  64. 10.3390/fi12030045 · DOI
  65. 10.1145/2505515.2505677 · DOI
  66. Ikuya Yamada Akari Asai Jin Sakuma Hiroyuki Shindo Hideaki Takeda Yoshiyasu Takefuji and Yuji Matsumoto. 2020. Wikipedia2Vec: An Efficient Toolkit for Learning and Visualizing the Embeddings of Words and Entities from Wikipedia. In EMNLP. Ikuya Yamada Akari Asai Jin Sakuma Hiroyuki Shindo Hideaki Takeda Yoshiyasu Takefuji and Yuji Matsumoto. 2020. Wikipedia2Vec: An Efficient Toolkit for Learning and Visualizing the Embeddings of Words and Entities from Wikipedia. In EMNLP. · DOI · Paper page
  67. Wen-tau Yih Ming-Wei Chang Xiaodong He and Jianfeng Gao. 2015. Semantic Parsing via Staged Query Graph Generation: Question Answering with Knowledge Base. In ACL-IJCNLP. Wen-tau Yih Ming-Wei Chang Xiaodong He and Jianfeng Gao. 2015. Semantic Parsing via Staged Query Graph Generation: Question Answering with Knowledge Base. In ACL-IJCNLP.
  68. 10.1145/3336191.3371847 · DOI

Cited by

See all 74

Metadata

Authors
Jia, Z., Pramanik, S., Saha Roy, R., & Weikum, G.
Affiliations
  • Southwest Jiaotong University, Chengdu, China
  • Indian Institute of Technology Bhilai, Bhilai, India
  • Max Planck Institute for Informatics, Saarbruecken, Germany
Venue
Proceedings of the 30th ACM International Conference on Information & Knowledge Management
Publisher
ACM
Published
2021-10-26
Pages
792-802
Cited by
74
References
9

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Complex Temporal Question Answering on Knowledge Graphs. https://app.cochat.ai/papers/10.1145/3459637.3482416
The paper
Jia, Z., Pramanik, S., Saha Roy, R., & Weikum, G. (2021). Complex Temporal Question Answering on Knowledge Graphs. Proceedings of the 30th ACM International Conference on Information & Knowledge Management. https://doi.org/10.1145/3459637.3482416

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.