Hao Chen, Wentao Ding, Yuzhong Qu, Huayu Li
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. We have no repository linked to it either. That is a statement about our graph, not about the paper.
Answering factual questions with temporal intent over knowledge graphs (temporal KGQA) attracts rising attention in recent years. In the generation of temporal queries, existing KGQA methods ignore the fact that some intrinsic connections between events can make them temporally related, which may limit their capability. We systematically analyze the possible interpretation of temporal constraints and conclude the interpretation structures as the Semantic Framework of Temporal Constraints, SF-TCons. Based on the semantic framework, we propose a temporal question answering method, SF-TQA, which generates query graphs by exploring the relevant facts of mentioned entities, where the exploring process is restricted by SF-TCons. Our evaluations show that SF-TQA significantly outperforms existing methods on two benchmarks over different knowledge graphs.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2210.04490")
get_code_for_paper("2210.04490")
have("2210.04490")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2210.04490.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2210.04490)
Connect an agent — have() is free.