Hang Yin

Orcid: 0009-0001-5264-1630

Affiliations:
  • Tsinghua University, Department of Mathematical Sciences, China


According to our database1, Hang Yin authored at least 12 papers between 2021 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Efficient and Scalable Neural Symbolic Search for Knowledge Graph Complex Query Answering.
CoRR, May, 2025

Top Ten Challenges Towards Agentic Neural Graph Databases.
IEEE Data Eng. Bull., 2025

Enhancing Transformers for Generalizable First-Order Logical Entailment.
Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), 2025

Extending Complex Logical Queries on Uncertain Knowledge Graphs.
Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), 2025

2024
Meta Operator for Complex Query Answering on Knowledge Graphs.
CoRR, 2024

Soft Reasoning on Uncertain Knowledge Graphs.
CoRR, 2024

Rethinking Complex Queries on Knowledge Graphs with Neural Link Predictors.
Proceedings of the Twelfth International Conference on Learning Representations, 2024

2023
EFO<sub>k</sub>-CQA: Towards Knowledge Graph Complex Query Answering beyond Set Operation.
CoRR, 2023

On Existential First Order Queries Inference on Knowledge Graphs.
CoRR, 2023

Wasserstein-Fisher-Rao Embedding: Logical Query Embeddings with Local Comparison and Global Transport.
Proceedings of the Findings of the Association for Computational Linguistics: ACL 2023, 2023

2022
Logical Queries on Knowledge Graphs: Emerging Interface of Incomplete Relational Data.
IEEE Data Eng. Bull., 2022

2021
Benchmarking the Combinatorial Generalizability of Complex Query Answering on Knowledge Graphs.
Proceedings of the Neural Information Processing Systems Track on Datasets and Benchmarks 1, 2021


  Loading...